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


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


Checking for ERROR reachability
Using default analysis
Version cde23df1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix025_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m
[2024-06-14 14:51:35,311 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 14:51:35,404 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 14:51:35,410 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 14:51:35,411 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 14:51:35,441 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 14:51:35,442 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 14:51:35,443 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 14:51:35,444 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 14:51:35,448 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 14:51:35,448 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 14:51:35,449 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 14:51:35,450 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 14:51:35,451 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 14:51:35,452 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 14:51:35,452 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 14:51:35,452 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 14:51:35,453 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 14:51:35,453 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 14:51:35,453 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 14:51:35,454 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 14:51:35,454 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 14:51:35,455 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 14:51:35,455 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 14:51:35,455 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 14:51:35,455 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 14:51:35,456 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 14:51:35,456 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 14:51:35,457 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 14:51:35,457 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 14:51:35,458 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 14:51:35,459 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 14:51:35,459 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:51:35,459 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 14:51:35,459 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 14:51:35,460 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 14:51:35,460 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 14:51:35,460 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 14:51:35,460 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 14:51:35,461 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 14:51:35,461 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 14:51:35,461 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 14:51:35,461 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 14:51:35,462 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-14 14:51:35,692 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 14:51:35,716 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 14:51:35,719 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 14:51:35,720 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 14:51:35,721 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 14:51:35,722 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix025_pso.opt_rmo.opt.yml/witness.yml
[2024-06-14 14:51:35,950 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 14:51:35,951 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 14:51:35,951 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i
[2024-06-14 14:51:37,098 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 14:51:37,424 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 14:51:37,425 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i
[2024-06-14 14:51:37,449 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380619bed/7dc1da4c07af4bff9da8536975fa01de/FLAG2c50a0e86
[2024-06-14 14:51:37,474 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380619bed/7dc1da4c07af4bff9da8536975fa01de
[2024-06-14 14:51:37,475 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 14:51:37,476 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 14:51:37,479 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 14:51:37,480 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 14:51:37,485 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 14:51:37,486 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:51:35" (1/2) ...
[2024-06-14 14:51:37,487 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc20929 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:51:37, skipping insertion in model container
[2024-06-14 14:51:37,487 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:51:35" (1/2) ...
[2024-06-14 14:51:37,489 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7229238f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:51:37, skipping insertion in model container
[2024-06-14 14:51:37,490 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:51:37" (2/2) ...
[2024-06-14 14:51:37,491 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc20929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:37, skipping insertion in model container
[2024-06-14 14:51:37,491 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:51:37" (2/2) ...
[2024-06-14 14:51:37,492 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 14:51:37,590 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 14:51:37,591 INFO  L97    edCorrectnessWitness]: Location invariant before [L837-L837] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-14 14:51:37,592 INFO  L97    edCorrectnessWitness]: Location invariant before [L840-L840] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-14 14:51:37,592 INFO  L97    edCorrectnessWitness]: Location invariant before [L839-L839] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-14 14:51:37,593 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 14:51:37,594 INFO  L106   edCorrectnessWitness]: ghost_update [L835-L835] multithreaded = 1;
[2024-06-14 14:51:37,639 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 14:51:37,990 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:51:38,001 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 14:51:38,240 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:51:38,285 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 14:51:38,286 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38 WrapperNode
[2024-06-14 14:51:38,286 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 14:51:38,287 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 14:51:38,287 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 14:51:38,288 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 14:51:38,293 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (1/1) ...
[2024-06-14 14:51:38,323 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (1/1) ...
[2024-06-14 14:51:38,429 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126
[2024-06-14 14:51:38,430 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 14:51:38,431 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 14:51:38,431 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 14:51:38,431 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 14:51:38,440 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (1/1) ...
[2024-06-14 14:51:38,440 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (1/1) ...
[2024-06-14 14:51:38,545 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (1/1) ...
[2024-06-14 14:51:38,605 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-14 14:51:38,606 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (1/1) ...
[2024-06-14 14:51:38,606 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (1/1) ...
[2024-06-14 14:51:38,671 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (1/1) ...
[2024-06-14 14:51:38,673 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (1/1) ...
[2024-06-14 14:51:38,680 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (1/1) ...
[2024-06-14 14:51:38,700 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (1/1) ...
[2024-06-14 14:51:38,709 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 14:51:38,710 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 14:51:38,716 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 14:51:38,716 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 14:51:38,717 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (1/1) ...
[2024-06-14 14:51:38,723 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:51:38,729 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 14:51:38,781 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-14 14:51:38,821 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-14 14:51:38,833 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 14:51:38,834 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 14:51:38,834 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 14:51:38,834 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 14:51:38,834 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 14:51:38,834 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 14:51:38,834 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 14:51:38,835 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 14:51:38,835 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 14:51:38,835 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 14:51:38,835 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 14:51:38,835 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 14:51:38,836 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 14:51:38,948 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 14:51:38,951 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 14:51:39,967 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 14:51:39,969 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 14:51:40,263 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 14:51:40,264 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 14:51:40,264 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:51:40 BoogieIcfgContainer
[2024-06-14 14:51:40,264 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 14:51:40,267 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 14:51:40,268 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 14:51:40,271 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 14:51:40,271 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:51:35" (1/4) ...
[2024-06-14 14:51:40,272 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131d29b5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:51:40, skipping insertion in model container
[2024-06-14 14:51:40,272 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:51:37" (2/4) ...
[2024-06-14 14:51:40,272 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131d29b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:51:40, skipping insertion in model container
[2024-06-14 14:51:40,273 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:38" (3/4) ...
[2024-06-14 14:51:40,273 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131d29b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:51:40, skipping insertion in model container
[2024-06-14 14:51:40,273 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:51:40" (4/4) ...
[2024-06-14 14:51:40,274 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i
[2024-06-14 14:51:40,290 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 14:51:40,290 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 14:51:40,291 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 14:51:40,393 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 14:51:40,421 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-14 14:51:40,469 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-14 14:51:40,470 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:51:40,471 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 14:51:40,472 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-14 14:51:40,475 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-14 14:51:40,487 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 14:51:40,495 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;@79544b5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 14:51:40,496 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 14:51:40,505 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 14:51:40,506 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 14:51:40,506 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:51:40,506 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:40,507 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:40,507 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:51:40,512 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:40,512 INFO  L85        PathProgramCache]: Analyzing trace with hash -1649445791, now seen corresponding path program 1 times
[2024-06-14 14:51:40,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:40,522 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291708056]
[2024-06-14 14:51:40,523 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:40,523 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:40,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:45,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:51:45,348 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:45,348 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291708056]
[2024-06-14 14:51:45,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291708056] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:45,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:45,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 14:51:45,351 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635698021]
[2024-06-14 14:51:45,351 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:45,357 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 14:51:45,360 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:45,385 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 14:51:45,385 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 14:51:45,451 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-14 14:51:45,453 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:45,453 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:45,453 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-14 14:51:45,454 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:46,271 INFO  L124   PetriNetUnfolderBase]: 1152/1853 cut-off events.
[2024-06-14 14:51:46,271 INFO  L125   PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES.
[2024-06-14 14:51:46,278 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3672 conditions, 1853 events. 1152/1853 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9218 event pairs, 785 based on Foata normal form. 1/1779 useless extension candidates. Maximal degree in co-relation 3657. Up to 1732 conditions per place. 
[2024-06-14 14:51:46,290 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-14 14:51:46,290 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 175 flow
[2024-06-14 14:51:46,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 14:51:46,294 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 14:51:46,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions.
[2024-06-14 14:51:46,300 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6031746031746031
[2024-06-14 14:51:46,302 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 76 transitions.
[2024-06-14 14:51:46,302 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 175 flow
[2024-06-14 14:51:46,304 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 14:51:46,306 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-14 14:51:46,307 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-14 14:51:46,309 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-14 14:51:46,309 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-14 14:51:46,310 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:46,310 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:46,310 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:46,310 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 14:51:46,310 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:51:46,311 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:46,311 INFO  L85        PathProgramCache]: Analyzing trace with hash -274434560, now seen corresponding path program 1 times
[2024-06-14 14:51:46,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:46,311 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010647659]
[2024-06-14 14:51:46,311 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:46,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:46,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:50,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:51:50,288 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:50,288 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010647659]
[2024-06-14 14:51:50,288 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010647659] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:50,288 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:50,288 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 14:51:50,288 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577923465]
[2024-06-14 14:51:50,289 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:50,290 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 14:51:50,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:50,290 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 14:51:50,290 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-14 14:51:50,374 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 14:51:50,374 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:50,375 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:50,375 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 14:51:50,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:51,106 INFO  L124   PetriNetUnfolderBase]: 1353/2091 cut-off events.
[2024-06-14 14:51:51,106 INFO  L125   PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES.
[2024-06-14 14:51:51,109 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 2091 events. 1353/2091 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10097 event pairs, 795 based on Foata normal form. 3/2083 useless extension candidates. Maximal degree in co-relation 4734. Up to 2005 conditions per place. 
[2024-06-14 14:51:51,115 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 41 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-14 14:51:51,115 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 244 flow
[2024-06-14 14:51:51,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 14:51:51,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 14:51:51,116 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions.
[2024-06-14 14:51:51,116 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5654761904761905
[2024-06-14 14:51:51,117 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 95 transitions.
[2024-06-14 14:51:51,117 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 244 flow
[2024-06-14 14:51:51,118 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 14:51:51,118 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-14 14:51:51,119 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-14 14:51:51,119 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-14 14:51:51,119 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-14 14:51:51,120 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:51,120 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:51,120 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:51,120 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 14:51:51,120 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:51:51,121 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:51,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 82464492, now seen corresponding path program 1 times
[2024-06-14 14:51:51,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:51,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230036162]
[2024-06-14 14:51:51,121 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:51,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:51,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:55,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:51:55,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:55,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230036162]
[2024-06-14 14:51:55,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230036162] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:55,484 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:55,484 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 14:51:55,484 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445580763]
[2024-06-14 14:51:55,484 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:55,484 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 14:51:55,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:55,485 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 14:51:55,485 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-14 14:51:55,600 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 14:51:55,600 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:55,600 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:55,600 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 14:51:55,600 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:56,452 INFO  L124   PetriNetUnfolderBase]: 1347/2082 cut-off events.
[2024-06-14 14:51:56,453 INFO  L125   PetriNetUnfolderBase]: For 1108/1108 co-relation queries the response was YES.
[2024-06-14 14:51:56,458 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5265 conditions, 2082 events. 1347/2082 cut-off events. For 1108/1108 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10008 event pairs, 649 based on Foata normal form. 3/2074 useless extension candidates. Maximal degree in co-relation 5248. Up to 1981 conditions per place. 
[2024-06-14 14:51:56,470 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 10 changer transitions 0/63 dead transitions.
[2024-06-14 14:51:56,471 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 322 flow
[2024-06-14 14:51:56,471 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:51:56,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:51:56,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions.
[2024-06-14 14:51:56,478 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5523809523809524
[2024-06-14 14:51:56,478 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 116 transitions.
[2024-06-14 14:51:56,478 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 322 flow
[2024-06-14 14:51:56,482 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 308 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-14 14:51:56,484 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 174 flow
[2024-06-14 14:51:56,485 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-14 14:51:56,486 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places.
[2024-06-14 14:51:56,486 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 174 flow
[2024-06-14 14:51:56,486 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:56,487 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:56,487 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:56,487 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 14:51:56,487 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:51:56,488 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:56,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 1939006827, now seen corresponding path program 1 times
[2024-06-14 14:51:56,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:56,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216593632]
[2024-06-14 14:51:56,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:56,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:56,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:00,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:00,926 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:00,928 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216593632]
[2024-06-14 14:52:00,929 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216593632] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:00,929 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:00,929 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:52:00,929 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765219940]
[2024-06-14 14:52:00,930 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:00,930 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:52:00,930 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:00,931 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:52:00,931 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:52:01,053 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 14:52:01,054 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 174 flow. Second operand  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:01,054 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:01,054 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 14:52:01,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:01,932 INFO  L124   PetriNetUnfolderBase]: 1338/2067 cut-off events.
[2024-06-14 14:52:01,932 INFO  L125   PetriNetUnfolderBase]: For 2049/2049 co-relation queries the response was YES.
[2024-06-14 14:52:01,935 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5732 conditions, 2067 events. 1338/2067 cut-off events. For 2049/2049 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9953 event pairs, 485 based on Foata normal form. 6/2062 useless extension candidates. Maximal degree in co-relation 5714. Up to 1936 conditions per place. 
[2024-06-14 14:52:01,943 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 52 selfloop transitions, 12 changer transitions 0/69 dead transitions.
[2024-06-14 14:52:01,943 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 376 flow
[2024-06-14 14:52:01,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:52:01,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:52:01,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions.
[2024-06-14 14:52:01,945 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5277777777777778
[2024-06-14 14:52:01,946 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 174 flow. Second operand 6 states and 133 transitions.
[2024-06-14 14:52:01,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 376 flow
[2024-06-14 14:52:01,949 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 352 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 14:52:01,950 INFO  L231             Difference]: Finished difference. Result has 51 places, 43 transitions, 193 flow
[2024-06-14 14:52:01,951 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=51, PETRI_TRANSITIONS=43}
[2024-06-14 14:52:01,952 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-14 14:52:01,952 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 193 flow
[2024-06-14 14:52:01,952 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:01,952 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:01,952 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:01,953 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 14:52:01,953 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:01,953 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:01,953 INFO  L85        PathProgramCache]: Analyzing trace with hash 1183660943, now seen corresponding path program 1 times
[2024-06-14 14:52:01,953 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:01,954 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197081287]
[2024-06-14 14:52:01,954 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:01,954 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:02,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:07,736 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:07,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:07,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197081287]
[2024-06-14 14:52:07,737 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197081287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:07,737 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:07,737 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:52:07,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786970503]
[2024-06-14 14:52:07,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:07,738 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:52:07,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:07,738 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:52:07,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:52:07,877 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 14:52:07,877 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 193 flow. Second operand  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:07,877 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:07,877 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 14:52:07,877 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:08,632 INFO  L124   PetriNetUnfolderBase]: 1126/1833 cut-off events.
[2024-06-14 14:52:08,632 INFO  L125   PetriNetUnfolderBase]: For 2644/2644 co-relation queries the response was YES.
[2024-06-14 14:52:08,636 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5319 conditions, 1833 events. 1126/1833 cut-off events. For 2644/2644 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9149 event pairs, 487 based on Foata normal form. 2/1804 useless extension candidates. Maximal degree in co-relation 5300. Up to 1683 conditions per place. 
[2024-06-14 14:52:08,656 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 43 selfloop transitions, 8 changer transitions 0/57 dead transitions.
[2024-06-14 14:52:08,656 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 339 flow
[2024-06-14 14:52:08,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:52:08,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:52:08,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions.
[2024-06-14 14:52:08,658 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-14 14:52:08,658 INFO  L175             Difference]: Start difference. First operand has 51 places, 43 transitions, 193 flow. Second operand 5 states and 100 transitions.
[2024-06-14 14:52:08,658 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 339 flow
[2024-06-14 14:52:08,659 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 306 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-14 14:52:08,660 INFO  L231             Difference]: Finished difference. Result has 52 places, 46 transitions, 206 flow
[2024-06-14 14:52:08,660 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=52, PETRI_TRANSITIONS=46}
[2024-06-14 14:52:08,661 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2024-06-14 14:52:08,663 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 206 flow
[2024-06-14 14:52:08,663 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:08,667 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:08,667 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:08,667 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 14:52:08,667 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:08,668 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:08,668 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961215675, now seen corresponding path program 1 times
[2024-06-14 14:52:08,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:08,668 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192529128]
[2024-06-14 14:52:08,668 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:08,668 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:08,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:15,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-14 14:52:15,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:15,495 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192529128]
[2024-06-14 14:52:15,495 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192529128] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:15,495 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:15,495 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:52:15,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074674302]
[2024-06-14 14:52:15,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:15,495 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:52:15,496 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:15,496 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:52:15,496 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:52:15,617 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:52:15,617 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 206 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:15,617 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:15,617 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:52:15,617 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:16,417 INFO  L124   PetriNetUnfolderBase]: 1335/2074 cut-off events.
[2024-06-14 14:52:16,418 INFO  L125   PetriNetUnfolderBase]: For 4293/4293 co-relation queries the response was YES.
[2024-06-14 14:52:16,420 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6520 conditions, 2074 events. 1335/2074 cut-off events. For 4293/4293 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10010 event pairs, 569 based on Foata normal form. 3/2076 useless extension candidates. Maximal degree in co-relation 6499. Up to 1955 conditions per place. 
[2024-06-14 14:52:16,427 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 52 selfloop transitions, 17 changer transitions 0/74 dead transitions.
[2024-06-14 14:52:16,427 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 460 flow
[2024-06-14 14:52:16,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:52:16,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:52:16,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions.
[2024-06-14 14:52:16,428 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4722222222222222
[2024-06-14 14:52:16,429 INFO  L175             Difference]: Start difference. First operand has 52 places, 46 transitions, 206 flow. Second operand 6 states and 119 transitions.
[2024-06-14 14:52:16,429 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 460 flow
[2024-06-14 14:52:16,431 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 438 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-14 14:52:16,433 INFO  L231             Difference]: Finished difference. Result has 57 places, 57 transitions, 309 flow
[2024-06-14 14:52:16,433 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=57, PETRI_TRANSITIONS=57}
[2024-06-14 14:52:16,435 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-14 14:52:16,436 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 309 flow
[2024-06-14 14:52:16,436 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:16,436 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:16,436 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:16,436 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 14:52:16,436 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:16,437 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:16,437 INFO  L85        PathProgramCache]: Analyzing trace with hash 382516018, now seen corresponding path program 1 times
[2024-06-14 14:52:16,437 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:16,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171362936]
[2024-06-14 14:52:16,441 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:16,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:16,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:22,922 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:22,922 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:22,922 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171362936]
[2024-06-14 14:52:22,922 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171362936] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:22,922 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:22,922 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:52:22,922 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135987479]
[2024-06-14 14:52:22,922 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:22,923 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:52:22,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:22,923 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:52:22,923 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:52:23,054 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:52:23,055 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 309 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:23,055 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:23,055 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:52:23,055 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:23,929 INFO  L124   PetriNetUnfolderBase]: 1409/2192 cut-off events.
[2024-06-14 14:52:23,929 INFO  L125   PetriNetUnfolderBase]: For 6798/6808 co-relation queries the response was YES.
[2024-06-14 14:52:23,932 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7727 conditions, 2192 events. 1409/2192 cut-off events. For 6798/6808 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10587 event pairs, 568 based on Foata normal form. 4/2184 useless extension candidates. Maximal degree in co-relation 7703. Up to 2047 conditions per place. 
[2024-06-14 14:52:23,939 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 60 selfloop transitions, 11 changer transitions 0/79 dead transitions.
[2024-06-14 14:52:23,939 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 525 flow
[2024-06-14 14:52:23,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:52:23,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:52:23,940 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-14 14:52:23,941 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-14 14:52:23,941 INFO  L175             Difference]: Start difference. First operand has 57 places, 57 transitions, 309 flow. Second operand 6 states and 117 transitions.
[2024-06-14 14:52:23,941 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 525 flow
[2024-06-14 14:52:23,943 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 509 flow, removed 7 selfloop flow, removed 1 redundant places.
[2024-06-14 14:52:23,944 INFO  L231             Difference]: Finished difference. Result has 62 places, 60 transitions, 353 flow
[2024-06-14 14:52:23,944 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=62, PETRI_TRANSITIONS=60}
[2024-06-14 14:52:23,945 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places.
[2024-06-14 14:52:23,945 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 353 flow
[2024-06-14 14:52:23,945 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:23,945 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:23,946 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:23,946 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 14:52:23,946 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:23,946 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:23,946 INFO  L85        PathProgramCache]: Analyzing trace with hash -668150930, now seen corresponding path program 2 times
[2024-06-14 14:52:23,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:23,946 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878476604]
[2024-06-14 14:52:23,947 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:23,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:23,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:30,631 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:30,632 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:30,632 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878476604]
[2024-06-14 14:52:30,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878476604] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:30,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:30,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:52:30,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756733479]
[2024-06-14 14:52:30,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:30,637 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:52:30,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:30,638 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:52:30,638 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:52:30,753 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:52:30,753 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 353 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:30,754 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:30,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:52:30,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:31,593 INFO  L124   PetriNetUnfolderBase]: 1415/2208 cut-off events.
[2024-06-14 14:52:31,594 INFO  L125   PetriNetUnfolderBase]: For 8844/8864 co-relation queries the response was YES.
[2024-06-14 14:52:31,597 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8305 conditions, 2208 events. 1415/2208 cut-off events. For 8844/8864 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10757 event pairs, 575 based on Foata normal form. 12/2208 useless extension candidates. Maximal degree in co-relation 8278. Up to 2029 conditions per place. 
[2024-06-14 14:52:31,610 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 56 selfloop transitions, 16 changer transitions 0/80 dead transitions.
[2024-06-14 14:52:31,610 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 573 flow
[2024-06-14 14:52:31,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:52:31,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:52:31,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-14 14:52:31,614 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-14 14:52:31,614 INFO  L175             Difference]: Start difference. First operand has 62 places, 60 transitions, 353 flow. Second operand 6 states and 117 transitions.
[2024-06-14 14:52:31,616 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 573 flow
[2024-06-14 14:52:31,620 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 80 transitions, 539 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-14 14:52:31,623 INFO  L231             Difference]: Finished difference. Result has 64 places, 63 transitions, 395 flow
[2024-06-14 14:52:31,623 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=64, PETRI_TRANSITIONS=63}
[2024-06-14 14:52:31,626 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places.
[2024-06-14 14:52:31,626 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 395 flow
[2024-06-14 14:52:31,626 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:31,626 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:31,626 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:31,626 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 14:52:31,627 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:31,627 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:31,627 INFO  L85        PathProgramCache]: Analyzing trace with hash -668142994, now seen corresponding path program 1 times
[2024-06-14 14:52:31,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:31,628 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518466221]
[2024-06-14 14:52:31,628 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:31,628 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:31,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:38,396 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:38,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:38,397 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518466221]
[2024-06-14 14:52:38,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518466221] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:38,397 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:38,397 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:52:38,397 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641773649]
[2024-06-14 14:52:38,397 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:38,398 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:52:38,399 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:38,399 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:52:38,400 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:52:38,578 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:52:38,579 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 395 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:38,579 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:38,579 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:52:38,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:39,539 INFO  L124   PetriNetUnfolderBase]: 1365/2149 cut-off events.
[2024-06-14 14:52:39,540 INFO  L125   PetriNetUnfolderBase]: For 10500/10500 co-relation queries the response was YES.
[2024-06-14 14:52:39,543 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8537 conditions, 2149 events. 1365/2149 cut-off events. For 10500/10500 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10449 event pairs, 533 based on Foata normal form. 3/2151 useless extension candidates. Maximal degree in co-relation 8509. Up to 1986 conditions per place. 
[2024-06-14 14:52:39,549 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 62 selfloop transitions, 21 changer transitions 0/88 dead transitions.
[2024-06-14 14:52:39,549 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 677 flow
[2024-06-14 14:52:39,549 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:52:39,549 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:52:39,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-14 14:52:39,550 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-14 14:52:39,550 INFO  L175             Difference]: Start difference. First operand has 64 places, 63 transitions, 395 flow. Second operand 7 states and 137 transitions.
[2024-06-14 14:52:39,550 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 677 flow
[2024-06-14 14:52:39,554 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 88 transitions, 627 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-14 14:52:39,555 INFO  L231             Difference]: Finished difference. Result has 67 places, 67 transitions, 436 flow
[2024-06-14 14:52:39,555 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=436, PETRI_PLACES=67, PETRI_TRANSITIONS=67}
[2024-06-14 14:52:39,555 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places.
[2024-06-14 14:52:39,555 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 436 flow
[2024-06-14 14:52:39,556 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:39,556 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:39,556 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:39,556 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 14:52:39,556 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:39,556 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:39,556 INFO  L85        PathProgramCache]: Analyzing trace with hash 1447349136, now seen corresponding path program 1 times
[2024-06-14 14:52:39,557 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:39,557 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419875168]
[2024-06-14 14:52:39,557 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:39,557 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:39,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:47,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:47,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:47,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419875168]
[2024-06-14 14:52:47,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419875168] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:47,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:47,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:52:47,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630898249]
[2024-06-14 14:52:47,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:47,014 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:52:47,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:47,014 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:52:47,016 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:52:47,212 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:52:47,212 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 436 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:47,212 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:47,212 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:52:47,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:48,151 INFO  L124   PetriNetUnfolderBase]: 1445/2234 cut-off events.
[2024-06-14 14:52:48,151 INFO  L125   PetriNetUnfolderBase]: For 14284/14303 co-relation queries the response was YES.
[2024-06-14 14:52:48,155 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9548 conditions, 2234 events. 1445/2234 cut-off events. For 14284/14303 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10711 event pairs, 571 based on Foata normal form. 3/2230 useless extension candidates. Maximal degree in co-relation 9519. Up to 2071 conditions per place. 
[2024-06-14 14:52:48,163 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 72 selfloop transitions, 14 changer transitions 0/95 dead transitions.
[2024-06-14 14:52:48,163 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 95 transitions, 710 flow
[2024-06-14 14:52:48,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:52:48,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:52:48,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-14 14:52:48,165 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46258503401360546
[2024-06-14 14:52:48,165 INFO  L175             Difference]: Start difference. First operand has 67 places, 67 transitions, 436 flow. Second operand 7 states and 136 transitions.
[2024-06-14 14:52:48,165 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 95 transitions, 710 flow
[2024-06-14 14:52:48,170 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 95 transitions, 649 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-14 14:52:48,172 INFO  L231             Difference]: Finished difference. Result has 69 places, 70 transitions, 455 flow
[2024-06-14 14:52:48,172 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=69, PETRI_TRANSITIONS=70}
[2024-06-14 14:52:48,172 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-14 14:52:48,173 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 455 flow
[2024-06-14 14:52:48,173 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:48,173 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:48,173 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:48,173 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 14:52:48,173 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:48,174 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:48,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 1447469292, now seen corresponding path program 1 times
[2024-06-14 14:52:48,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:48,174 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517414824]
[2024-06-14 14:52:48,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:48,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:48,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:55,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:55,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:55,149 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517414824]
[2024-06-14 14:52:55,149 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517414824] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:55,149 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:55,149 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:52:55,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852035458]
[2024-06-14 14:52:55,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:55,150 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:52:55,150 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:55,152 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:52:55,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:52:55,285 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:52:55,286 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 455 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:55,288 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:55,288 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:52:55,288 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:56,280 INFO  L124   PetriNetUnfolderBase]: 1635/2455 cut-off events.
[2024-06-14 14:52:56,280 INFO  L125   PetriNetUnfolderBase]: For 17732/17732 co-relation queries the response was YES.
[2024-06-14 14:52:56,286 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10986 conditions, 2455 events. 1635/2455 cut-off events. For 17732/17732 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11512 event pairs, 592 based on Foata normal form. 6/2460 useless extension candidates. Maximal degree in co-relation 10956. Up to 2319 conditions per place. 
[2024-06-14 14:52:56,295 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 82 selfloop transitions, 22 changer transitions 0/108 dead transitions.
[2024-06-14 14:52:56,296 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 889 flow
[2024-06-14 14:52:56,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:52:56,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:52:56,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-14 14:52:56,297 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-14 14:52:56,297 INFO  L175             Difference]: Start difference. First operand has 69 places, 70 transitions, 455 flow. Second operand 7 states and 137 transitions.
[2024-06-14 14:52:56,297 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 889 flow
[2024-06-14 14:52:56,303 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 833 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-14 14:52:56,305 INFO  L231             Difference]: Finished difference. Result has 73 places, 81 transitions, 579 flow
[2024-06-14 14:52:56,305 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=579, PETRI_PLACES=73, PETRI_TRANSITIONS=81}
[2024-06-14 14:52:56,305 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places.
[2024-06-14 14:52:56,306 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 579 flow
[2024-06-14 14:52:56,306 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:56,306 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:56,306 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:56,306 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 14:52:56,306 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:56,307 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:56,307 INFO  L85        PathProgramCache]: Analyzing trace with hash 1624600812, now seen corresponding path program 2 times
[2024-06-14 14:52:56,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:56,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993538574]
[2024-06-14 14:52:56,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:56,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:56,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:03,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:03,551 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:03,551 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993538574]
[2024-06-14 14:53:03,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993538574] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:03,551 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:03,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:53:03,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945276171]
[2024-06-14 14:53:03,552 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:03,552 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:53:03,553 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:03,553 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:53:03,554 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:53:03,690 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:53:03,691 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 579 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:03,691 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:03,692 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:53:03,692 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:04,781 INFO  L124   PetriNetUnfolderBase]: 1703/2559 cut-off events.
[2024-06-14 14:53:04,781 INFO  L125   PetriNetUnfolderBase]: For 23525/23535 co-relation queries the response was YES.
[2024-06-14 14:53:04,786 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12618 conditions, 2559 events. 1703/2559 cut-off events. For 23525/23535 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12060 event pairs, 609 based on Foata normal form. 16/2574 useless extension candidates. Maximal degree in co-relation 12585. Up to 2270 conditions per place. 
[2024-06-14 14:53:04,796 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 78 selfloop transitions, 34 changer transitions 0/116 dead transitions.
[2024-06-14 14:53:04,796 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 116 transitions, 1079 flow
[2024-06-14 14:53:04,797 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:53:04,797 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:53:04,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions.
[2024-06-14 14:53:04,798 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47278911564625853
[2024-06-14 14:53:04,798 INFO  L175             Difference]: Start difference. First operand has 73 places, 81 transitions, 579 flow. Second operand 7 states and 139 transitions.
[2024-06-14 14:53:04,798 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 116 transitions, 1079 flow
[2024-06-14 14:53:04,808 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 116 transitions, 1029 flow, removed 21 selfloop flow, removed 2 redundant places.
[2024-06-14 14:53:04,810 INFO  L231             Difference]: Finished difference. Result has 79 places, 89 transitions, 717 flow
[2024-06-14 14:53:04,811 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=717, PETRI_PLACES=79, PETRI_TRANSITIONS=89}
[2024-06-14 14:53:04,811 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places.
[2024-06-14 14:53:04,811 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 89 transitions, 717 flow
[2024-06-14 14:53:04,811 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:04,812 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:04,812 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:04,812 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 14:53:04,812 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:53:04,812 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:04,812 INFO  L85        PathProgramCache]: Analyzing trace with hash 1624837962, now seen corresponding path program 3 times
[2024-06-14 14:53:04,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:04,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921429063]
[2024-06-14 14:53:04,813 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:04,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:04,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:12,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:12,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:12,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921429063]
[2024-06-14 14:53:12,118 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921429063] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:12,118 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:12,118 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:53:12,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209659898]
[2024-06-14 14:53:12,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:12,118 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:53:12,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:12,119 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:53:12,119 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:53:12,274 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:53:12,274 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 89 transitions, 717 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:12,274 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:12,275 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:53:12,275 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:13,179 INFO  L124   PetriNetUnfolderBase]: 1707/2566 cut-off events.
[2024-06-14 14:53:13,180 INFO  L125   PetriNetUnfolderBase]: For 28096/28106 co-relation queries the response was YES.
[2024-06-14 14:53:13,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13516 conditions, 2566 events. 1707/2566 cut-off events. For 28096/28106 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12096 event pairs, 599 based on Foata normal form. 16/2581 useless extension candidates. Maximal degree in co-relation 13480. Up to 2279 conditions per place. 
[2024-06-14 14:53:13,196 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 71 selfloop transitions, 42 changer transitions 0/117 dead transitions.
[2024-06-14 14:53:13,196 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 117 transitions, 1122 flow
[2024-06-14 14:53:13,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:53:13,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:53:13,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-14 14:53:13,198 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-14 14:53:13,198 INFO  L175             Difference]: Start difference. First operand has 79 places, 89 transitions, 717 flow. Second operand 7 states and 137 transitions.
[2024-06-14 14:53:13,198 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 117 transitions, 1122 flow
[2024-06-14 14:53:13,213 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 117 transitions, 1009 flow, removed 35 selfloop flow, removed 4 redundant places.
[2024-06-14 14:53:13,214 INFO  L231             Difference]: Finished difference. Result has 82 places, 93 transitions, 760 flow
[2024-06-14 14:53:13,215 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=760, PETRI_PLACES=82, PETRI_TRANSITIONS=93}
[2024-06-14 14:53:13,216 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places.
[2024-06-14 14:53:13,216 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 93 transitions, 760 flow
[2024-06-14 14:53:13,216 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:13,216 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:13,217 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:13,217 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 14:53:13,217 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:53:13,217 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:13,217 INFO  L85        PathProgramCache]: Analyzing trace with hash 762404484, now seen corresponding path program 1 times
[2024-06-14 14:53:13,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:13,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271351334]
[2024-06-14 14:53:13,218 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:13,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:13,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:20,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:20,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:20,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271351334]
[2024-06-14 14:53:20,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271351334] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:20,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:20,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:20,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116026009]
[2024-06-14 14:53:20,322 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:20,322 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:20,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:20,323 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:20,323 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:20,472 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:53:20,474 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 93 transitions, 760 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:20,474 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:20,474 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:53:20,474 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:21,484 INFO  L124   PetriNetUnfolderBase]: 1503/2359 cut-off events.
[2024-06-14 14:53:21,484 INFO  L125   PetriNetUnfolderBase]: For 25399/25399 co-relation queries the response was YES.
[2024-06-14 14:53:21,490 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12067 conditions, 2359 events. 1503/2359 cut-off events. For 25399/25399 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11551 event pairs, 506 based on Foata normal form. 6/2364 useless extension candidates. Maximal degree in co-relation 12030. Up to 2157 conditions per place. 
[2024-06-14 14:53:21,498 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 93 selfloop transitions, 24 changer transitions 0/122 dead transitions.
[2024-06-14 14:53:21,498 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 122 transitions, 1156 flow
[2024-06-14 14:53:21,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:53:21,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:53:21,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-14 14:53:21,521 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-14 14:53:21,521 INFO  L175             Difference]: Start difference. First operand has 82 places, 93 transitions, 760 flow. Second operand 8 states and 155 transitions.
[2024-06-14 14:53:21,521 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 122 transitions, 1156 flow
[2024-06-14 14:53:21,532 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 122 transitions, 1069 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-14 14:53:21,534 INFO  L231             Difference]: Finished difference. Result has 86 places, 96 transitions, 781 flow
[2024-06-14 14:53:21,534 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=781, PETRI_PLACES=86, PETRI_TRANSITIONS=96}
[2024-06-14 14:53:21,535 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places.
[2024-06-14 14:53:21,535 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 96 transitions, 781 flow
[2024-06-14 14:53:21,535 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:21,535 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:21,535 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:21,535 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 14:53:21,535 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:53:21,552 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:21,552 INFO  L85        PathProgramCache]: Analyzing trace with hash 1354377716, now seen corresponding path program 1 times
[2024-06-14 14:53:21,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:21,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763473662]
[2024-06-14 14:53:21,553 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:21,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:21,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:28,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:28,747 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:28,747 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763473662]
[2024-06-14 14:53:28,747 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763473662] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:28,747 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:28,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:53:28,748 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573299693]
[2024-06-14 14:53:28,748 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:28,748 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:53:28,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:28,748 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:53:28,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:53:28,825 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:53:28,825 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 96 transitions, 781 flow. Second operand  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:28,825 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:28,825 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:53:28,825 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:29,665 INFO  L124   PetriNetUnfolderBase]: 1500/2354 cut-off events.
[2024-06-14 14:53:29,666 INFO  L125   PetriNetUnfolderBase]: For 27386/27386 co-relation queries the response was YES.
[2024-06-14 14:53:29,670 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12258 conditions, 2354 events. 1500/2354 cut-off events. For 27386/27386 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11541 event pairs, 525 based on Foata normal form. 1/2354 useless extension candidates. Maximal degree in co-relation 12220. Up to 2226 conditions per place. 
[2024-06-14 14:53:29,678 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 90 selfloop transitions, 10 changer transitions 0/105 dead transitions.
[2024-06-14 14:53:29,678 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 105 transitions, 1014 flow
[2024-06-14 14:53:29,678 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:53:29,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:53:29,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-14 14:53:29,679 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4087301587301587
[2024-06-14 14:53:29,679 INFO  L175             Difference]: Start difference. First operand has 86 places, 96 transitions, 781 flow. Second operand 6 states and 103 transitions.
[2024-06-14 14:53:29,679 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 105 transitions, 1014 flow
[2024-06-14 14:53:29,691 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 105 transitions, 920 flow, removed 24 selfloop flow, removed 6 redundant places.
[2024-06-14 14:53:29,692 INFO  L231             Difference]: Finished difference. Result has 87 places, 98 transitions, 733 flow
[2024-06-14 14:53:29,692 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=733, PETRI_PLACES=87, PETRI_TRANSITIONS=98}
[2024-06-14 14:53:29,693 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places.
[2024-06-14 14:53:29,693 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 98 transitions, 733 flow
[2024-06-14 14:53:29,693 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:29,693 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:29,693 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:29,693 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 14:53:29,694 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:53:29,694 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:29,694 INFO  L85        PathProgramCache]: Analyzing trace with hash -1376433330, now seen corresponding path program 1 times
[2024-06-14 14:53:29,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:29,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805506165]
[2024-06-14 14:53:29,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:29,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:29,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:37,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:37,467 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:37,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805506165]
[2024-06-14 14:53:37,472 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805506165] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:37,472 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:37,472 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:37,472 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482818147]
[2024-06-14 14:53:37,472 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:37,473 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:37,474 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:37,475 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:37,475 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:37,615 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:53:37,615 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 98 transitions, 733 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:37,615 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:37,615 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:53:37,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:38,862 INFO  L124   PetriNetUnfolderBase]: 1709/2568 cut-off events.
[2024-06-14 14:53:38,862 INFO  L125   PetriNetUnfolderBase]: For 34700/34700 co-relation queries the response was YES.
[2024-06-14 14:53:38,867 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13614 conditions, 2568 events. 1709/2568 cut-off events. For 34700/34700 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12072 event pairs, 591 based on Foata normal form. 3/2570 useless extension candidates. Maximal degree in co-relation 13574. Up to 2450 conditions per place. 
[2024-06-14 14:53:38,874 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 108 selfloop transitions, 28 changer transitions 0/140 dead transitions.
[2024-06-14 14:53:38,874 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 140 transitions, 1315 flow
[2024-06-14 14:53:38,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:53:38,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:53:38,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-14 14:53:38,876 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-14 14:53:38,876 INFO  L175             Difference]: Start difference. First operand has 87 places, 98 transitions, 733 flow. Second operand 8 states and 155 transitions.
[2024-06-14 14:53:38,876 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 140 transitions, 1315 flow
[2024-06-14 14:53:38,887 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 140 transitions, 1290 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-14 14:53:38,894 INFO  L231             Difference]: Finished difference. Result has 93 places, 109 transitions, 940 flow
[2024-06-14 14:53:38,894 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=940, PETRI_PLACES=93, PETRI_TRANSITIONS=109}
[2024-06-14 14:53:38,894 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places.
[2024-06-14 14:53:38,895 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 109 transitions, 940 flow
[2024-06-14 14:53:38,895 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:38,895 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:38,899 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:38,900 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 14:53:38,900 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:53:38,900 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:38,900 INFO  L85        PathProgramCache]: Analyzing trace with hash 1921875879, now seen corresponding path program 1 times
[2024-06-14 14:53:38,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:38,901 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042648990]
[2024-06-14 14:53:38,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:38,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:38,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:46,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:46,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:46,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042648990]
[2024-06-14 14:53:46,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042648990] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:46,556 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:46,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:46,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264431791]
[2024-06-14 14:53:46,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:46,556 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:46,556 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:46,556 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:46,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:46,742 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:53:46,742 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 109 transitions, 940 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:46,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:46,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:53:46,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:47,890 INFO  L124   PetriNetUnfolderBase]: 1727/2603 cut-off events.
[2024-06-14 14:53:47,890 INFO  L125   PetriNetUnfolderBase]: For 41032/41032 co-relation queries the response was YES.
[2024-06-14 14:53:47,896 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14627 conditions, 2603 events. 1727/2603 cut-off events. For 41032/41032 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12344 event pairs, 557 based on Foata normal form. 3/2605 useless extension candidates. Maximal degree in co-relation 14585. Up to 2485 conditions per place. 
[2024-06-14 14:53:47,906 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 120 selfloop transitions, 26 changer transitions 0/150 dead transitions.
[2024-06-14 14:53:47,906 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 150 transitions, 1495 flow
[2024-06-14 14:53:47,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:53:47,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:53:47,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-14 14:53:47,907 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494047619047619
[2024-06-14 14:53:47,907 INFO  L175             Difference]: Start difference. First operand has 93 places, 109 transitions, 940 flow. Second operand 8 states and 151 transitions.
[2024-06-14 14:53:47,908 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 150 transitions, 1495 flow
[2024-06-14 14:53:47,926 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 150 transitions, 1402 flow, removed 38 selfloop flow, removed 3 redundant places.
[2024-06-14 14:53:47,927 INFO  L231             Difference]: Finished difference. Result has 100 places, 122 transitions, 1067 flow
[2024-06-14 14:53:47,927 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1067, PETRI_PLACES=100, PETRI_TRANSITIONS=122}
[2024-06-14 14:53:47,928 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places.
[2024-06-14 14:53:47,928 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 122 transitions, 1067 flow
[2024-06-14 14:53:47,928 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:47,928 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:47,928 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:47,928 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 14:53:47,929 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:53:47,929 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:47,929 INFO  L85        PathProgramCache]: Analyzing trace with hash -1169629943, now seen corresponding path program 2 times
[2024-06-14 14:53:47,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:47,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926244270]
[2024-06-14 14:53:47,929 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:47,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:47,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:54,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:54,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:54,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926244270]
[2024-06-14 14:53:54,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926244270] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:54,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:54,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:54,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125298439]
[2024-06-14 14:53:54,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:54,356 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:54,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:54,356 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:54,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:54,511 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:53:54,511 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 122 transitions, 1067 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:54,511 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:54,511 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:53:54,511 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:55,797 INFO  L124   PetriNetUnfolderBase]: 1763/2648 cut-off events.
[2024-06-14 14:53:55,797 INFO  L125   PetriNetUnfolderBase]: For 45954/45954 co-relation queries the response was YES.
[2024-06-14 14:53:55,804 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15586 conditions, 2648 events. 1763/2648 cut-off events. For 45954/45954 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12461 event pairs, 560 based on Foata normal form. 6/2652 useless extension candidates. Maximal degree in co-relation 15540. Up to 2283 conditions per place. 
[2024-06-14 14:53:55,813 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 84 selfloop transitions, 67 changer transitions 0/155 dead transitions.
[2024-06-14 14:53:55,813 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 155 transitions, 1601 flow
[2024-06-14 14:53:55,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:53:55,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:53:55,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-14 14:53:55,814 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-14 14:53:55,814 INFO  L175             Difference]: Start difference. First operand has 100 places, 122 transitions, 1067 flow. Second operand 8 states and 156 transitions.
[2024-06-14 14:53:55,814 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 155 transitions, 1601 flow
[2024-06-14 14:53:55,834 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 155 transitions, 1530 flow, removed 27 selfloop flow, removed 3 redundant places.
[2024-06-14 14:53:55,835 INFO  L231             Difference]: Finished difference. Result has 105 places, 127 transitions, 1226 flow
[2024-06-14 14:53:55,836 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1226, PETRI_PLACES=105, PETRI_TRANSITIONS=127}
[2024-06-14 14:53:55,836 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places.
[2024-06-14 14:53:55,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 127 transitions, 1226 flow
[2024-06-14 14:53:55,836 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:55,836 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:55,837 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:55,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 14:53:55,837 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:53:55,837 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:55,837 INFO  L85        PathProgramCache]: Analyzing trace with hash -2135273843, now seen corresponding path program 3 times
[2024-06-14 14:53:55,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:55,837 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497770974]
[2024-06-14 14:53:55,837 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:55,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:55,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:02,461 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:02,461 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:02,461 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497770974]
[2024-06-14 14:54:02,461 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497770974] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:02,461 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:02,461 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:02,461 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969809564]
[2024-06-14 14:54:02,461 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:02,461 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:02,462 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:02,462 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:02,462 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:02,634 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:54:02,635 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 127 transitions, 1226 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:02,635 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:02,635 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:54:02,635 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:03,763 INFO  L124   PetriNetUnfolderBase]: 1813/2725 cut-off events.
[2024-06-14 14:54:03,764 INFO  L125   PetriNetUnfolderBase]: For 52695/52703 co-relation queries the response was YES.
[2024-06-14 14:54:03,771 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17146 conditions, 2725 events. 1813/2725 cut-off events. For 52695/52703 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12944 event pairs, 538 based on Foata normal form. 6/2729 useless extension candidates. Maximal degree in co-relation 17098. Up to 2267 conditions per place. 
[2024-06-14 14:54:03,781 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 78 selfloop transitions, 83 changer transitions 0/165 dead transitions.
[2024-06-14 14:54:03,781 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 165 transitions, 1934 flow
[2024-06-14 14:54:03,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:54:03,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:54:03,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-14 14:54:03,783 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47023809523809523
[2024-06-14 14:54:03,783 INFO  L175             Difference]: Start difference. First operand has 105 places, 127 transitions, 1226 flow. Second operand 8 states and 158 transitions.
[2024-06-14 14:54:03,783 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 165 transitions, 1934 flow
[2024-06-14 14:54:03,807 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 165 transitions, 1738 flow, removed 34 selfloop flow, removed 6 redundant places.
[2024-06-14 14:54:03,809 INFO  L231             Difference]: Finished difference. Result has 108 places, 136 transitions, 1397 flow
[2024-06-14 14:54:03,810 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1397, PETRI_PLACES=108, PETRI_TRANSITIONS=136}
[2024-06-14 14:54:03,810 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places.
[2024-06-14 14:54:03,810 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 136 transitions, 1397 flow
[2024-06-14 14:54:03,810 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:03,811 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:03,811 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:03,811 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 14:54:03,811 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:54:03,811 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:03,811 INFO  L85        PathProgramCache]: Analyzing trace with hash -2142892403, now seen corresponding path program 4 times
[2024-06-14 14:54:03,812 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:03,812 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624412826]
[2024-06-14 14:54:03,812 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:03,812 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:03,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:10,254 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:10,255 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:10,255 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624412826]
[2024-06-14 14:54:10,255 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624412826] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:10,255 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:10,255 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:10,255 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842866351]
[2024-06-14 14:54:10,256 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:10,256 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:10,257 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:10,257 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:10,257 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:10,374 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:54:10,375 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 136 transitions, 1397 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:10,375 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:10,375 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:54:10,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:11,741 INFO  L124   PetriNetUnfolderBase]: 1825/2746 cut-off events.
[2024-06-14 14:54:11,741 INFO  L125   PetriNetUnfolderBase]: For 59122/59130 co-relation queries the response was YES.
[2024-06-14 14:54:11,748 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18183 conditions, 2746 events. 1825/2746 cut-off events. For 59122/59130 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13059 event pairs, 544 based on Foata normal form. 9/2753 useless extension candidates. Maximal degree in co-relation 18133. Up to 2372 conditions per place. 
[2024-06-14 14:54:11,758 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 108 selfloop transitions, 56 changer transitions 0/168 dead transitions.
[2024-06-14 14:54:11,758 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 168 transitions, 2021 flow
[2024-06-14 14:54:11,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:54:11,759 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:54:11,759 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-14 14:54:11,760 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-14 14:54:11,760 INFO  L175             Difference]: Start difference. First operand has 108 places, 136 transitions, 1397 flow. Second operand 8 states and 157 transitions.
[2024-06-14 14:54:11,760 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 168 transitions, 2021 flow
[2024-06-14 14:54:11,794 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 168 transitions, 1853 flow, removed 42 selfloop flow, removed 4 redundant places.
[2024-06-14 14:54:11,796 INFO  L231             Difference]: Finished difference. Result has 112 places, 140 transitions, 1447 flow
[2024-06-14 14:54:11,796 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1447, PETRI_PLACES=112, PETRI_TRANSITIONS=140}
[2024-06-14 14:54:11,797 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 69 predicate places.
[2024-06-14 14:54:11,797 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 140 transitions, 1447 flow
[2024-06-14 14:54:11,797 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:11,797 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:11,797 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:11,797 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 14:54:11,798 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:54:11,798 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:11,798 INFO  L85        PathProgramCache]: Analyzing trace with hash -963961832, now seen corresponding path program 1 times
[2024-06-14 14:54:11,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:11,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130888780]
[2024-06-14 14:54:11,799 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:11,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:11,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:23,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:23,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:23,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130888780]
[2024-06-14 14:54:23,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130888780] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:23,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:23,134 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:54:23,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326183643]
[2024-06-14 14:54:23,134 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:23,135 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:54:23,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:23,135 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:54:23,135 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:54:23,294 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:54:23,294 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 140 transitions, 1447 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:23,294 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:23,295 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:54:23,295 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:24,319 INFO  L124   PetriNetUnfolderBase]: 1612/2527 cut-off events.
[2024-06-14 14:54:24,319 INFO  L125   PetriNetUnfolderBase]: For 51862/51862 co-relation queries the response was YES.
[2024-06-14 14:54:24,325 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16672 conditions, 2527 events. 1612/2527 cut-off events. For 51862/51862 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12459 event pairs, 463 based on Foata normal form. 2/2528 useless extension candidates. Maximal degree in co-relation 16620. Up to 2382 conditions per place. 
[2024-06-14 14:54:24,334 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 135 selfloop transitions, 12 changer transitions 0/152 dead transitions.
[2024-06-14 14:54:24,334 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 152 transitions, 1793 flow
[2024-06-14 14:54:24,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:54:24,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:54:24,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-14 14:54:24,335 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4246031746031746
[2024-06-14 14:54:24,335 INFO  L175             Difference]: Start difference. First operand has 112 places, 140 transitions, 1447 flow. Second operand 6 states and 107 transitions.
[2024-06-14 14:54:24,335 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 152 transitions, 1793 flow
[2024-06-14 14:54:24,361 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 152 transitions, 1623 flow, removed 32 selfloop flow, removed 6 redundant places.
[2024-06-14 14:54:24,363 INFO  L231             Difference]: Finished difference. Result has 112 places, 143 transitions, 1343 flow
[2024-06-14 14:54:24,363 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1343, PETRI_PLACES=112, PETRI_TRANSITIONS=143}
[2024-06-14 14:54:24,363 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 69 predicate places.
[2024-06-14 14:54:24,364 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 143 transitions, 1343 flow
[2024-06-14 14:54:24,364 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:24,364 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:24,364 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:24,364 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 14:54:24,364 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:54:24,364 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:24,365 INFO  L85        PathProgramCache]: Analyzing trace with hash 868874853, now seen corresponding path program 1 times
[2024-06-14 14:54:24,365 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:24,365 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523992166]
[2024-06-14 14:54:24,365 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:24,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:24,410 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:32,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:32,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:32,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523992166]
[2024-06-14 14:54:32,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523992166] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:32,223 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:32,223 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:32,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913786307]
[2024-06-14 14:54:32,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:32,223 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:32,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:32,224 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:32,224 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:32,468 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:54:32,469 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 143 transitions, 1343 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:32,469 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:32,469 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:54:32,469 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:33,543 INFO  L124   PetriNetUnfolderBase]: 1752/2680 cut-off events.
[2024-06-14 14:54:33,544 INFO  L125   PetriNetUnfolderBase]: For 64114/64116 co-relation queries the response was YES.
[2024-06-14 14:54:33,552 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18134 conditions, 2680 events. 1752/2680 cut-off events. For 64114/64116 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13088 event pairs, 343 based on Foata normal form. 6/2685 useless extension candidates. Maximal degree in co-relation 18081. Up to 2393 conditions per place. 
[2024-06-14 14:54:33,564 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 133 selfloop transitions, 16 changer transitions 0/175 dead transitions.
[2024-06-14 14:54:33,564 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 175 transitions, 1777 flow
[2024-06-14 14:54:33,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:54:33,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:54:33,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-14 14:54:33,565 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-14 14:54:33,565 INFO  L175             Difference]: Start difference. First operand has 112 places, 143 transitions, 1343 flow. Second operand 8 states and 153 transitions.
[2024-06-14 14:54:33,565 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 175 transitions, 1777 flow
[2024-06-14 14:54:33,605 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 175 transitions, 1733 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-14 14:54:33,608 INFO  L231             Difference]: Finished difference. Result has 116 places, 145 transitions, 1398 flow
[2024-06-14 14:54:33,608 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1398, PETRI_PLACES=116, PETRI_TRANSITIONS=145}
[2024-06-14 14:54:33,608 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places.
[2024-06-14 14:54:33,609 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 145 transitions, 1398 flow
[2024-06-14 14:54:33,609 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:33,609 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:33,609 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:33,609 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 14:54:33,609 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:54:33,610 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:33,610 INFO  L85        PathProgramCache]: Analyzing trace with hash 871731813, now seen corresponding path program 2 times
[2024-06-14 14:54:33,610 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:33,610 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476267856]
[2024-06-14 14:54:33,610 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:33,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:33,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:41,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:41,101 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:41,101 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476267856]
[2024-06-14 14:54:41,101 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476267856] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:41,101 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:41,101 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:41,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565655491]
[2024-06-14 14:54:41,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:41,102 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:41,102 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:41,102 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:41,102 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:41,256 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:54:41,256 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 145 transitions, 1398 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:41,256 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:41,256 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:54:41,257 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:42,367 INFO  L124   PetriNetUnfolderBase]: 1769/2707 cut-off events.
[2024-06-14 14:54:42,367 INFO  L125   PetriNetUnfolderBase]: For 70276/70278 co-relation queries the response was YES.
[2024-06-14 14:54:42,375 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18688 conditions, 2707 events. 1769/2707 cut-off events. For 70276/70278 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13244 event pairs, 466 based on Foata normal form. 6/2712 useless extension candidates. Maximal degree in co-relation 18634. Up to 2446 conditions per place. 
[2024-06-14 14:54:42,386 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 133 selfloop transitions, 17 changer transitions 0/176 dead transitions.
[2024-06-14 14:54:42,387 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 176 transitions, 1836 flow
[2024-06-14 14:54:42,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:54:42,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:54:42,389 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-14 14:54:42,389 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-14 14:54:42,389 INFO  L175             Difference]: Start difference. First operand has 116 places, 145 transitions, 1398 flow. Second operand 8 states and 153 transitions.
[2024-06-14 14:54:42,390 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 176 transitions, 1836 flow
[2024-06-14 14:54:42,425 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 176 transitions, 1755 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-14 14:54:42,427 INFO  L231             Difference]: Finished difference. Result has 118 places, 147 transitions, 1422 flow
[2024-06-14 14:54:42,427 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1422, PETRI_PLACES=118, PETRI_TRANSITIONS=147}
[2024-06-14 14:54:42,428 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 75 predicate places.
[2024-06-14 14:54:42,428 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 147 transitions, 1422 flow
[2024-06-14 14:54:42,428 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:42,428 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:42,428 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:42,429 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 14:54:42,429 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:54:42,429 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:42,429 INFO  L85        PathProgramCache]: Analyzing trace with hash -556037465, now seen corresponding path program 1 times
[2024-06-14 14:54:42,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:42,429 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499616407]
[2024-06-14 14:54:42,429 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:42,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:42,488 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:52,217 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:52,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:52,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499616407]
[2024-06-14 14:54:52,218 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499616407] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:52,218 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:52,218 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:54:52,218 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256823975]
[2024-06-14 14:54:52,218 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:52,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:54:52,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:52,219 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:54:52,219 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:54:52,361 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:54:52,362 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 147 transitions, 1422 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:52,362 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:52,362 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:54:52,362 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:53,654 INFO  L124   PetriNetUnfolderBase]: 1868/2815 cut-off events.
[2024-06-14 14:54:53,655 INFO  L125   PetriNetUnfolderBase]: For 76757/76757 co-relation queries the response was YES.
[2024-06-14 14:54:53,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19618 conditions, 2815 events. 1868/2815 cut-off events. For 76757/76757 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13494 event pairs, 491 based on Foata normal form. 3/2817 useless extension candidates. Maximal degree in co-relation 19563. Up to 2672 conditions per place. 
[2024-06-14 14:54:53,674 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 150 selfloop transitions, 32 changer transitions 0/186 dead transitions.
[2024-06-14 14:54:53,674 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 186 transitions, 2102 flow
[2024-06-14 14:54:53,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:54:53,675 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:54:53,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-14 14:54:53,675 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-14 14:54:53,676 INFO  L175             Difference]: Start difference. First operand has 118 places, 147 transitions, 1422 flow. Second operand 9 states and 172 transitions.
[2024-06-14 14:54:53,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 186 transitions, 2102 flow
[2024-06-14 14:54:53,713 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 186 transitions, 2015 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-14 14:54:53,716 INFO  L231             Difference]: Finished difference. Result has 121 places, 151 transitions, 1502 flow
[2024-06-14 14:54:53,716 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1502, PETRI_PLACES=121, PETRI_TRANSITIONS=151}
[2024-06-14 14:54:53,716 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places.
[2024-06-14 14:54:53,716 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 151 transitions, 1502 flow
[2024-06-14 14:54:53,717 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:53,717 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:53,717 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:53,717 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 14:54:53,717 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:54:53,717 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:53,717 INFO  L85        PathProgramCache]: Analyzing trace with hash -551573775, now seen corresponding path program 3 times
[2024-06-14 14:54:53,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:53,718 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262273745]
[2024-06-14 14:54:53,718 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:53,718 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:53,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:01,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:01,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:01,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262273745]
[2024-06-14 14:55:01,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262273745] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:01,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:01,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:55:01,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369246000]
[2024-06-14 14:55:01,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:01,392 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:55:01,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:01,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:55:01,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:55:01,554 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:55:01,554 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 151 transitions, 1502 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:01,554 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:01,555 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:55:01,555 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:02,711 INFO  L124   PetriNetUnfolderBase]: 1804/2758 cut-off events.
[2024-06-14 14:55:02,711 INFO  L125   PetriNetUnfolderBase]: For 82114/82116 co-relation queries the response was YES.
[2024-06-14 14:55:02,720 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19528 conditions, 2758 events. 1804/2758 cut-off events. For 82114/82116 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13503 event pairs, 459 based on Foata normal form. 6/2763 useless extension candidates. Maximal degree in co-relation 19472. Up to 2502 conditions per place. 
[2024-06-14 14:55:02,732 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 137 selfloop transitions, 17 changer transitions 0/181 dead transitions.
[2024-06-14 14:55:02,732 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 181 transitions, 1955 flow
[2024-06-14 14:55:02,734 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:55:02,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:55:02,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 14:55:02,735 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-14 14:55:02,735 INFO  L175             Difference]: Start difference. First operand has 121 places, 151 transitions, 1502 flow. Second operand 8 states and 150 transitions.
[2024-06-14 14:55:02,735 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 181 transitions, 1955 flow
[2024-06-14 14:55:02,779 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 181 transitions, 1830 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-14 14:55:02,781 INFO  L231             Difference]: Finished difference. Result has 123 places, 155 transitions, 1505 flow
[2024-06-14 14:55:02,781 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1505, PETRI_PLACES=123, PETRI_TRANSITIONS=155}
[2024-06-14 14:55:02,782 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 80 predicate places.
[2024-06-14 14:55:02,782 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 155 transitions, 1505 flow
[2024-06-14 14:55:02,783 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:02,783 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:02,783 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:02,783 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 14:55:02,783 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:55:02,783 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:02,784 INFO  L85        PathProgramCache]: Analyzing trace with hash -551568815, now seen corresponding path program 2 times
[2024-06-14 14:55:02,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:02,784 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339210715]
[2024-06-14 14:55:02,784 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:02,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:02,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:11,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:11,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:11,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339210715]
[2024-06-14 14:55:11,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339210715] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:11,132 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:11,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:11,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115408647]
[2024-06-14 14:55:11,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:11,133 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:11,134 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:11,134 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:11,134 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:11,372 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:55:11,373 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 155 transitions, 1505 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:11,373 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:11,373 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:55:11,373 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:12,824 INFO  L124   PetriNetUnfolderBase]: 1921/2900 cut-off events.
[2024-06-14 14:55:12,825 INFO  L125   PetriNetUnfolderBase]: For 89114/89114 co-relation queries the response was YES.
[2024-06-14 14:55:12,834 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20605 conditions, 2900 events. 1921/2900 cut-off events. For 89114/89114 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13924 event pairs, 487 based on Foata normal form. 3/2902 useless extension candidates. Maximal degree in co-relation 20547. Up to 2722 conditions per place. 
[2024-06-14 14:55:12,846 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 154 selfloop transitions, 37 changer transitions 0/195 dead transitions.
[2024-06-14 14:55:12,846 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 195 transitions, 2245 flow
[2024-06-14 14:55:12,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:55:12,847 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:55:12,847 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 14:55:12,847 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-14 14:55:12,848 INFO  L175             Difference]: Start difference. First operand has 123 places, 155 transitions, 1505 flow. Second operand 9 states and 170 transitions.
[2024-06-14 14:55:12,848 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 195 transitions, 2245 flow
[2024-06-14 14:55:12,892 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 195 transitions, 2148 flow, removed 34 selfloop flow, removed 5 redundant places.
[2024-06-14 14:55:12,895 INFO  L231             Difference]: Finished difference. Result has 128 places, 163 transitions, 1633 flow
[2024-06-14 14:55:12,895 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1633, PETRI_PLACES=128, PETRI_TRANSITIONS=163}
[2024-06-14 14:55:12,896 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places.
[2024-06-14 14:55:12,896 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 163 transitions, 1633 flow
[2024-06-14 14:55:12,896 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:12,896 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:12,896 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:12,896 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 14:55:12,896 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:55:12,897 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:12,897 INFO  L85        PathProgramCache]: Analyzing trace with hash -551395835, now seen corresponding path program 3 times
[2024-06-14 14:55:12,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:12,897 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665279287]
[2024-06-14 14:55:12,897 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:12,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:12,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:21,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:21,916 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:21,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665279287]
[2024-06-14 14:55:21,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665279287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:21,917 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:21,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:21,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405666730]
[2024-06-14 14:55:21,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:21,918 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:21,920 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:21,921 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:21,921 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:22,246 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:55:22,246 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 163 transitions, 1633 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:22,246 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:22,246 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:55:22,246 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:23,589 INFO  L124   PetriNetUnfolderBase]: 1915/2892 cut-off events.
[2024-06-14 14:55:23,590 INFO  L125   PetriNetUnfolderBase]: For 92606/92606 co-relation queries the response was YES.
[2024-06-14 14:55:23,600 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20659 conditions, 2892 events. 1915/2892 cut-off events. For 92606/92606 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13956 event pairs, 487 based on Foata normal form. 3/2894 useless extension candidates. Maximal degree in co-relation 20599. Up to 2714 conditions per place. 
[2024-06-14 14:55:23,613 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 151 selfloop transitions, 39 changer transitions 0/194 dead transitions.
[2024-06-14 14:55:23,613 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 194 transitions, 2197 flow
[2024-06-14 14:55:23,614 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:55:23,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:55:23,614 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 14:55:23,614 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-14 14:55:23,615 INFO  L175             Difference]: Start difference. First operand has 128 places, 163 transitions, 1633 flow. Second operand 9 states and 170 transitions.
[2024-06-14 14:55:23,615 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 194 transitions, 2197 flow
[2024-06-14 14:55:23,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 194 transitions, 2014 flow, removed 62 selfloop flow, removed 6 redundant places.
[2024-06-14 14:55:23,683 INFO  L231             Difference]: Finished difference. Result has 131 places, 163 transitions, 1537 flow
[2024-06-14 14:55:23,683 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1537, PETRI_PLACES=131, PETRI_TRANSITIONS=163}
[2024-06-14 14:55:23,684 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places.
[2024-06-14 14:55:23,684 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 163 transitions, 1537 flow
[2024-06-14 14:55:23,684 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:23,684 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:23,684 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:23,684 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 14:55:23,685 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:55:23,685 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:23,685 INFO  L85        PathProgramCache]: Analyzing trace with hash 284888657, now seen corresponding path program 4 times
[2024-06-14 14:55:23,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:23,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205435251]
[2024-06-14 14:55:23,685 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:23,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:23,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:31,001 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:31,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:31,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205435251]
[2024-06-14 14:55:31,002 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205435251] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:31,002 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:31,002 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:31,002 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051770043]
[2024-06-14 14:55:31,002 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:31,002 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:31,003 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:31,003 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:31,003 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:31,149 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:55:31,149 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 163 transitions, 1537 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:31,149 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:31,149 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:55:31,149 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:32,523 INFO  L124   PetriNetUnfolderBase]: 1933/2926 cut-off events.
[2024-06-14 14:55:32,524 INFO  L125   PetriNetUnfolderBase]: For 97374/97374 co-relation queries the response was YES.
[2024-06-14 14:55:32,533 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20886 conditions, 2926 events. 1933/2926 cut-off events. For 97374/97374 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14164 event pairs, 480 based on Foata normal form. 3/2928 useless extension candidates. Maximal degree in co-relation 20826. Up to 2633 conditions per place. 
[2024-06-14 14:55:32,546 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 127 selfloop transitions, 67 changer transitions 0/198 dead transitions.
[2024-06-14 14:55:32,546 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 198 transitions, 2203 flow
[2024-06-14 14:55:32,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:55:32,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:55:32,547 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-14 14:55:32,547 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-14 14:55:32,547 INFO  L175             Difference]: Start difference. First operand has 131 places, 163 transitions, 1537 flow. Second operand 9 states and 172 transitions.
[2024-06-14 14:55:32,547 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 198 transitions, 2203 flow
[2024-06-14 14:55:32,595 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 198 transitions, 2019 flow, removed 26 selfloop flow, removed 10 redundant places.
[2024-06-14 14:55:32,598 INFO  L231             Difference]: Finished difference. Result has 130 places, 167 transitions, 1594 flow
[2024-06-14 14:55:32,598 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1353, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1594, PETRI_PLACES=130, PETRI_TRANSITIONS=167}
[2024-06-14 14:55:32,598 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 87 predicate places.
[2024-06-14 14:55:32,598 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 167 transitions, 1594 flow
[2024-06-14 14:55:32,599 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:32,599 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:32,599 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:32,599 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 14:55:32,599 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:55:32,599 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:32,599 INFO  L85        PathProgramCache]: Analyzing trace with hash -551389077, now seen corresponding path program 1 times
[2024-06-14 14:55:32,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:32,600 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006385973]
[2024-06-14 14:55:32,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:32,600 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:32,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:39,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:39,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:39,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006385973]
[2024-06-14 14:55:39,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006385973] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:39,522 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:39,522 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:39,522 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453199382]
[2024-06-14 14:55:39,522 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:39,523 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:39,524 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:39,524 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:39,524 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:39,741 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:55:39,742 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 167 transitions, 1594 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:39,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:39,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:55:39,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:41,204 INFO  L124   PetriNetUnfolderBase]: 1961/2970 cut-off events.
[2024-06-14 14:55:41,205 INFO  L125   PetriNetUnfolderBase]: For 107214/107214 co-relation queries the response was YES.
[2024-06-14 14:55:41,221 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21684 conditions, 2970 events. 1961/2970 cut-off events. For 107214/107214 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14476 event pairs, 483 based on Foata normal form. 6/2975 useless extension candidates. Maximal degree in co-relation 21625. Up to 2809 conditions per place. 
[2024-06-14 14:55:41,234 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 168 selfloop transitions, 30 changer transitions 0/202 dead transitions.
[2024-06-14 14:55:41,235 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 202 transitions, 2264 flow
[2024-06-14 14:55:41,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:55:41,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:55:41,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions.
[2024-06-14 14:55:41,236 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-14 14:55:41,236 INFO  L175             Difference]: Start difference. First operand has 130 places, 167 transitions, 1594 flow. Second operand 9 states and 168 transitions.
[2024-06-14 14:55:41,236 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 202 transitions, 2264 flow
[2024-06-14 14:55:41,295 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 202 transitions, 2053 flow, removed 41 selfloop flow, removed 7 redundant places.
[2024-06-14 14:55:41,298 INFO  L231             Difference]: Finished difference. Result has 132 places, 170 transitions, 1537 flow
[2024-06-14 14:55:41,299 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1537, PETRI_PLACES=132, PETRI_TRANSITIONS=170}
[2024-06-14 14:55:41,301 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 89 predicate places.
[2024-06-14 14:55:41,301 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 170 transitions, 1537 flow
[2024-06-14 14:55:41,302 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:41,302 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:41,302 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:41,302 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 14:55:41,302 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:55:41,302 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:41,302 INFO  L85        PathProgramCache]: Analyzing trace with hash -345167695, now seen corresponding path program 1 times
[2024-06-14 14:55:41,303 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:41,303 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854927064]
[2024-06-14 14:55:41,303 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:41,303 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:41,342 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:50,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:50,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:50,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854927064]
[2024-06-14 14:55:50,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854927064] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:50,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:50,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:55:50,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332719259]
[2024-06-14 14:55:50,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:50,644 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:55:50,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:50,644 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:55:50,644 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:55:50,785 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:55:50,786 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 170 transitions, 1537 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:50,787 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:50,788 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:55:50,788 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:51,996 INFO  L124   PetriNetUnfolderBase]: 2011/3048 cut-off events.
[2024-06-14 14:55:51,996 INFO  L125   PetriNetUnfolderBase]: For 112435/112435 co-relation queries the response was YES.
[2024-06-14 14:55:52,010 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22405 conditions, 3048 events. 2011/3048 cut-off events. For 112435/112435 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14738 event pairs, 442 based on Foata normal form. 2/3049 useless extension candidates. Maximal degree in co-relation 22345. Up to 2900 conditions per place. 
[2024-06-14 14:55:52,028 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 167 selfloop transitions, 36 changer transitions 0/207 dead transitions.
[2024-06-14 14:55:52,028 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 207 transitions, 2347 flow
[2024-06-14 14:55:52,029 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:55:52,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:55:52,030 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions.
[2024-06-14 14:55:52,030 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4021164021164021
[2024-06-14 14:55:52,030 INFO  L175             Difference]: Start difference. First operand has 132 places, 170 transitions, 1537 flow. Second operand 9 states and 152 transitions.
[2024-06-14 14:55:52,030 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 207 transitions, 2347 flow
[2024-06-14 14:55:52,112 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 207 transitions, 2199 flow, removed 37 selfloop flow, removed 7 redundant places.
[2024-06-14 14:55:52,116 INFO  L231             Difference]: Finished difference. Result has 135 places, 187 transitions, 1680 flow
[2024-06-14 14:55:52,116 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1680, PETRI_PLACES=135, PETRI_TRANSITIONS=187}
[2024-06-14 14:55:52,120 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 92 predicate places.
[2024-06-14 14:55:52,121 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 187 transitions, 1680 flow
[2024-06-14 14:55:52,121 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:52,121 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:52,121 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:52,121 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 14:55:52,121 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:55:52,122 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:52,122 INFO  L85        PathProgramCache]: Analyzing trace with hash -2005338933, now seen corresponding path program 4 times
[2024-06-14 14:55:52,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:52,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270387059]
[2024-06-14 14:55:52,122 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:52,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:52,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:00,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:00,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:00,136 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270387059]
[2024-06-14 14:56:00,136 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270387059] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:00,136 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:00,137 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:56:00,137 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504026473]
[2024-06-14 14:56:00,137 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:00,137 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:56:00,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:00,138 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:56:00,138 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:56:00,352 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:56:00,353 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 187 transitions, 1680 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:00,353 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:00,353 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:56:00,353 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:01,652 INFO  L124   PetriNetUnfolderBase]: 1919/2957 cut-off events.
[2024-06-14 14:56:01,652 INFO  L125   PetriNetUnfolderBase]: For 116233/116247 co-relation queries the response was YES.
[2024-06-14 14:56:01,661 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21573 conditions, 2957 events. 1919/2957 cut-off events. For 116233/116247 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14694 event pairs, 398 based on Foata normal form. 18/2974 useless extension candidates. Maximal degree in co-relation 21511. Up to 2614 conditions per place. 
[2024-06-14 14:56:01,673 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 156 selfloop transitions, 25 changer transitions 0/216 dead transitions.
[2024-06-14 14:56:01,674 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 216 transitions, 2210 flow
[2024-06-14 14:56:01,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:56:01,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:56:01,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 14:56:01,676 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-14 14:56:01,676 INFO  L175             Difference]: Start difference. First operand has 135 places, 187 transitions, 1680 flow. Second operand 8 states and 150 transitions.
[2024-06-14 14:56:01,677 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 216 transitions, 2210 flow
[2024-06-14 14:56:01,736 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 216 transitions, 2154 flow, removed 14 selfloop flow, removed 2 redundant places.
[2024-06-14 14:56:01,739 INFO  L231             Difference]: Finished difference. Result has 142 places, 192 transitions, 1794 flow
[2024-06-14 14:56:01,739 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1794, PETRI_PLACES=142, PETRI_TRANSITIONS=192}
[2024-06-14 14:56:01,739 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 99 predicate places.
[2024-06-14 14:56:01,740 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 192 transitions, 1794 flow
[2024-06-14 14:56:01,740 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:01,740 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:01,740 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:01,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 14:56:01,740 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:56:01,740 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:01,741 INFO  L85        PathProgramCache]: Analyzing trace with hash 193422507, now seen corresponding path program 5 times
[2024-06-14 14:56:01,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:01,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19335985]
[2024-06-14 14:56:01,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:01,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:01,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:10,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:10,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:10,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19335985]
[2024-06-14 14:56:10,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19335985] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:10,377 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:10,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:56:10,378 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323305061]
[2024-06-14 14:56:10,378 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:10,380 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:56:10,381 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:10,381 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:56:10,381 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:56:10,661 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:56:10,661 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 192 transitions, 1794 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:10,661 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:10,661 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:56:10,662 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:11,956 INFO  L124   PetriNetUnfolderBase]: 2029/3083 cut-off events.
[2024-06-14 14:56:11,956 INFO  L125   PetriNetUnfolderBase]: For 127337/127343 co-relation queries the response was YES.
[2024-06-14 14:56:11,966 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22972 conditions, 3083 events. 2029/3083 cut-off events. For 127337/127343 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15073 event pairs, 419 based on Foata normal form. 4/3085 useless extension candidates. Maximal degree in co-relation 22907. Up to 2466 conditions per place. 
[2024-06-14 14:56:11,978 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 105 selfloop transitions, 123 changer transitions 0/232 dead transitions.
[2024-06-14 14:56:11,978 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 232 transitions, 2810 flow
[2024-06-14 14:56:11,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:56:11,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:56:11,979 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-14 14:56:11,979 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46296296296296297
[2024-06-14 14:56:11,979 INFO  L175             Difference]: Start difference. First operand has 142 places, 192 transitions, 1794 flow. Second operand 9 states and 175 transitions.
[2024-06-14 14:56:11,979 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 232 transitions, 2810 flow
[2024-06-14 14:56:12,045 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 232 transitions, 2679 flow, removed 43 selfloop flow, removed 5 redundant places.
[2024-06-14 14:56:12,047 INFO  L231             Difference]: Finished difference. Result has 146 places, 200 transitions, 2134 flow
[2024-06-14 14:56:12,047 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2134, PETRI_PLACES=146, PETRI_TRANSITIONS=200}
[2024-06-14 14:56:12,048 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 103 predicate places.
[2024-06-14 14:56:12,048 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 200 transitions, 2134 flow
[2024-06-14 14:56:12,048 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:12,048 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:12,048 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:12,048 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 14:56:12,048 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:56:12,048 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:12,049 INFO  L85        PathProgramCache]: Analyzing trace with hash -379263193, now seen corresponding path program 2 times
[2024-06-14 14:56:12,049 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:12,049 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322545643]
[2024-06-14 14:56:12,049 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:12,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:12,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:19,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:19,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:19,934 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322545643]
[2024-06-14 14:56:19,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322545643] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:19,934 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:19,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:56:19,934 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836641546]
[2024-06-14 14:56:19,934 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:19,935 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:56:19,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:19,935 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:56:19,935 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:56:20,171 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:56:20,172 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 200 transitions, 2134 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:20,172 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:20,172 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:56:20,172 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:21,503 INFO  L124   PetriNetUnfolderBase]: 2057/3130 cut-off events.
[2024-06-14 14:56:21,503 INFO  L125   PetriNetUnfolderBase]: For 138251/138263 co-relation queries the response was YES.
[2024-06-14 14:56:21,513 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24204 conditions, 3130 events. 2057/3130 cut-off events. For 138251/138263 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15358 event pairs, 463 based on Foata normal form. 18/3147 useless extension candidates. Maximal degree in co-relation 24138. Up to 2633 conditions per place. 
[2024-06-14 14:56:21,526 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 140 selfloop transitions, 91 changer transitions 0/235 dead transitions.
[2024-06-14 14:56:21,527 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 235 transitions, 2933 flow
[2024-06-14 14:56:21,527 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:56:21,528 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:56:21,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-14 14:56:21,528 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-14 14:56:21,528 INFO  L175             Difference]: Start difference. First operand has 146 places, 200 transitions, 2134 flow. Second operand 9 states and 172 transitions.
[2024-06-14 14:56:21,528 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 235 transitions, 2933 flow
[2024-06-14 14:56:21,606 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 235 transitions, 2701 flow, removed 58 selfloop flow, removed 5 redundant places.
[2024-06-14 14:56:21,609 INFO  L231             Difference]: Finished difference. Result has 150 places, 203 transitions, 2192 flow
[2024-06-14 14:56:21,610 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2192, PETRI_PLACES=150, PETRI_TRANSITIONS=203}
[2024-06-14 14:56:21,610 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places.
[2024-06-14 14:56:21,610 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 203 transitions, 2192 flow
[2024-06-14 14:56:21,610 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:21,610 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:21,611 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:21,611 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 14:56:21,611 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:56:21,611 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:21,611 INFO  L85        PathProgramCache]: Analyzing trace with hash 1152846567, now seen corresponding path program 6 times
[2024-06-14 14:56:21,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:21,611 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803795892]
[2024-06-14 14:56:21,611 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:21,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:21,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:29,173 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:29,174 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:29,174 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803795892]
[2024-06-14 14:56:29,174 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803795892] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:29,174 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:29,174 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:56:29,174 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902068636]
[2024-06-14 14:56:29,175 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:29,175 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:56:29,176 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:29,176 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:56:29,176 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:56:29,304 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:56:29,304 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 203 transitions, 2192 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:29,304 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:29,304 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:56:29,305 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:30,637 INFO  L124   PetriNetUnfolderBase]: 2075/3156 cut-off events.
[2024-06-14 14:56:30,638 INFO  L125   PetriNetUnfolderBase]: For 142524/142530 co-relation queries the response was YES.
[2024-06-14 14:56:30,649 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24883 conditions, 3156 events. 2075/3156 cut-off events. For 142524/142530 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15450 event pairs, 419 based on Foata normal form. 4/3158 useless extension candidates. Maximal degree in co-relation 24815. Up to 2677 conditions per place. 
[2024-06-14 14:56:30,663 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 156 selfloop transitions, 78 changer transitions 0/238 dead transitions.
[2024-06-14 14:56:30,664 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 238 transitions, 3072 flow
[2024-06-14 14:56:30,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:56:30,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:56:30,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-14 14:56:30,665 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-14 14:56:30,665 INFO  L175             Difference]: Start difference. First operand has 150 places, 203 transitions, 2192 flow. Second operand 9 states and 165 transitions.
[2024-06-14 14:56:30,665 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 238 transitions, 3072 flow
[2024-06-14 14:56:30,755 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 238 transitions, 2810 flow, removed 42 selfloop flow, removed 7 redundant places.
[2024-06-14 14:56:30,759 INFO  L231             Difference]: Finished difference. Result has 152 places, 207 transitions, 2205 flow
[2024-06-14 14:56:30,759 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2205, PETRI_PLACES=152, PETRI_TRANSITIONS=207}
[2024-06-14 14:56:30,759 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places.
[2024-06-14 14:56:30,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 207 transitions, 2205 flow
[2024-06-14 14:56:30,760 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:30,760 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:30,760 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:30,761 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 14:56:30,761 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:56:30,761 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:30,761 INFO  L85        PathProgramCache]: Analyzing trace with hash -2126690197, now seen corresponding path program 3 times
[2024-06-14 14:56:30,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:30,762 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166021870]
[2024-06-14 14:56:30,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:30,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:30,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:38,023 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:38,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:38,024 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166021870]
[2024-06-14 14:56:38,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166021870] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:38,024 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:38,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:56:38,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197761327]
[2024-06-14 14:56:38,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:38,025 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:56:38,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:38,025 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:56:38,025 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:56:38,278 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:56:38,279 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 207 transitions, 2205 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:38,279 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:38,279 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:56:38,279 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:39,580 INFO  L124   PetriNetUnfolderBase]: 2103/3213 cut-off events.
[2024-06-14 14:56:39,581 INFO  L125   PetriNetUnfolderBase]: For 151841/151853 co-relation queries the response was YES.
[2024-06-14 14:56:39,591 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25177 conditions, 3213 events. 2103/3213 cut-off events. For 151841/151853 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15953 event pairs, 463 based on Foata normal form. 18/3230 useless extension candidates. Maximal degree in co-relation 25108. Up to 2917 conditions per place. 
[2024-06-14 14:56:39,615 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 203 selfloop transitions, 48 changer transitions 0/255 dead transitions.
[2024-06-14 14:56:39,615 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 255 transitions, 3259 flow
[2024-06-14 14:56:39,616 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:56:39,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:56:39,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-14 14:56:39,621 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4470899470899471
[2024-06-14 14:56:39,621 INFO  L175             Difference]: Start difference. First operand has 152 places, 207 transitions, 2205 flow. Second operand 9 states and 169 transitions.
[2024-06-14 14:56:39,621 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 255 transitions, 3259 flow
[2024-06-14 14:56:39,759 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 255 transitions, 3000 flow, removed 43 selfloop flow, removed 7 redundant places.
[2024-06-14 14:56:39,763 INFO  L231             Difference]: Finished difference. Result has 157 places, 223 transitions, 2361 flow
[2024-06-14 14:56:39,763 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2361, PETRI_PLACES=157, PETRI_TRANSITIONS=223}
[2024-06-14 14:56:39,764 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 114 predicate places.
[2024-06-14 14:56:39,764 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 223 transitions, 2361 flow
[2024-06-14 14:56:39,764 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:39,764 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:39,765 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:39,765 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 14:56:39,765 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:56:39,765 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:39,765 INFO  L85        PathProgramCache]: Analyzing trace with hash -379494081, now seen corresponding path program 7 times
[2024-06-14 14:56:39,765 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:39,765 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336433819]
[2024-06-14 14:56:39,766 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:39,766 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:39,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:50,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:50,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:50,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336433819]
[2024-06-14 14:56:50,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336433819] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:50,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:50,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:56:50,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102627796]
[2024-06-14 14:56:50,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:50,834 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:56:50,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:50,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:56:50,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:56:51,023 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:56:51,023 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 223 transitions, 2361 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:51,023 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:51,023 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:56:51,023 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:52,496 INFO  L124   PetriNetUnfolderBase]: 2097/3205 cut-off events.
[2024-06-14 14:56:52,497 INFO  L125   PetriNetUnfolderBase]: For 154812/154824 co-relation queries the response was YES.
[2024-06-14 14:56:52,507 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25274 conditions, 3205 events. 2097/3205 cut-off events. For 154812/154824 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15903 event pairs, 413 based on Foata normal form. 15/3219 useless extension candidates. Maximal degree in co-relation 25201. Up to 2799 conditions per place. 
[2024-06-14 14:56:52,521 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 176 selfloop transitions, 78 changer transitions 0/258 dead transitions.
[2024-06-14 14:56:52,521 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 258 transitions, 3126 flow
[2024-06-14 14:56:52,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:56:52,522 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:56:52,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-14 14:56:52,523 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-14 14:56:52,523 INFO  L175             Difference]: Start difference. First operand has 157 places, 223 transitions, 2361 flow. Second operand 10 states and 188 transitions.
[2024-06-14 14:56:52,523 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 258 transitions, 3126 flow
[2024-06-14 14:56:52,638 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 258 transitions, 2915 flow, removed 87 selfloop flow, removed 3 redundant places.
[2024-06-14 14:56:52,643 INFO  L231             Difference]: Finished difference. Result has 165 places, 225 transitions, 2352 flow
[2024-06-14 14:56:52,643 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2352, PETRI_PLACES=165, PETRI_TRANSITIONS=225}
[2024-06-14 14:56:52,643 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 122 predicate places.
[2024-06-14 14:56:52,643 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 225 transitions, 2352 flow
[2024-06-14 14:56:52,644 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:52,644 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:52,644 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:52,644 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 14:56:52,644 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:56:52,645 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:52,645 INFO  L85        PathProgramCache]: Analyzing trace with hash -1777253085, now seen corresponding path program 4 times
[2024-06-14 14:56:52,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:52,645 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723488547]
[2024-06-14 14:56:52,645 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:52,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:52,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:00,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:00,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:00,138 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723488547]
[2024-06-14 14:57:00,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723488547] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:00,139 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:00,139 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:57:00,139 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030810259]
[2024-06-14 14:57:00,139 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:00,139 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:57:00,139 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:00,139 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:57:00,139 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:57:00,294 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:57:00,294 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 225 transitions, 2352 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:00,294 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:00,295 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:57:00,295 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:01,566 INFO  L124   PetriNetUnfolderBase]: 2125/3249 cut-off events.
[2024-06-14 14:57:01,567 INFO  L125   PetriNetUnfolderBase]: For 161732/161744 co-relation queries the response was YES.
[2024-06-14 14:57:01,578 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25684 conditions, 3249 events. 2125/3249 cut-off events. For 161732/161744 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16135 event pairs, 418 based on Foata normal form. 18/3266 useless extension candidates. Maximal degree in co-relation 25608. Up to 2953 conditions per place. 
[2024-06-14 14:57:01,591 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 203 selfloop transitions, 54 changer transitions 0/261 dead transitions.
[2024-06-14 14:57:01,591 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 261 transitions, 3219 flow
[2024-06-14 14:57:01,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:57:01,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:57:01,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions.
[2024-06-14 14:57:01,592 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-14 14:57:01,593 INFO  L175             Difference]: Start difference. First operand has 165 places, 225 transitions, 2352 flow. Second operand 9 states and 168 transitions.
[2024-06-14 14:57:01,593 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 261 transitions, 3219 flow
[2024-06-14 14:57:01,676 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 261 transitions, 2859 flow, removed 33 selfloop flow, removed 9 redundant places.
[2024-06-14 14:57:01,680 INFO  L231             Difference]: Finished difference. Result has 166 places, 231 transitions, 2255 flow
[2024-06-14 14:57:01,681 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2004, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2255, PETRI_PLACES=166, PETRI_TRANSITIONS=231}
[2024-06-14 14:57:01,681 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 123 predicate places.
[2024-06-14 14:57:01,681 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 231 transitions, 2255 flow
[2024-06-14 14:57:01,681 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:01,681 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:01,682 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:01,682 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 14:57:01,682 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:57:01,682 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:01,682 INFO  L85        PathProgramCache]: Analyzing trace with hash -1768682205, now seen corresponding path program 5 times
[2024-06-14 14:57:01,682 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:01,683 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827403653]
[2024-06-14 14:57:01,683 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:01,683 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:01,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:09,057 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:09,057 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:09,057 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827403653]
[2024-06-14 14:57:09,058 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827403653] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:09,058 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:09,058 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:57:09,059 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206201969]
[2024-06-14 14:57:09,059 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:09,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:57:09,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:09,060 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:57:09,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:57:09,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:57:09,318 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 231 transitions, 2255 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:09,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:09,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:57:09,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:10,852 INFO  L124   PetriNetUnfolderBase]: 2128/3254 cut-off events.
[2024-06-14 14:57:10,853 INFO  L125   PetriNetUnfolderBase]: For 167897/167909 co-relation queries the response was YES.
[2024-06-14 14:57:10,863 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25332 conditions, 3254 events. 2128/3254 cut-off events. For 167897/167909 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16189 event pairs, 375 based on Foata normal form. 18/3271 useless extension candidates. Maximal degree in co-relation 25255. Up to 2768 conditions per place. 
[2024-06-14 14:57:10,877 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 178 selfloop transitions, 83 changer transitions 0/265 dead transitions.
[2024-06-14 14:57:10,877 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 265 transitions, 3112 flow
[2024-06-14 14:57:10,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:57:10,878 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:57:10,896 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 14:57:10,897 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-14 14:57:10,897 INFO  L175             Difference]: Start difference. First operand has 166 places, 231 transitions, 2255 flow. Second operand 9 states and 170 transitions.
[2024-06-14 14:57:10,897 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 265 transitions, 3112 flow
[2024-06-14 14:57:10,996 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 265 transitions, 2939 flow, removed 48 selfloop flow, removed 6 redundant places.
[2024-06-14 14:57:10,999 INFO  L231             Difference]: Finished difference. Result has 169 places, 234 transitions, 2368 flow
[2024-06-14 14:57:11,000 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2368, PETRI_PLACES=169, PETRI_TRANSITIONS=234}
[2024-06-14 14:57:11,000 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 126 predicate places.
[2024-06-14 14:57:11,000 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 234 transitions, 2368 flow
[2024-06-14 14:57:11,001 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:11,001 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:11,001 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:11,001 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 14:57:11,001 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:57:11,001 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:11,002 INFO  L85        PathProgramCache]: Analyzing trace with hash 181942355, now seen corresponding path program 2 times
[2024-06-14 14:57:11,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:11,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077627150]
[2024-06-14 14:57:11,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:11,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:11,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:18,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:18,882 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:18,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077627150]
[2024-06-14 14:57:18,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077627150] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:18,883 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:18,883 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:57:18,883 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046440694]
[2024-06-14 14:57:18,883 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:18,883 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:57:18,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:18,884 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:57:18,884 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:57:18,956 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:57:18,957 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 234 transitions, 2368 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:18,957 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:18,957 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:57:18,957 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:20,356 INFO  L124   PetriNetUnfolderBase]: 2122/3233 cut-off events.
[2024-06-14 14:57:20,356 INFO  L125   PetriNetUnfolderBase]: For 171542/171548 co-relation queries the response was YES.
[2024-06-14 14:57:20,373 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25505 conditions, 3233 events. 2122/3233 cut-off events. For 171542/171548 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15939 event pairs, 447 based on Foata normal form. 3/3234 useless extension candidates. Maximal degree in co-relation 25428. Up to 3075 conditions per place. 
[2024-06-14 14:57:20,394 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 207 selfloop transitions, 33 changer transitions 0/244 dead transitions.
[2024-06-14 14:57:20,394 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 244 transitions, 2959 flow
[2024-06-14 14:57:20,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:57:20,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:57:20,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-14 14:57:20,395 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4246031746031746
[2024-06-14 14:57:20,396 INFO  L175             Difference]: Start difference. First operand has 169 places, 234 transitions, 2368 flow. Second operand 6 states and 107 transitions.
[2024-06-14 14:57:20,396 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 244 transitions, 2959 flow
[2024-06-14 14:57:20,548 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 244 transitions, 2669 flow, removed 63 selfloop flow, removed 7 redundant places.
[2024-06-14 14:57:20,552 INFO  L231             Difference]: Finished difference. Result has 168 places, 234 transitions, 2154 flow
[2024-06-14 14:57:20,553 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2154, PETRI_PLACES=168, PETRI_TRANSITIONS=234}
[2024-06-14 14:57:20,554 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places.
[2024-06-14 14:57:20,554 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 234 transitions, 2154 flow
[2024-06-14 14:57:20,554 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:20,554 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:20,554 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:20,554 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 14:57:20,555 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:57:20,555 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:20,555 INFO  L85        PathProgramCache]: Analyzing trace with hash -1364431661, now seen corresponding path program 3 times
[2024-06-14 14:57:20,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:20,555 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39640648]
[2024-06-14 14:57:20,556 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:20,556 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:20,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:32,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:32,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:32,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39640648]
[2024-06-14 14:57:32,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39640648] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:32,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:32,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:57:32,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294700335]
[2024-06-14 14:57:32,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:32,117 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:57:32,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:32,117 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:57:32,117 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:57:32,196 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:57:32,196 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 234 transitions, 2154 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:32,196 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:32,196 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:57:32,196 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:33,439 INFO  L124   PetriNetUnfolderBase]: 2140/3267 cut-off events.
[2024-06-14 14:57:33,439 INFO  L125   PetriNetUnfolderBase]: For 173732/173734 co-relation queries the response was YES.
[2024-06-14 14:57:33,451 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25095 conditions, 3267 events. 2140/3267 cut-off events. For 173732/173734 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16201 event pairs, 429 based on Foata normal form. 4/3270 useless extension candidates. Maximal degree in co-relation 25017. Up to 3106 conditions per place. 
[2024-06-14 14:57:33,465 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 226 selfloop transitions, 34 changer transitions 0/264 dead transitions.
[2024-06-14 14:57:33,465 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 264 transitions, 2869 flow
[2024-06-14 14:57:33,465 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:57:33,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:57:33,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-14 14:57:33,474 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-14 14:57:33,474 INFO  L175             Difference]: Start difference. First operand has 168 places, 234 transitions, 2154 flow. Second operand 7 states and 127 transitions.
[2024-06-14 14:57:33,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 264 transitions, 2869 flow
[2024-06-14 14:57:33,560 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 264 transitions, 2749 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-14 14:57:33,563 INFO  L231             Difference]: Finished difference. Result has 171 places, 245 transitions, 2265 flow
[2024-06-14 14:57:33,563 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2056, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2265, PETRI_PLACES=171, PETRI_TRANSITIONS=245}
[2024-06-14 14:57:33,575 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 128 predicate places.
[2024-06-14 14:57:33,575 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 245 transitions, 2265 flow
[2024-06-14 14:57:33,575 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:33,576 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:33,576 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:33,576 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 14:57:33,577 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:57:33,577 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:33,577 INFO  L85        PathProgramCache]: Analyzing trace with hash 164760047, now seen corresponding path program 1 times
[2024-06-14 14:57:33,577 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:33,577 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086865668]
[2024-06-14 14:57:33,577 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:33,577 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:33,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:42,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:42,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:42,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086865668]
[2024-06-14 14:57:42,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086865668] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:42,207 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:42,207 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:57:42,207 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83417497]
[2024-06-14 14:57:42,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:42,208 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:57:42,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:42,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:57:42,208 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:57:42,325 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:57:42,326 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 245 transitions, 2265 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:42,326 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:42,326 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:57:42,326 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:43,340 INFO  L124   PetriNetUnfolderBase]: 1938/3060 cut-off events.
[2024-06-14 14:57:43,341 INFO  L125   PetriNetUnfolderBase]: For 150553/150555 co-relation queries the response was YES.
[2024-06-14 14:57:43,354 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22806 conditions, 3060 events. 1938/3060 cut-off events. For 150553/150555 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15689 event pairs, 373 based on Foata normal form. 2/3061 useless extension candidates. Maximal degree in co-relation 22726. Up to 2848 conditions per place. 
[2024-06-14 14:57:43,368 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 235 selfloop transitions, 20 changer transitions 0/260 dead transitions.
[2024-06-14 14:57:43,368 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 260 transitions, 2922 flow
[2024-06-14 14:57:43,369 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:57:43,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:57:43,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-14 14:57:43,369 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 14:57:43,369 INFO  L175             Difference]: Start difference. First operand has 171 places, 245 transitions, 2265 flow. Second operand 6 states and 114 transitions.
[2024-06-14 14:57:43,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 260 transitions, 2922 flow
[2024-06-14 14:57:43,486 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 260 transitions, 2885 flow, removed 1 selfloop flow, removed 4 redundant places.
[2024-06-14 14:57:43,496 INFO  L231             Difference]: Finished difference. Result has 173 places, 248 transitions, 2311 flow
[2024-06-14 14:57:43,497 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2311, PETRI_PLACES=173, PETRI_TRANSITIONS=248}
[2024-06-14 14:57:43,497 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places.
[2024-06-14 14:57:43,497 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 248 transitions, 2311 flow
[2024-06-14 14:57:43,497 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:43,497 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:43,498 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:43,498 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 14:57:43,498 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:57:43,498 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:43,498 INFO  L85        PathProgramCache]: Analyzing trace with hash 182294267, now seen corresponding path program 2 times
[2024-06-14 14:57:43,498 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:43,498 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382051004]
[2024-06-14 14:57:43,499 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:43,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:43,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:51,740 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:51,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:51,740 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382051004]
[2024-06-14 14:57:51,740 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382051004] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:51,740 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:51,741 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:57:51,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792930614]
[2024-06-14 14:57:51,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:51,741 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:57:51,741 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:51,741 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:57:51,742 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:57:51,888 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:57:51,888 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 248 transitions, 2311 flow. Second operand  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:51,888 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:51,888 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:57:51,888 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:52,974 INFO  L124   PetriNetUnfolderBase]: 1905/3006 cut-off events.
[2024-06-14 14:57:52,974 INFO  L125   PetriNetUnfolderBase]: For 154883/154885 co-relation queries the response was YES.
[2024-06-14 14:57:52,986 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22687 conditions, 3006 events. 1905/3006 cut-off events. For 154883/154885 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15327 event pairs, 371 based on Foata normal form. 1/3006 useless extension candidates. Maximal degree in co-relation 22607. Up to 2828 conditions per place. 
[2024-06-14 14:57:52,998 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 238 selfloop transitions, 13 changer transitions 0/256 dead transitions.
[2024-06-14 14:57:52,999 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 256 transitions, 2835 flow
[2024-06-14 14:57:52,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:57:52,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:57:52,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-14 14:57:53,000 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3979591836734694
[2024-06-14 14:57:53,000 INFO  L175             Difference]: Start difference. First operand has 173 places, 248 transitions, 2311 flow. Second operand 7 states and 117 transitions.
[2024-06-14 14:57:53,000 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 256 transitions, 2835 flow
[2024-06-14 14:57:53,136 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 256 transitions, 2804 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 14:57:53,139 INFO  L231             Difference]: Finished difference. Result has 177 places, 248 transitions, 2312 flow
[2024-06-14 14:57:53,139 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2312, PETRI_PLACES=177, PETRI_TRANSITIONS=248}
[2024-06-14 14:57:53,140 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places.
[2024-06-14 14:57:53,140 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 248 transitions, 2312 flow
[2024-06-14 14:57:53,140 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:53,140 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:53,140 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:53,140 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 14:57:53,141 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:57:53,141 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:53,141 INFO  L85        PathProgramCache]: Analyzing trace with hash -57297365, now seen corresponding path program 1 times
[2024-06-14 14:57:53,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:53,141 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227254939]
[2024-06-14 14:57:53,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:53,142 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:53,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:01,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:01,139 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:01,139 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227254939]
[2024-06-14 14:58:01,139 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227254939] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:01,139 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:01,139 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:01,139 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102041373]
[2024-06-14 14:58:01,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:01,140 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:01,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:01,140 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:01,140 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:01,411 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:58:01,412 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 248 transitions, 2312 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:01,412 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:01,412 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:58:01,412 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:02,784 INFO  L124   PetriNetUnfolderBase]: 2137/3266 cut-off events.
[2024-06-14 14:58:02,784 INFO  L125   PetriNetUnfolderBase]: For 197610/197618 co-relation queries the response was YES.
[2024-06-14 14:58:02,798 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25755 conditions, 3266 events. 2137/3266 cut-off events. For 197610/197618 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16216 event pairs, 428 based on Foata normal form. 14/3279 useless extension candidates. Maximal degree in co-relation 25674. Up to 3013 conditions per place. 
[2024-06-14 14:58:02,812 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 228 selfloop transitions, 53 changer transitions 0/285 dead transitions.
[2024-06-14 14:58:02,813 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 285 transitions, 3161 flow
[2024-06-14 14:58:02,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:58:02,813 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:58:02,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions.
[2024-06-14 14:58:02,814 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42592592592592593
[2024-06-14 14:58:02,814 INFO  L175             Difference]: Start difference. First operand has 177 places, 248 transitions, 2312 flow. Second operand 9 states and 161 transitions.
[2024-06-14 14:58:02,814 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 285 transitions, 3161 flow
[2024-06-14 14:58:02,932 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 285 transitions, 3110 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-14 14:58:02,936 INFO  L231             Difference]: Finished difference. Result has 179 places, 251 transitions, 2477 flow
[2024-06-14 14:58:02,936 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2477, PETRI_PLACES=179, PETRI_TRANSITIONS=251}
[2024-06-14 14:58:02,936 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 136 predicate places.
[2024-06-14 14:58:02,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 251 transitions, 2477 flow
[2024-06-14 14:58:02,937 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:02,937 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:02,937 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:02,937 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 14:58:02,937 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:58:02,938 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:02,938 INFO  L85        PathProgramCache]: Analyzing trace with hash 1253883183, now seen corresponding path program 2 times
[2024-06-14 14:58:02,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:02,938 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583438420]
[2024-06-14 14:58:02,938 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:02,938 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:03,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:09,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:09,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:09,783 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583438420]
[2024-06-14 14:58:09,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583438420] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:09,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:09,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:09,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293708163]
[2024-06-14 14:58:09,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:09,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:09,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:09,785 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:09,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:10,058 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:58:10,058 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 251 transitions, 2477 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:10,058 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:10,058 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:58:10,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:11,599 INFO  L124   PetriNetUnfolderBase]: 2281/3479 cut-off events.
[2024-06-14 14:58:11,599 INFO  L125   PetriNetUnfolderBase]: For 214825/214829 co-relation queries the response was YES.
[2024-06-14 14:58:11,612 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28139 conditions, 3479 events. 2281/3479 cut-off events. For 214825/214829 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17473 event pairs, 433 based on Foata normal form. 10/3488 useless extension candidates. Maximal degree in co-relation 28057. Up to 3153 conditions per place. 
[2024-06-14 14:58:11,625 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 246 selfloop transitions, 57 changer transitions 0/307 dead transitions.
[2024-06-14 14:58:11,626 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 307 transitions, 3785 flow
[2024-06-14 14:58:11,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:58:11,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:58:11,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions.
[2024-06-14 14:58:11,627 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-14 14:58:11,627 INFO  L175             Difference]: Start difference. First operand has 179 places, 251 transitions, 2477 flow. Second operand 10 states and 182 transitions.
[2024-06-14 14:58:11,627 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 307 transitions, 3785 flow
[2024-06-14 14:58:11,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 307 transitions, 3475 flow, removed 90 selfloop flow, removed 7 redundant places.
[2024-06-14 14:58:11,775 INFO  L231             Difference]: Finished difference. Result has 185 places, 269 transitions, 2742 flow
[2024-06-14 14:58:11,775 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2742, PETRI_PLACES=185, PETRI_TRANSITIONS=269}
[2024-06-14 14:58:11,776 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places.
[2024-06-14 14:58:11,776 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 269 transitions, 2742 flow
[2024-06-14 14:58:11,776 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:11,776 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:11,776 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:11,776 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 14:58:11,776 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:58:11,777 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:11,777 INFO  L85        PathProgramCache]: Analyzing trace with hash 1165317423, now seen corresponding path program 3 times
[2024-06-14 14:58:11,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:11,777 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877612588]
[2024-06-14 14:58:11,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:11,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:11,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:19,080 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:19,080 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:19,080 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877612588]
[2024-06-14 14:58:19,081 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877612588] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:19,081 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:19,081 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:19,081 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109266022]
[2024-06-14 14:58:19,081 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:19,081 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:19,081 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:19,082 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:19,082 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:19,298 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:58:19,299 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 269 transitions, 2742 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:19,299 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:19,299 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:58:19,299 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:20,770 INFO  L124   PetriNetUnfolderBase]: 2383/3637 cut-off events.
[2024-06-14 14:58:20,770 INFO  L125   PetriNetUnfolderBase]: For 232266/232270 co-relation queries the response was YES.
[2024-06-14 14:58:20,789 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29723 conditions, 3637 events. 2383/3637 cut-off events. For 232266/232270 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 18449 event pairs, 445 based on Foata normal form. 10/3646 useless extension candidates. Maximal degree in co-relation 29637. Up to 3333 conditions per place. 
[2024-06-14 14:58:20,805 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 260 selfloop transitions, 51 changer transitions 0/315 dead transitions.
[2024-06-14 14:58:20,806 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 315 transitions, 3904 flow
[2024-06-14 14:58:20,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:58:20,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:58:20,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions.
[2024-06-14 14:58:20,807 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-14 14:58:20,807 INFO  L175             Difference]: Start difference. First operand has 185 places, 269 transitions, 2742 flow. Second operand 10 states and 182 transitions.
[2024-06-14 14:58:20,807 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 315 transitions, 3904 flow
[2024-06-14 14:58:20,970 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 315 transitions, 3765 flow, removed 59 selfloop flow, removed 3 redundant places.
[2024-06-14 14:58:20,974 INFO  L231             Difference]: Finished difference. Result has 194 places, 279 transitions, 2987 flow
[2024-06-14 14:58:20,974 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2603, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2987, PETRI_PLACES=194, PETRI_TRANSITIONS=279}
[2024-06-14 14:58:20,974 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-14 14:58:20,975 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 279 transitions, 2987 flow
[2024-06-14 14:58:20,975 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:20,975 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:20,975 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:20,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 14:58:20,975 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:58:20,976 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:20,976 INFO  L85        PathProgramCache]: Analyzing trace with hash 532945877, now seen corresponding path program 4 times
[2024-06-14 14:58:20,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:20,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678639613]
[2024-06-14 14:58:20,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:20,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:21,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:30,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:30,460 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:30,460 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678639613]
[2024-06-14 14:58:30,460 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678639613] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:30,461 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:30,461 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:58:30,461 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296848216]
[2024-06-14 14:58:30,461 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:30,461 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:58:30,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:30,462 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:58:30,462 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:58:30,676 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:58:30,677 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 279 transitions, 2987 flow. Second operand  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:30,677 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:30,677 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:58:30,677 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:32,294 INFO  L124   PetriNetUnfolderBase]: 2411/3685 cut-off events.
[2024-06-14 14:58:32,294 INFO  L125   PetriNetUnfolderBase]: For 246311/246319 co-relation queries the response was YES.
[2024-06-14 14:58:32,309 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30637 conditions, 3685 events. 2411/3685 cut-off events. For 246311/246319 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 18825 event pairs, 464 based on Foata normal form. 14/3698 useless extension candidates. Maximal degree in co-relation 30547. Up to 3430 conditions per place. 
[2024-06-14 14:58:32,325 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 265 selfloop transitions, 46 changer transitions 0/315 dead transitions.
[2024-06-14 14:58:32,325 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 315 transitions, 4008 flow
[2024-06-14 14:58:32,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:58:32,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:58:32,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-14 14:58:32,326 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4708994708994709
[2024-06-14 14:58:32,326 INFO  L175             Difference]: Start difference. First operand has 194 places, 279 transitions, 2987 flow. Second operand 9 states and 178 transitions.
[2024-06-14 14:58:32,326 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 315 transitions, 4008 flow
[2024-06-14 14:58:32,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 315 transitions, 3812 flow, removed 73 selfloop flow, removed 5 redundant places.
[2024-06-14 14:58:32,488 INFO  L231             Difference]: Finished difference. Result has 198 places, 282 transitions, 3013 flow
[2024-06-14 14:58:32,488 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2793, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3013, PETRI_PLACES=198, PETRI_TRANSITIONS=282}
[2024-06-14 14:58:32,489 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 155 predicate places.
[2024-06-14 14:58:32,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 282 transitions, 3013 flow
[2024-06-14 14:58:32,489 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:32,494 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:32,494 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:32,494 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 14:58:32,494 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:58:32,494 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:32,494 INFO  L85        PathProgramCache]: Analyzing trace with hash 81082915, now seen corresponding path program 5 times
[2024-06-14 14:58:32,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:32,495 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132924823]
[2024-06-14 14:58:32,495 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:32,495 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:32,560 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:40,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:40,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:40,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132924823]
[2024-06-14 14:58:40,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132924823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:40,821 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:40,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:40,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335303901]
[2024-06-14 14:58:40,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:40,822 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:40,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:40,822 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:40,822 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:40,987 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:58:40,987 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 282 transitions, 3013 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:40,987 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:40,988 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:58:40,988 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:42,639 INFO  L124   PetriNetUnfolderBase]: 2490/3806 cut-off events.
[2024-06-14 14:58:42,640 INFO  L125   PetriNetUnfolderBase]: For 265608/265616 co-relation queries the response was YES.
[2024-06-14 14:58:42,657 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32373 conditions, 3806 events. 2490/3806 cut-off events. For 265608/265616 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19563 event pairs, 471 based on Foata normal form. 14/3819 useless extension candidates. Maximal degree in co-relation 32281. Up to 3434 conditions per place. 
[2024-06-14 14:58:42,674 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 272 selfloop transitions, 49 changer transitions 0/325 dead transitions.
[2024-06-14 14:58:42,674 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 325 transitions, 4388 flow
[2024-06-14 14:58:42,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:58:42,675 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:58:42,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-14 14:58:42,675 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-14 14:58:42,676 INFO  L175             Difference]: Start difference. First operand has 198 places, 282 transitions, 3013 flow. Second operand 9 states and 172 transitions.
[2024-06-14 14:58:42,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 325 transitions, 4388 flow
[2024-06-14 14:58:42,901 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 325 transitions, 4192 flow, removed 54 selfloop flow, removed 7 redundant places.
[2024-06-14 14:58:42,905 INFO  L231             Difference]: Finished difference. Result has 201 places, 288 transitions, 3147 flow
[2024-06-14 14:58:42,905 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2817, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3147, PETRI_PLACES=201, PETRI_TRANSITIONS=288}
[2024-06-14 14:58:42,906 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 158 predicate places.
[2024-06-14 14:58:42,906 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 288 transitions, 3147 flow
[2024-06-14 14:58:42,906 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:42,906 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:42,906 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:42,906 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 14:58:42,907 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:58:42,907 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:42,907 INFO  L85        PathProgramCache]: Analyzing trace with hash 86593165, now seen corresponding path program 6 times
[2024-06-14 14:58:42,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:42,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631790577]
[2024-06-14 14:58:42,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:42,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:43,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:50,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:50,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:50,466 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631790577]
[2024-06-14 14:58:50,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631790577] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:50,466 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:50,466 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:50,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990402955]
[2024-06-14 14:58:50,467 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:50,467 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:50,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:50,467 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:50,467 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:50,612 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:58:50,612 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 288 transitions, 3147 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:50,612 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:50,612 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:58:50,612 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:52,259 INFO  L124   PetriNetUnfolderBase]: 2493/3811 cut-off events.
[2024-06-14 14:58:52,259 INFO  L125   PetriNetUnfolderBase]: For 276213/276221 co-relation queries the response was YES.
[2024-06-14 14:58:52,275 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32618 conditions, 3811 events. 2493/3811 cut-off events. For 276213/276221 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19658 event pairs, 477 based on Foata normal form. 14/3824 useless extension candidates. Maximal degree in co-relation 32524. Up to 3556 conditions per place. 
[2024-06-14 14:58:52,291 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 271 selfloop transitions, 48 changer transitions 0/323 dead transitions.
[2024-06-14 14:58:52,291 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 323 transitions, 4108 flow
[2024-06-14 14:58:52,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:58:52,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:58:52,293 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-14 14:58:52,293 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4470899470899471
[2024-06-14 14:58:52,293 INFO  L175             Difference]: Start difference. First operand has 201 places, 288 transitions, 3147 flow. Second operand 9 states and 169 transitions.
[2024-06-14 14:58:52,293 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 323 transitions, 4108 flow
[2024-06-14 14:58:52,504 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 323 transitions, 3888 flow, removed 83 selfloop flow, removed 5 redundant places.
[2024-06-14 14:58:52,518 INFO  L231             Difference]: Finished difference. Result has 205 places, 291 transitions, 3165 flow
[2024-06-14 14:58:52,518 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2947, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3165, PETRI_PLACES=205, PETRI_TRANSITIONS=291}
[2024-06-14 14:58:52,518 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places.
[2024-06-14 14:58:52,519 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 291 transitions, 3165 flow
[2024-06-14 14:58:52,519 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:52,519 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:52,519 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:52,519 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 14:58:52,519 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:58:52,520 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:52,520 INFO  L85        PathProgramCache]: Analyzing trace with hash 1254037005, now seen corresponding path program 1 times
[2024-06-14 14:58:52,520 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:52,520 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309206604]
[2024-06-14 14:58:52,520 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:52,520 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:52,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:02,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:02,154 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:02,154 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309206604]
[2024-06-14 14:59:02,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309206604] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:02,154 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:02,154 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:59:02,154 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794178323]
[2024-06-14 14:59:02,154 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:02,155 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:59:02,155 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:02,155 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:59:02,155 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:59:02,441 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:59:02,442 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 291 transitions, 3165 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:02,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:02,442 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:59:02,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:04,363 INFO  L124   PetriNetUnfolderBase]: 2589/3981 cut-off events.
[2024-06-14 14:59:04,363 INFO  L125   PetriNetUnfolderBase]: For 318317/318325 co-relation queries the response was YES.
[2024-06-14 14:59:04,380 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34075 conditions, 3981 events. 2589/3981 cut-off events. For 318317/318325 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20950 event pairs, 449 based on Foata normal form. 32/4012 useless extension candidates. Maximal degree in co-relation 33979. Up to 3562 conditions per place. 
[2024-06-14 14:59:04,397 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 265 selfloop transitions, 65 changer transitions 0/334 dead transitions.
[2024-06-14 14:59:04,398 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 334 transitions, 4186 flow
[2024-06-14 14:59:04,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:59:04,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:59:04,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-14 14:59:04,399 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-14 14:59:04,399 INFO  L175             Difference]: Start difference. First operand has 205 places, 291 transitions, 3165 flow. Second operand 10 states and 189 transitions.
[2024-06-14 14:59:04,399 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 334 transitions, 4186 flow
[2024-06-14 14:59:04,627 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 334 transitions, 3998 flow, removed 48 selfloop flow, removed 7 redundant places.
[2024-06-14 14:59:04,631 INFO  L231             Difference]: Finished difference. Result has 208 places, 293 transitions, 3229 flow
[2024-06-14 14:59:04,631 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2977, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3229, PETRI_PLACES=208, PETRI_TRANSITIONS=293}
[2024-06-14 14:59:04,632 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 165 predicate places.
[2024-06-14 14:59:04,632 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 293 transitions, 3229 flow
[2024-06-14 14:59:04,632 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:04,632 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:04,632 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:04,633 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 14:59:04,633 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:59:04,633 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:04,633 INFO  L85        PathProgramCache]: Analyzing trace with hash 538667609, now seen corresponding path program 2 times
[2024-06-14 14:59:04,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:04,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534873433]
[2024-06-14 14:59:04,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:04,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:04,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:14,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:14,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:14,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534873433]
[2024-06-14 14:59:14,555 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534873433] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:14,556 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:14,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:59:14,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475609774]
[2024-06-14 14:59:14,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:14,556 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:59:14,556 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:14,557 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:59:14,557 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:59:14,777 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:59:14,777 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 293 transitions, 3229 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:14,777 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:14,777 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:59:14,777 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:16,612 INFO  L124   PetriNetUnfolderBase]: 2789/4315 cut-off events.
[2024-06-14 14:59:16,612 INFO  L125   PetriNetUnfolderBase]: For 364801/364809 co-relation queries the response was YES.
[2024-06-14 14:59:16,633 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38652 conditions, 4315 events. 2789/4315 cut-off events. For 364801/364809 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23326 event pairs, 520 based on Foata normal form. 26/4340 useless extension candidates. Maximal degree in co-relation 38555. Up to 3678 conditions per place. 
[2024-06-14 14:59:16,655 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 271 selfloop transitions, 66 changer transitions 0/341 dead transitions.
[2024-06-14 14:59:16,655 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 341 transitions, 4590 flow
[2024-06-14 14:59:16,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:59:16,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:59:16,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-14 14:59:16,656 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4595238095238095
[2024-06-14 14:59:16,656 INFO  L175             Difference]: Start difference. First operand has 208 places, 293 transitions, 3229 flow. Second operand 10 states and 193 transitions.
[2024-06-14 14:59:16,656 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 341 transitions, 4590 flow
[2024-06-14 14:59:16,960 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 341 transitions, 4388 flow, removed 38 selfloop flow, removed 8 redundant places.
[2024-06-14 14:59:16,964 INFO  L231             Difference]: Finished difference. Result has 210 places, 297 transitions, 3398 flow
[2024-06-14 14:59:16,964 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3027, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3398, PETRI_PLACES=210, PETRI_TRANSITIONS=297}
[2024-06-14 14:59:16,964 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places.
[2024-06-14 14:59:16,964 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 297 transitions, 3398 flow
[2024-06-14 14:59:16,965 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:16,965 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:16,965 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:16,965 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 14:59:16,965 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:59:16,965 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:16,966 INFO  L85        PathProgramCache]: Analyzing trace with hash 533095979, now seen corresponding path program 3 times
[2024-06-14 14:59:16,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:16,966 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162967261]
[2024-06-14 14:59:16,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:16,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:17,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:27,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:27,545 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:27,545 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162967261]
[2024-06-14 14:59:27,545 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162967261] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:27,546 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:27,546 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:59:27,546 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820705527]
[2024-06-14 14:59:27,546 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:27,546 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:59:27,546 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:27,547 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:59:27,547 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:59:27,796 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:59:27,796 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 297 transitions, 3398 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:27,796 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:27,796 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:59:27,796 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:29,674 INFO  L124   PetriNetUnfolderBase]: 2953/4591 cut-off events.
[2024-06-14 14:59:29,674 INFO  L125   PetriNetUnfolderBase]: For 425978/425986 co-relation queries the response was YES.
[2024-06-14 14:59:29,694 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41201 conditions, 4591 events. 2953/4591 cut-off events. For 425978/425986 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 25407 event pairs, 592 based on Foata normal form. 50/4640 useless extension candidates. Maximal degree in co-relation 41103. Up to 4069 conditions per place. 
[2024-06-14 14:59:29,717 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 284 selfloop transitions, 53 changer transitions 0/341 dead transitions.
[2024-06-14 14:59:29,717 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 341 transitions, 4659 flow
[2024-06-14 14:59:29,718 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:59:29,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:59:29,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-14 14:59:29,719 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-14 14:59:29,719 INFO  L175             Difference]: Start difference. First operand has 210 places, 297 transitions, 3398 flow. Second operand 10 states and 189 transitions.
[2024-06-14 14:59:29,719 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 341 transitions, 4659 flow
[2024-06-14 14:59:30,232 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 341 transitions, 4477 flow, removed 51 selfloop flow, removed 6 redundant places.
[2024-06-14 14:59:30,237 INFO  L231             Difference]: Finished difference. Result has 214 places, 301 transitions, 3579 flow
[2024-06-14 14:59:30,238 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3224, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3579, PETRI_PLACES=214, PETRI_TRANSITIONS=301}
[2024-06-14 14:59:30,238 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 171 predicate places.
[2024-06-14 14:59:30,238 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 301 transitions, 3579 flow
[2024-06-14 14:59:30,239 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:30,239 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:30,239 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:30,239 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 14:59:30,240 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:59:30,240 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:30,240 INFO  L85        PathProgramCache]: Analyzing trace with hash 538660169, now seen corresponding path program 4 times
[2024-06-14 14:59:30,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:30,240 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183586058]
[2024-06-14 14:59:30,240 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:30,241 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:30,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:41,264 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:41,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:41,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183586058]
[2024-06-14 14:59:41,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183586058] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:41,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:41,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:59:41,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840504383]
[2024-06-14 14:59:41,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:41,266 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:59:41,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:41,268 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:59:41,268 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:59:41,471 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:59:41,472 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 301 transitions, 3579 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:41,472 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:41,472 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:59:41,472 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:43,364 INFO  L124   PetriNetUnfolderBase]: 3049/4745 cut-off events.
[2024-06-14 14:59:43,366 INFO  L125   PetriNetUnfolderBase]: For 424643/424645 co-relation queries the response was YES.
[2024-06-14 14:59:43,386 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42670 conditions, 4745 events. 3049/4745 cut-off events. For 424643/424645 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 26497 event pairs, 617 based on Foata normal form. 24/4768 useless extension candidates. Maximal degree in co-relation 42570. Up to 4177 conditions per place. 
[2024-06-14 14:59:43,408 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 238 selfloop transitions, 98 changer transitions 0/340 dead transitions.
[2024-06-14 14:59:43,409 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 340 transitions, 4603 flow
[2024-06-14 14:59:43,409 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:59:43,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:59:43,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-14 14:59:43,410 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 14:59:43,410 INFO  L175             Difference]: Start difference. First operand has 214 places, 301 transitions, 3579 flow. Second operand 10 states and 190 transitions.
[2024-06-14 14:59:43,410 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 340 transitions, 4603 flow
[2024-06-14 14:59:43,877 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 340 transitions, 4368 flow, removed 69 selfloop flow, removed 8 redundant places.
[2024-06-14 14:59:43,880 INFO  L231             Difference]: Finished difference. Result has 216 places, 303 transitions, 3666 flow
[2024-06-14 14:59:43,881 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3344, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3666, PETRI_PLACES=216, PETRI_TRANSITIONS=303}
[2024-06-14 14:59:43,881 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 173 predicate places.
[2024-06-14 14:59:43,881 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 303 transitions, 3666 flow
[2024-06-14 14:59:43,881 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:43,881 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:43,882 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:43,882 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 14:59:43,882 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:59:43,882 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:43,882 INFO  L85        PathProgramCache]: Analyzing trace with hash 538458359, now seen corresponding path program 5 times
[2024-06-14 14:59:43,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:43,882 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040698804]
[2024-06-14 14:59:43,883 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:43,883 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:43,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:54,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:54,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:54,155 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040698804]
[2024-06-14 14:59:54,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040698804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:54,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:54,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:59:54,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658597420]
[2024-06-14 14:59:54,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:54,156 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:59:54,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:54,156 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:59:54,156 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:59:54,423 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:59:54,423 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 303 transitions, 3666 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:54,423 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:54,423 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:59:54,423 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:56,460 INFO  L124   PetriNetUnfolderBase]: 3081/4815 cut-off events.
[2024-06-14 14:59:56,460 INFO  L125   PetriNetUnfolderBase]: For 417508/417516 co-relation queries the response was YES.
[2024-06-14 14:59:56,575 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41611 conditions, 4815 events. 3081/4815 cut-off events. For 417508/417516 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 27102 event pairs, 614 based on Foata normal form. 50/4864 useless extension candidates. Maximal degree in co-relation 41510. Up to 4293 conditions per place. 
[2024-06-14 14:59:56,599 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 285 selfloop transitions, 55 changer transitions 0/344 dead transitions.
[2024-06-14 14:59:56,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 344 transitions, 4721 flow
[2024-06-14 14:59:56,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:59:56,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:59:56,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-14 14:59:56,601 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-14 14:59:56,601 INFO  L175             Difference]: Start difference. First operand has 216 places, 303 transitions, 3666 flow. Second operand 10 states and 189 transitions.
[2024-06-14 14:59:56,601 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 344 transitions, 4721 flow
[2024-06-14 14:59:57,044 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 344 transitions, 4385 flow, removed 72 selfloop flow, removed 8 redundant places.
[2024-06-14 14:59:57,048 INFO  L231             Difference]: Finished difference. Result has 218 places, 305 transitions, 3579 flow
[2024-06-14 14:59:57,048 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3330, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3579, PETRI_PLACES=218, PETRI_TRANSITIONS=305}
[2024-06-14 14:59:57,048 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 175 predicate places.
[2024-06-14 14:59:57,048 INFO  L495      AbstractCegarLoop]: Abstraction has has 218 places, 305 transitions, 3579 flow
[2024-06-14 14:59:57,049 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:57,049 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:57,049 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:57,049 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 14:59:57,049 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:59:57,050 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:57,050 INFO  L85        PathProgramCache]: Analyzing trace with hash -2110262021, now seen corresponding path program 1 times
[2024-06-14 14:59:57,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:57,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233755465]
[2024-06-14 14:59:57,050 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:57,050 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:57,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:11,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:11,205 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:11,206 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233755465]
[2024-06-14 15:00:11,206 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233755465] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:11,206 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:11,206 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:00:11,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091384063]
[2024-06-14 15:00:11,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:11,206 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:00:11,206 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:11,206 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:00:11,206 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:00:11,371 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:00:11,371 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 305 transitions, 3579 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:11,371 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:11,371 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:00:11,371 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:13,280 INFO  L124   PetriNetUnfolderBase]: 3091/4825 cut-off events.
[2024-06-14 15:00:13,280 INFO  L125   PetriNetUnfolderBase]: For 361454/361456 co-relation queries the response was YES.
[2024-06-14 15:00:13,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40650 conditions, 4825 events. 3091/4825 cut-off events. For 361454/361456 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 27089 event pairs, 617 based on Foata normal form. 2/4826 useless extension candidates. Maximal degree in co-relation 40548. Up to 4600 conditions per place. 
[2024-06-14 15:00:13,323 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 279 selfloop transitions, 51 changer transitions 0/334 dead transitions.
[2024-06-14 15:00:13,323 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 334 transitions, 4555 flow
[2024-06-14 15:00:13,323 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:00:13,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:00:13,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-14 15:00:13,324 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-14 15:00:13,324 INFO  L175             Difference]: Start difference. First operand has 218 places, 305 transitions, 3579 flow. Second operand 9 states and 153 transitions.
[2024-06-14 15:00:13,324 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 334 transitions, 4555 flow
[2024-06-14 15:00:13,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 334 transitions, 4362 flow, removed 45 selfloop flow, removed 8 redundant places.
[2024-06-14 15:00:13,730 INFO  L231             Difference]: Finished difference. Result has 220 places, 314 transitions, 3615 flow
[2024-06-14 15:00:13,730 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3388, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3615, PETRI_PLACES=220, PETRI_TRANSITIONS=314}
[2024-06-14 15:00:13,731 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places.
[2024-06-14 15:00:13,731 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 314 transitions, 3615 flow
[2024-06-14 15:00:13,731 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:13,731 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:13,731 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:13,731 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 15:00:13,731 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:00:13,732 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:13,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -2030453773, now seen corresponding path program 7 times
[2024-06-14 15:00:13,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:13,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201652630]
[2024-06-14 15:00:13,732 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:13,732 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:13,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:21,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:21,288 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:21,288 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201652630]
[2024-06-14 15:00:21,288 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201652630] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:21,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:21,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:00:21,289 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772552536]
[2024-06-14 15:00:21,289 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:21,289 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:00:21,289 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:21,289 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:00:21,289 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:00:21,413 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:00:21,413 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 314 transitions, 3615 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:21,413 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:21,413 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:00:21,414 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:23,383 INFO  L124   PetriNetUnfolderBase]: 3137/4906 cut-off events.
[2024-06-14 15:00:23,383 INFO  L125   PetriNetUnfolderBase]: For 375406/375414 co-relation queries the response was YES.
[2024-06-14 15:00:23,409 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41092 conditions, 4906 events. 3137/4906 cut-off events. For 375406/375414 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 27725 event pairs, 612 based on Foata normal form. 14/4919 useless extension candidates. Maximal degree in co-relation 40988. Up to 4481 conditions per place. 
[2024-06-14 15:00:23,438 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 275 selfloop transitions, 73 changer transitions 0/352 dead transitions.
[2024-06-14 15:00:23,439 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 352 transitions, 4801 flow
[2024-06-14 15:00:23,439 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:00:23,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:00:23,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 15:00:23,440 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 15:00:23,440 INFO  L175             Difference]: Start difference. First operand has 220 places, 314 transitions, 3615 flow. Second operand 9 states and 171 transitions.
[2024-06-14 15:00:23,440 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 352 transitions, 4801 flow
[2024-06-14 15:00:23,930 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 352 transitions, 4710 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-14 15:00:23,934 INFO  L231             Difference]: Finished difference. Result has 224 places, 321 transitions, 3861 flow
[2024-06-14 15:00:23,935 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3524, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3861, PETRI_PLACES=224, PETRI_TRANSITIONS=321}
[2024-06-14 15:00:23,935 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 181 predicate places.
[2024-06-14 15:00:23,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 321 transitions, 3861 flow
[2024-06-14 15:00:23,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:23,935 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:23,935 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:23,936 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 15:00:23,936 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:00:23,936 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:23,936 INFO  L85        PathProgramCache]: Analyzing trace with hash -2035816153, now seen corresponding path program 8 times
[2024-06-14 15:00:23,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:23,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209128878]
[2024-06-14 15:00:23,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:23,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:24,001 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:31,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:31,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:31,883 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209128878]
[2024-06-14 15:00:31,883 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209128878] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:31,883 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:31,883 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:00:31,883 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003612012]
[2024-06-14 15:00:31,883 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:31,884 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:00:31,884 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:31,884 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:00:31,884 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:00:32,059 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:00:32,059 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 321 transitions, 3861 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:32,059 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:32,059 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:00:32,060 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:34,223 INFO  L124   PetriNetUnfolderBase]: 3165/4960 cut-off events.
[2024-06-14 15:00:34,223 INFO  L125   PetriNetUnfolderBase]: For 391038/391046 co-relation queries the response was YES.
[2024-06-14 15:00:34,246 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42177 conditions, 4960 events. 3165/4960 cut-off events. For 391038/391046 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 28131 event pairs, 621 based on Foata normal form. 14/4973 useless extension candidates. Maximal degree in co-relation 42072. Up to 4525 conditions per place. 
[2024-06-14 15:00:34,269 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 280 selfloop transitions, 72 changer transitions 0/356 dead transitions.
[2024-06-14 15:00:34,269 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 356 transitions, 5144 flow
[2024-06-14 15:00:34,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:00:34,270 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:00:34,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 15:00:34,270 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 15:00:34,270 INFO  L175             Difference]: Start difference. First operand has 224 places, 321 transitions, 3861 flow. Second operand 9 states and 171 transitions.
[2024-06-14 15:00:34,270 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 356 transitions, 5144 flow
[2024-06-14 15:00:34,694 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 356 transitions, 4860 flow, removed 72 selfloop flow, removed 6 redundant places.
[2024-06-14 15:00:34,698 INFO  L231             Difference]: Finished difference. Result has 227 places, 324 transitions, 3885 flow
[2024-06-14 15:00:34,698 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3577, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3885, PETRI_PLACES=227, PETRI_TRANSITIONS=324}
[2024-06-14 15:00:34,698 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 184 predicate places.
[2024-06-14 15:00:34,699 INFO  L495      AbstractCegarLoop]: Abstraction has has 227 places, 324 transitions, 3885 flow
[2024-06-14 15:00:34,699 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:34,699 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:34,699 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:34,699 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 15:00:34,699 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:00:34,700 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:34,700 INFO  L85        PathProgramCache]: Analyzing trace with hash 1266867055, now seen corresponding path program 9 times
[2024-06-14 15:00:34,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:34,700 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791965878]
[2024-06-14 15:00:34,700 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:34,700 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:34,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:42,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:42,293 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:42,293 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791965878]
[2024-06-14 15:00:42,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791965878] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:42,293 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:42,293 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:00:42,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099440680]
[2024-06-14 15:00:42,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:42,293 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:00:42,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:42,294 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:00:42,294 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:00:42,496 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:00:42,497 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 324 transitions, 3885 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:42,497 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:42,497 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:00:42,497 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:44,363 INFO  L124   PetriNetUnfolderBase]: 3190/4989 cut-off events.
[2024-06-14 15:00:44,363 INFO  L125   PetriNetUnfolderBase]: For 406682/406690 co-relation queries the response was YES.
[2024-06-14 15:00:44,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42671 conditions, 4989 events. 3190/4989 cut-off events. For 406682/406690 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 28288 event pairs, 617 based on Foata normal form. 14/5002 useless extension candidates. Maximal degree in co-relation 42565. Up to 4566 conditions per place. 
[2024-06-14 15:00:44,417 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 270 selfloop transitions, 83 changer transitions 0/357 dead transitions.
[2024-06-14 15:00:44,417 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 357 transitions, 4954 flow
[2024-06-14 15:00:44,418 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:00:44,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:00:44,418 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-14 15:00:44,418 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4470899470899471
[2024-06-14 15:00:44,418 INFO  L175             Difference]: Start difference. First operand has 227 places, 324 transitions, 3885 flow. Second operand 9 states and 169 transitions.
[2024-06-14 15:00:44,418 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 357 transitions, 4954 flow
[2024-06-14 15:00:44,914 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 357 transitions, 4649 flow, removed 78 selfloop flow, removed 8 redundant places.
[2024-06-14 15:00:44,918 INFO  L231             Difference]: Finished difference. Result has 228 places, 327 transitions, 3916 flow
[2024-06-14 15:00:44,918 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3580, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3916, PETRI_PLACES=228, PETRI_TRANSITIONS=327}
[2024-06-14 15:00:44,918 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-14 15:00:44,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 327 transitions, 3916 flow
[2024-06-14 15:00:44,919 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:44,919 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:44,919 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:44,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 15:00:44,919 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:00:44,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:44,920 INFO  L85        PathProgramCache]: Analyzing trace with hash -1508611549, now seen corresponding path program 10 times
[2024-06-14 15:00:44,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:44,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363530770]
[2024-06-14 15:00:44,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:44,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:44,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:52,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:52,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:52,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363530770]
[2024-06-14 15:00:52,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363530770] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:52,479 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:52,479 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:00:52,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065688887]
[2024-06-14 15:00:52,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:52,480 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:00:52,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:52,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:00:52,483 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:00:52,758 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:00:52,759 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 327 transitions, 3916 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:52,759 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:52,759 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:00:52,759 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:54,837 INFO  L124   PetriNetUnfolderBase]: 3244/5071 cut-off events.
[2024-06-14 15:00:54,838 INFO  L125   PetriNetUnfolderBase]: For 432070/432078 co-relation queries the response was YES.
[2024-06-14 15:00:54,862 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43965 conditions, 5071 events. 3244/5071 cut-off events. For 432070/432078 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 28780 event pairs, 625 based on Foata normal form. 14/5084 useless extension candidates. Maximal degree in co-relation 43860. Up to 4504 conditions per place. 
[2024-06-14 15:00:54,888 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 284 selfloop transitions, 79 changer transitions 0/367 dead transitions.
[2024-06-14 15:00:54,889 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 367 transitions, 5473 flow
[2024-06-14 15:00:54,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:00:54,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:00:54,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-14 15:00:54,890 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4576719576719577
[2024-06-14 15:00:54,890 INFO  L175             Difference]: Start difference. First operand has 228 places, 327 transitions, 3916 flow. Second operand 9 states and 173 transitions.
[2024-06-14 15:00:54,890 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 367 transitions, 5473 flow
[2024-06-14 15:00:55,377 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 367 transitions, 5161 flow, removed 75 selfloop flow, removed 7 redundant places.
[2024-06-14 15:00:55,382 INFO  L231             Difference]: Finished difference. Result has 231 places, 333 transitions, 4067 flow
[2024-06-14 15:00:55,382 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3604, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4067, PETRI_PLACES=231, PETRI_TRANSITIONS=333}
[2024-06-14 15:00:55,383 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places.
[2024-06-14 15:00:55,383 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 333 transitions, 4067 flow
[2024-06-14 15:00:55,383 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:55,383 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:55,383 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:55,383 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 15:00:55,383 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:00:55,386 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:55,386 INFO  L85        PathProgramCache]: Analyzing trace with hash -1503095347, now seen corresponding path program 6 times
[2024-06-14 15:00:55,386 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:55,386 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373081818]
[2024-06-14 15:00:55,386 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:55,386 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:55,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:05,217 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:05,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:05,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373081818]
[2024-06-14 15:01:05,218 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373081818] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:05,218 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:05,218 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:05,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090904507]
[2024-06-14 15:01:05,219 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:05,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:05,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:05,223 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:05,223 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:05,477 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:01:05,477 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 333 transitions, 4067 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:05,477 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:05,477 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:01:05,478 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:07,899 INFO  L124   PetriNetUnfolderBase]: 3358/5250 cut-off events.
[2024-06-14 15:01:07,899 INFO  L125   PetriNetUnfolderBase]: For 489724/489726 co-relation queries the response was YES.
[2024-06-14 15:01:07,926 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46298 conditions, 5250 events. 3358/5250 cut-off events. For 489724/489726 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 30047 event pairs, 667 based on Foata normal form. 24/5273 useless extension candidates. Maximal degree in co-relation 46191. Up to 4547 conditions per place. 
[2024-06-14 15:01:07,952 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 264 selfloop transitions, 107 changer transitions 0/375 dead transitions.
[2024-06-14 15:01:07,953 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 375 transitions, 5347 flow
[2024-06-14 15:01:07,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:01:07,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:01:07,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions.
[2024-06-14 15:01:07,955 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45714285714285713
[2024-06-14 15:01:07,955 INFO  L175             Difference]: Start difference. First operand has 231 places, 333 transitions, 4067 flow. Second operand 10 states and 192 transitions.
[2024-06-14 15:01:07,955 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 375 transitions, 5347 flow
[2024-06-14 15:01:08,498 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 375 transitions, 5065 flow, removed 99 selfloop flow, removed 5 redundant places.
[2024-06-14 15:01:08,504 INFO  L231             Difference]: Finished difference. Result has 237 places, 339 transitions, 4199 flow
[2024-06-14 15:01:08,505 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3785, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4199, PETRI_PLACES=237, PETRI_TRANSITIONS=339}
[2024-06-14 15:01:08,506 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 194 predicate places.
[2024-06-14 15:01:08,506 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 339 transitions, 4199 flow
[2024-06-14 15:01:08,506 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:08,506 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:08,506 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:08,506 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 15:01:08,507 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:01:08,507 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:08,507 INFO  L85        PathProgramCache]: Analyzing trace with hash -2035810201, now seen corresponding path program 7 times
[2024-06-14 15:01:08,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:08,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106196507]
[2024-06-14 15:01:08,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:08,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:08,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:18,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:18,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:18,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106196507]
[2024-06-14 15:01:18,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106196507] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:18,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:18,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:18,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178895321]
[2024-06-14 15:01:18,403 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:18,403 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:18,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:18,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:18,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:18,678 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:01:18,678 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 339 transitions, 4199 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:18,679 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:18,679 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:01:18,679 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:21,794 INFO  L124   PetriNetUnfolderBase]: 3454/5427 cut-off events.
[2024-06-14 15:01:21,794 INFO  L125   PetriNetUnfolderBase]: For 515586/515594 co-relation queries the response was YES.
[2024-06-14 15:01:21,844 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48426 conditions, 5427 events. 3454/5427 cut-off events. For 515586/515594 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 31520 event pairs, 676 based on Foata normal form. 32/5458 useless extension candidates. Maximal degree in co-relation 48316. Up to 4869 conditions per place. 
[2024-06-14 15:01:21,887 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 301 selfloop transitions, 75 changer transitions 0/380 dead transitions.
[2024-06-14 15:01:21,887 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 380 transitions, 5600 flow
[2024-06-14 15:01:21,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:01:21,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:01:21,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-14 15:01:21,889 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 15:01:21,889 INFO  L175             Difference]: Start difference. First operand has 237 places, 339 transitions, 4199 flow. Second operand 10 states and 190 transitions.
[2024-06-14 15:01:21,889 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 380 transitions, 5600 flow
[2024-06-14 15:01:22,647 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 380 transitions, 5292 flow, removed 53 selfloop flow, removed 7 redundant places.
[2024-06-14 15:01:22,654 INFO  L231             Difference]: Finished difference. Result has 240 places, 341 transitions, 4199 flow
[2024-06-14 15:01:22,655 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3891, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4199, PETRI_PLACES=240, PETRI_TRANSITIONS=341}
[2024-06-14 15:01:22,655 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places.
[2024-06-14 15:01:22,655 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 341 transitions, 4199 flow
[2024-06-14 15:01:22,656 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:22,656 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:22,656 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:22,656 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 15:01:22,656 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:01:22,656 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:22,657 INFO  L85        PathProgramCache]: Analyzing trace with hash -2030238571, now seen corresponding path program 8 times
[2024-06-14 15:01:22,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:22,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895432097]
[2024-06-14 15:01:22,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:22,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:22,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:32,049 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:32,049 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:32,049 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895432097]
[2024-06-14 15:01:32,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895432097] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:32,050 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:32,050 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:01:32,050 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034334828]
[2024-06-14 15:01:32,050 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:32,050 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:01:32,050 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:32,051 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:01:32,051 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:01:32,355 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 15:01:32,356 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 341 transitions, 4199 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:32,356 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:32,356 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 15:01:32,356 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:34,820 INFO  L124   PetriNetUnfolderBase]: 3722/5877 cut-off events.
[2024-06-14 15:01:34,821 INFO  L125   PetriNetUnfolderBase]: For 593277/593285 co-relation queries the response was YES.
[2024-06-14 15:01:34,851 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53762 conditions, 5877 events. 3722/5877 cut-off events. For 593277/593285 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 34915 event pairs, 721 based on Foata normal form. 26/5902 useless extension candidates. Maximal degree in co-relation 53651. Up to 4830 conditions per place. 
[2024-06-14 15:01:34,882 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 291 selfloop transitions, 95 changer transitions 0/390 dead transitions.
[2024-06-14 15:01:34,883 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 390 transitions, 5960 flow
[2024-06-14 15:01:34,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:01:34,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:01:34,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions.
[2024-06-14 15:01:34,884 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4880952380952381
[2024-06-14 15:01:34,884 INFO  L175             Difference]: Start difference. First operand has 240 places, 341 transitions, 4199 flow. Second operand 10 states and 205 transitions.
[2024-06-14 15:01:34,884 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 390 transitions, 5960 flow
[2024-06-14 15:01:35,454 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 390 transitions, 5670 flow, removed 62 selfloop flow, removed 10 redundant places.
[2024-06-14 15:01:35,459 INFO  L231             Difference]: Finished difference. Result has 241 places, 347 transitions, 4476 flow
[2024-06-14 15:01:35,459 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3909, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4476, PETRI_PLACES=241, PETRI_TRANSITIONS=347}
[2024-06-14 15:01:35,460 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 198 predicate places.
[2024-06-14 15:01:35,460 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 347 transitions, 4476 flow
[2024-06-14 15:01:35,460 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:35,460 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:35,460 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:35,460 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 15:01:35,461 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:01:35,461 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:35,461 INFO  L85        PathProgramCache]: Analyzing trace with hash -2030246011, now seen corresponding path program 9 times
[2024-06-14 15:01:35,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:35,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127537354]
[2024-06-14 15:01:35,461 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:35,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:35,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:46,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:46,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:46,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127537354]
[2024-06-14 15:01:46,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127537354] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:46,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:46,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:46,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482684057]
[2024-06-14 15:01:46,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:46,568 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:46,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:46,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:46,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:46,770 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:01:46,771 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 347 transitions, 4476 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:46,771 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:46,771 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:01:46,771 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:49,165 INFO  L124   PetriNetUnfolderBase]: 3686/5835 cut-off events.
[2024-06-14 15:01:49,166 INFO  L125   PetriNetUnfolderBase]: For 561760/561768 co-relation queries the response was YES.
[2024-06-14 15:01:49,196 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51446 conditions, 5835 events. 3686/5835 cut-off events. For 561760/561768 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 34799 event pairs, 726 based on Foata normal form. 32/5866 useless extension candidates. Maximal degree in co-relation 51335. Up to 5196 conditions per place. 
[2024-06-14 15:01:49,225 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 294 selfloop transitions, 91 changer transitions 0/389 dead transitions.
[2024-06-14 15:01:49,225 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 389 transitions, 5649 flow
[2024-06-14 15:01:49,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:01:49,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:01:49,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions.
[2024-06-14 15:01:49,226 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 15:01:49,226 INFO  L175             Difference]: Start difference. First operand has 241 places, 347 transitions, 4476 flow. Second operand 11 states and 209 transitions.
[2024-06-14 15:01:49,226 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 389 transitions, 5649 flow
[2024-06-14 15:01:49,902 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 389 transitions, 5311 flow, removed 115 selfloop flow, removed 6 redundant places.
[2024-06-14 15:01:49,907 INFO  L231             Difference]: Finished difference. Result has 246 places, 347 transitions, 4332 flow
[2024-06-14 15:01:49,923 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4138, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4332, PETRI_PLACES=246, PETRI_TRANSITIONS=347}
[2024-06-14 15:01:49,923 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places.
[2024-06-14 15:01:49,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 347 transitions, 4332 flow
[2024-06-14 15:01:49,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:49,924 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:49,924 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:49,924 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 15:01:49,924 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:01:49,924 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:49,924 INFO  L85        PathProgramCache]: Analyzing trace with hash -1829149321, now seen corresponding path program 10 times
[2024-06-14 15:01:49,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:49,925 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554948245]
[2024-06-14 15:01:49,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:49,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:49,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:58,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-14 15:01:58,073 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:58,073 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554948245]
[2024-06-14 15:01:58,073 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554948245] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:58,073 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:58,073 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:01:58,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649245395]
[2024-06-14 15:01:58,074 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:58,074 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:01:58,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:58,074 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:01:58,074 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:01:58,310 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 15:01:58,311 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 347 transitions, 4332 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:58,311 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:58,311 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 15:01:58,311 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:00,916 INFO  L124   PetriNetUnfolderBase]: 3879/6157 cut-off events.
[2024-06-14 15:02:00,924 INFO  L125   PetriNetUnfolderBase]: For 599936/599938 co-relation queries the response was YES.
[2024-06-14 15:02:00,964 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55468 conditions, 6157 events. 3879/6157 cut-off events. For 599936/599938 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 37311 event pairs, 790 based on Foata normal form. 18/6174 useless extension candidates. Maximal degree in co-relation 55355. Up to 5113 conditions per place. 
[2024-06-14 15:02:01,000 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 214 selfloop transitions, 173 changer transitions 0/391 dead transitions.
[2024-06-14 15:02:01,001 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 391 transitions, 5934 flow
[2024-06-14 15:02:01,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:02:01,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:02:01,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 206 transitions.
[2024-06-14 15:02:01,002 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49047619047619045
[2024-06-14 15:02:01,002 INFO  L175             Difference]: Start difference. First operand has 246 places, 347 transitions, 4332 flow. Second operand 10 states and 206 transitions.
[2024-06-14 15:02:01,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 391 transitions, 5934 flow
[2024-06-14 15:02:01,722 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 391 transitions, 5752 flow, removed 4 selfloop flow, removed 9 redundant places.
[2024-06-14 15:02:01,727 INFO  L231             Difference]: Finished difference. Result has 247 places, 351 transitions, 4815 flow
[2024-06-14 15:02:01,728 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4150, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4815, PETRI_PLACES=247, PETRI_TRANSITIONS=351}
[2024-06-14 15:02:01,729 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 204 predicate places.
[2024-06-14 15:02:01,729 INFO  L495      AbstractCegarLoop]: Abstraction has has 247 places, 351 transitions, 4815 flow
[2024-06-14 15:02:01,729 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:01,729 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:01,729 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:01,730 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-14 15:02:01,730 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-14 15:02:01,730 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:01,731 INFO  L85        PathProgramCache]: Analyzing trace with hash 996222853, now seen corresponding path program 11 times
[2024-06-14 15:02:01,731 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:01,731 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078797967]
[2024-06-14 15:02:01,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:01,732 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:01,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:11,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-14 15:02:11,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:11,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078797967]
[2024-06-14 15:02:11,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078797967] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:11,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:11,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:11,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401710111]
[2024-06-14 15:02:11,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:11,483 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:11,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:11,484 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:11,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:11,793 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:02:11,794 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 351 transitions, 4815 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:11,794 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:11,794 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:02:11,794 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:14,220 INFO  L124   PetriNetUnfolderBase]: 3833/6087 cut-off events.
[2024-06-14 15:02:14,221 INFO  L125   PetriNetUnfolderBase]: For 575751/575753 co-relation queries the response was YES.
[2024-06-14 15:02:14,261 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53821 conditions, 6087 events. 3833/6087 cut-off events. For 575751/575753 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 36874 event pairs, 793 based on Foata normal form. 24/6110 useless extension candidates. Maximal degree in co-relation 53707. Up to 5214 conditions per place. 
[2024-06-14 15:02:14,294 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 213 selfloop transitions, 169 changer transitions 0/386 dead transitions.
[2024-06-14 15:02:14,294 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 386 transitions, 5837 flow
[2024-06-14 15:02:14,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:02:14,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:02:14,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions.
[2024-06-14 15:02:14,296 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45476190476190476
[2024-06-14 15:02:14,296 INFO  L175             Difference]: Start difference. First operand has 247 places, 351 transitions, 4815 flow. Second operand 10 states and 191 transitions.
[2024-06-14 15:02:14,296 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 386 transitions, 5837 flow
[2024-06-14 15:02:14,931 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 386 transitions, 5379 flow, removed 120 selfloop flow, removed 6 redundant places.
[2024-06-14 15:02:14,936 INFO  L231             Difference]: Finished difference. Result has 251 places, 351 transitions, 4703 flow
[2024-06-14 15:02:14,936 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4357, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4703, PETRI_PLACES=251, PETRI_TRANSITIONS=351}
[2024-06-14 15:02:14,937 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 208 predicate places.
[2024-06-14 15:02:14,938 INFO  L495      AbstractCegarLoop]: Abstraction has has 251 places, 351 transitions, 4703 flow
[2024-06-14 15:02:14,938 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:14,938 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:14,938 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:14,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-14 15:02:14,938 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-14 15:02:14,939 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:14,939 INFO  L85        PathProgramCache]: Analyzing trace with hash 1005427063, now seen corresponding path program 12 times
[2024-06-14 15:02:14,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:14,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739977293]
[2024-06-14 15:02:14,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:14,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:15,068 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:22,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:22,841 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:22,841 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739977293]
[2024-06-14 15:02:22,841 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739977293] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:22,842 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:22,842 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:22,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854036251]
[2024-06-14 15:02:22,842 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:22,842 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:22,842 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:22,843 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:22,843 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:23,129 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:02:23,129 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 351 transitions, 4703 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:23,129 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:23,129 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:02:23,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:25,488 INFO  L124   PetriNetUnfolderBase]: 4001/6367 cut-off events.
[2024-06-14 15:02:25,488 INFO  L125   PetriNetUnfolderBase]: For 617482/617484 co-relation queries the response was YES.
[2024-06-14 15:02:25,524 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57578 conditions, 6367 events. 4001/6367 cut-off events. For 617482/617484 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 38745 event pairs, 763 based on Foata normal form. 18/6384 useless extension candidates. Maximal degree in co-relation 57462. Up to 3787 conditions per place. 
[2024-06-14 15:02:25,555 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 187 selfloop transitions, 205 changer transitions 0/396 dead transitions.
[2024-06-14 15:02:25,555 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 396 transitions, 6337 flow
[2024-06-14 15:02:25,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:02:25,555 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:02:25,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions.
[2024-06-14 15:02:25,556 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4666666666666667
[2024-06-14 15:02:25,556 INFO  L175             Difference]: Start difference. First operand has 251 places, 351 transitions, 4703 flow. Second operand 10 states and 196 transitions.
[2024-06-14 15:02:25,556 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 396 transitions, 6337 flow
[2024-06-14 15:02:26,181 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 396 transitions, 5991 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-14 15:02:26,185 INFO  L231             Difference]: Finished difference. Result has 252 places, 355 transitions, 5094 flow
[2024-06-14 15:02:26,186 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4357, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5094, PETRI_PLACES=252, PETRI_TRANSITIONS=355}
[2024-06-14 15:02:26,186 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 209 predicate places.
[2024-06-14 15:02:26,186 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 355 transitions, 5094 flow
[2024-06-14 15:02:26,187 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:26,187 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:26,187 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:26,187 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-14 15:02:26,187 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:02:26,187 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:26,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 739520533, now seen corresponding path program 13 times
[2024-06-14 15:02:26,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:26,188 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186231655]
[2024-06-14 15:02:26,188 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:26,188 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:26,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:35,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:35,350 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:35,350 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186231655]
[2024-06-14 15:02:35,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186231655] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:35,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:35,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:35,350 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713698345]
[2024-06-14 15:02:35,350 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:35,350 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:35,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:35,351 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:35,351 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:35,511 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:02:35,511 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 355 transitions, 5094 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:35,511 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:35,512 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:02:35,512 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:38,235 INFO  L124   PetriNetUnfolderBase]: 4148/6612 cut-off events.
[2024-06-14 15:02:38,235 INFO  L125   PetriNetUnfolderBase]: For 724198/724200 co-relation queries the response was YES.
[2024-06-14 15:02:38,275 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61429 conditions, 6612 events. 4148/6612 cut-off events. For 724198/724200 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 41120 event pairs, 880 based on Foata normal form. 42/6653 useless extension candidates. Maximal degree in co-relation 61312. Up to 5803 conditions per place. 
[2024-06-14 15:02:38,324 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 268 selfloop transitions, 122 changer transitions 0/394 dead transitions.
[2024-06-14 15:02:38,325 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 394 transitions, 6460 flow
[2024-06-14 15:02:38,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:02:38,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:02:38,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-14 15:02:38,326 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 15:02:38,326 INFO  L175             Difference]: Start difference. First operand has 252 places, 355 transitions, 5094 flow. Second operand 10 states and 190 transitions.
[2024-06-14 15:02:38,326 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 394 transitions, 6460 flow
[2024-06-14 15:02:39,507 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 394 transitions, 6074 flow, removed 83 selfloop flow, removed 6 redundant places.
[2024-06-14 15:02:39,515 INFO  L231             Difference]: Finished difference. Result has 256 places, 359 transitions, 5297 flow
[2024-06-14 15:02:39,515 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4726, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5297, PETRI_PLACES=256, PETRI_TRANSITIONS=359}
[2024-06-14 15:02:39,516 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places.
[2024-06-14 15:02:39,516 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 359 transitions, 5297 flow
[2024-06-14 15:02:39,516 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:39,516 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:39,516 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:39,517 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-14 15:02:39,517 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:02:39,517 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:39,517 INFO  L85        PathProgramCache]: Analyzing trace with hash -1836306601, now seen corresponding path program 14 times
[2024-06-14 15:02:39,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:39,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968675611]
[2024-06-14 15:02:39,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:39,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:39,642 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:50,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:50,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:50,957 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968675611]
[2024-06-14 15:02:50,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968675611] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:50,957 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:50,957 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:50,957 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179522518]
[2024-06-14 15:02:50,957 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:50,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:50,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:50,958 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:50,958 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:51,220 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:02:51,220 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 359 transitions, 5297 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:51,220 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:51,220 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:02:51,221 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:54,570 INFO  L124   PetriNetUnfolderBase]: 4196/6717 cut-off events.
[2024-06-14 15:02:54,570 INFO  L125   PetriNetUnfolderBase]: For 694364/694372 co-relation queries the response was YES.
[2024-06-14 15:02:54,626 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61693 conditions, 6717 events. 4196/6717 cut-off events. For 694364/694372 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 42061 event pairs, 873 based on Foata normal form. 32/6748 useless extension candidates. Maximal degree in co-relation 61574. Up to 6076 conditions per place. 
[2024-06-14 15:02:54,671 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 301 selfloop transitions, 97 changer transitions 0/402 dead transitions.
[2024-06-14 15:02:54,671 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 402 transitions, 6538 flow
[2024-06-14 15:02:54,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:02:54,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:02:54,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions.
[2024-06-14 15:02:54,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44805194805194803
[2024-06-14 15:02:54,677 INFO  L175             Difference]: Start difference. First operand has 256 places, 359 transitions, 5297 flow. Second operand 11 states and 207 transitions.
[2024-06-14 15:02:54,677 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 402 transitions, 6538 flow
[2024-06-14 15:02:55,724 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 402 transitions, 6071 flow, removed 111 selfloop flow, removed 9 redundant places.
[2024-06-14 15:02:55,731 INFO  L231             Difference]: Finished difference. Result has 258 places, 361 transitions, 5196 flow
[2024-06-14 15:02:55,731 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4830, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5196, PETRI_PLACES=258, PETRI_TRANSITIONS=361}
[2024-06-14 15:02:55,732 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 215 predicate places.
[2024-06-14 15:02:55,732 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 361 transitions, 5196 flow
[2024-06-14 15:02:55,732 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:55,732 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:55,732 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:55,733 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-14 15:02:55,733 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:02:55,733 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:55,733 INFO  L85        PathProgramCache]: Analyzing trace with hash 1267082257, now seen corresponding path program 15 times
[2024-06-14 15:02:55,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:55,733 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989674287]
[2024-06-14 15:02:55,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:55,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:55,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:04,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:04,838 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:04,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989674287]
[2024-06-14 15:03:04,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989674287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:04,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:04,839 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:03:04,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522817649]
[2024-06-14 15:03:04,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:04,839 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:03:04,839 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:04,839 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:03:04,840 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:03:05,130 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 15:03:05,131 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 361 transitions, 5196 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:05,131 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:05,131 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 15:03:05,131 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:07,647 INFO  L124   PetriNetUnfolderBase]: 4163/6666 cut-off events.
[2024-06-14 15:03:07,647 INFO  L125   PetriNetUnfolderBase]: For 638733/638741 co-relation queries the response was YES.
[2024-06-14 15:03:07,688 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58593 conditions, 6666 events. 4163/6666 cut-off events. For 638733/638741 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 41686 event pairs, 832 based on Foata normal form. 26/6691 useless extension candidates. Maximal degree in co-relation 58474. Up to 5808 conditions per place. 
[2024-06-14 15:03:07,720 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 298 selfloop transitions, 99 changer transitions 0/401 dead transitions.
[2024-06-14 15:03:07,720 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 401 transitions, 6297 flow
[2024-06-14 15:03:07,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:03:07,721 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:03:07,721 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-14 15:03:07,721 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48095238095238096
[2024-06-14 15:03:07,721 INFO  L175             Difference]: Start difference. First operand has 258 places, 361 transitions, 5196 flow. Second operand 10 states and 202 transitions.
[2024-06-14 15:03:07,721 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 401 transitions, 6297 flow
[2024-06-14 15:03:08,598 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 401 transitions, 5935 flow, removed 88 selfloop flow, removed 9 redundant places.
[2024-06-14 15:03:08,603 INFO  L231             Difference]: Finished difference. Result has 259 places, 361 transitions, 5039 flow
[2024-06-14 15:03:08,604 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4834, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5039, PETRI_PLACES=259, PETRI_TRANSITIONS=361}
[2024-06-14 15:03:08,604 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 216 predicate places.
[2024-06-14 15:03:08,604 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 361 transitions, 5039 flow
[2024-06-14 15:03:08,605 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:08,605 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:08,605 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:08,605 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-14 15:03:08,605 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:03:08,605 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:08,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345663351, now seen corresponding path program 2 times
[2024-06-14 15:03:08,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:08,606 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149658469]
[2024-06-14 15:03:08,606 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:08,606 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:08,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:17,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:17,825 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:17,825 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149658469]
[2024-06-14 15:03:17,825 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149658469] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:17,826 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:17,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:03:17,826 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830851493]
[2024-06-14 15:03:17,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:17,826 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:03:17,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:17,826 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:03:17,827 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:03:18,033 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:03:18,034 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 361 transitions, 5039 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:18,034 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:18,034 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:03:18,034 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:20,388 INFO  L124   PetriNetUnfolderBase]: 4173/6673 cut-off events.
[2024-06-14 15:03:20,388 INFO  L125   PetriNetUnfolderBase]: For 582288/582290 co-relation queries the response was YES.
[2024-06-14 15:03:20,422 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57708 conditions, 6673 events. 4173/6673 cut-off events. For 582288/582290 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 41684 event pairs, 865 based on Foata normal form. 2/6674 useless extension candidates. Maximal degree in co-relation 57588. Up to 6382 conditions per place. 
[2024-06-14 15:03:20,452 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 318 selfloop transitions, 54 changer transitions 0/376 dead transitions.
[2024-06-14 15:03:20,452 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 376 transitions, 6039 flow
[2024-06-14 15:03:20,453 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:03:20,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:03:20,453 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-14 15:03:20,453 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41496598639455784
[2024-06-14 15:03:20,453 INFO  L175             Difference]: Start difference. First operand has 259 places, 361 transitions, 5039 flow. Second operand 7 states and 122 transitions.
[2024-06-14 15:03:20,453 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 376 transitions, 6039 flow
[2024-06-14 15:03:21,366 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 376 transitions, 5544 flow, removed 34 selfloop flow, removed 10 redundant places.
[2024-06-14 15:03:21,371 INFO  L231             Difference]: Finished difference. Result has 256 places, 364 transitions, 4704 flow
[2024-06-14 15:03:21,371 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4544, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4704, PETRI_PLACES=256, PETRI_TRANSITIONS=364}
[2024-06-14 15:03:21,371 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places.
[2024-06-14 15:03:21,372 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 364 transitions, 4704 flow
[2024-06-14 15:03:21,372 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:21,372 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:21,372 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:21,372 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-14 15:03:21,372 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:03:21,372 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:21,373 INFO  L85        PathProgramCache]: Analyzing trace with hash 818840671, now seen corresponding path program 3 times
[2024-06-14 15:03:21,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:21,373 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434262163]
[2024-06-14 15:03:21,373 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:21,373 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:21,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:34,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:34,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:34,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434262163]
[2024-06-14 15:03:34,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434262163] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:34,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:34,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:03:34,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382626799]
[2024-06-14 15:03:34,479 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:34,479 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:03:34,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:34,479 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:03:34,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:03:34,681 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:03:34,682 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 364 transitions, 4704 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:34,682 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:34,682 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:03:34,682 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:36,893 INFO  L124   PetriNetUnfolderBase]: 4167/6665 cut-off events.
[2024-06-14 15:03:36,894 INFO  L125   PetriNetUnfolderBase]: For 582118/582120 co-relation queries the response was YES.
[2024-06-14 15:03:36,945 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55911 conditions, 6665 events. 4167/6665 cut-off events. For 582118/582120 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 41608 event pairs, 865 based on Foata normal form. 2/6666 useless extension candidates. Maximal degree in co-relation 55792. Up to 6377 conditions per place. 
[2024-06-14 15:03:36,982 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 325 selfloop transitions, 48 changer transitions 0/377 dead transitions.
[2024-06-14 15:03:36,982 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 377 transitions, 5563 flow
[2024-06-14 15:03:36,983 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:03:36,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:03:36,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-14 15:03:36,984 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41496598639455784
[2024-06-14 15:03:36,984 INFO  L175             Difference]: Start difference. First operand has 256 places, 364 transitions, 4704 flow. Second operand 7 states and 122 transitions.
[2024-06-14 15:03:36,984 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 377 transitions, 5563 flow
[2024-06-14 15:03:37,935 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 377 transitions, 5401 flow, removed 26 selfloop flow, removed 5 redundant places.
[2024-06-14 15:03:37,940 INFO  L231             Difference]: Finished difference. Result has 258 places, 364 transitions, 4646 flow
[2024-06-14 15:03:37,940 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4543, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4646, PETRI_PLACES=258, PETRI_TRANSITIONS=364}
[2024-06-14 15:03:37,941 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 215 predicate places.
[2024-06-14 15:03:37,941 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 364 transitions, 4646 flow
[2024-06-14 15:03:37,941 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:37,941 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:37,941 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:37,941 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-14 15:03:37,941 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:03:37,942 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:37,942 INFO  L85        PathProgramCache]: Analyzing trace with hash -49079115, now seen corresponding path program 11 times
[2024-06-14 15:03:37,942 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:37,942 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096349869]
[2024-06-14 15:03:37,942 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:37,942 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:37,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:47,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:47,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:47,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096349869]
[2024-06-14 15:03:47,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096349869] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:47,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:47,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:03:47,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310058636]
[2024-06-14 15:03:47,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:47,116 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:03:47,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:47,116 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:03:47,117 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:03:47,384 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:03:47,384 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 364 transitions, 4646 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:47,384 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:47,384 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:03:47,384 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:50,569 INFO  L124   PetriNetUnfolderBase]: 4482/7165 cut-off events.
[2024-06-14 15:03:50,569 INFO  L125   PetriNetUnfolderBase]: For 703660/703666 co-relation queries the response was YES.
[2024-06-14 15:03:50,610 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62185 conditions, 7165 events. 4482/7165 cut-off events. For 703660/703666 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 45298 event pairs, 857 based on Foata normal form. 30/7194 useless extension candidates. Maximal degree in co-relation 62066. Up to 6510 conditions per place. 
[2024-06-14 15:03:50,649 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 370 selfloop transitions, 71 changer transitions 0/445 dead transitions.
[2024-06-14 15:03:50,650 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 445 transitions, 6697 flow
[2024-06-14 15:03:50,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:03:50,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:03:50,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions.
[2024-06-14 15:03:50,651 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46190476190476193
[2024-06-14 15:03:50,651 INFO  L175             Difference]: Start difference. First operand has 258 places, 364 transitions, 4646 flow. Second operand 10 states and 194 transitions.
[2024-06-14 15:03:50,651 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 445 transitions, 6697 flow
[2024-06-14 15:03:51,420 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 445 transitions, 6575 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-06-14 15:03:51,426 INFO  L231             Difference]: Finished difference. Result has 265 places, 393 transitions, 5414 flow
[2024-06-14 15:03:51,426 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4544, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5414, PETRI_PLACES=265, PETRI_TRANSITIONS=393}
[2024-06-14 15:03:51,426 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 222 predicate places.
[2024-06-14 15:03:51,427 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 393 transitions, 5414 flow
[2024-06-14 15:03:51,427 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:51,427 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:51,427 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:51,427 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-14 15:03:51,427 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:03:51,428 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:51,428 INFO  L85        PathProgramCache]: Analyzing trace with hash -1935485837, now seen corresponding path program 12 times
[2024-06-14 15:03:51,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:51,428 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424439374]
[2024-06-14 15:03:51,428 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:51,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:51,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:58,955 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:58,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:58,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424439374]
[2024-06-14 15:03:58,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424439374] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:58,956 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:58,956 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:03:58,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364124696]
[2024-06-14 15:03:58,956 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:58,956 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:03:58,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:58,957 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:03:58,957 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:03:59,103 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:03:59,103 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 393 transitions, 5414 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:59,104 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:59,104 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:03:59,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:02,046 INFO  L124   PetriNetUnfolderBase]: 4762/7600 cut-off events.
[2024-06-14 15:04:02,046 INFO  L125   PetriNetUnfolderBase]: For 759575/759577 co-relation queries the response was YES.
[2024-06-14 15:04:02,090 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 69028 conditions, 7600 events. 4762/7600 cut-off events. For 759575/759577 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 48494 event pairs, 1085 based on Foata normal form. 8/7607 useless extension candidates. Maximal degree in co-relation 68905. Up to 7049 conditions per place. 
[2024-06-14 15:04:02,126 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 396 selfloop transitions, 71 changer transitions 0/471 dead transitions.
[2024-06-14 15:04:02,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 471 transitions, 7867 flow
[2024-06-14 15:04:02,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:04:02,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:04:02,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-14 15:04:02,128 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-14 15:04:02,128 INFO  L175             Difference]: Start difference. First operand has 265 places, 393 transitions, 5414 flow. Second operand 10 states and 188 transitions.
[2024-06-14 15:04:02,128 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 471 transitions, 7867 flow
[2024-06-14 15:04:03,073 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 471 transitions, 7520 flow, removed 138 selfloop flow, removed 4 redundant places.
[2024-06-14 15:04:03,079 INFO  L231             Difference]: Finished difference. Result has 274 places, 429 transitions, 6429 flow
[2024-06-14 15:04:03,079 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5216, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6429, PETRI_PLACES=274, PETRI_TRANSITIONS=429}
[2024-06-14 15:04:03,079 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 231 predicate places.
[2024-06-14 15:04:03,080 INFO  L495      AbstractCegarLoop]: Abstraction has has 274 places, 429 transitions, 6429 flow
[2024-06-14 15:04:03,080 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:03,080 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:03,080 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:03,080 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-14 15:04:03,080 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:04:03,080 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:03,081 INFO  L85        PathProgramCache]: Analyzing trace with hash -1276983627, now seen corresponding path program 13 times
[2024-06-14 15:04:03,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:03,081 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749426289]
[2024-06-14 15:04:03,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:03,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:03,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:12,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:12,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:12,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749426289]
[2024-06-14 15:04:12,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749426289] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:12,451 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:12,451 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:04:12,451 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270760980]
[2024-06-14 15:04:12,451 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:12,451 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:04:12,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:12,452 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:04:12,452 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:04:12,651 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:04:12,651 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 429 transitions, 6429 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:12,651 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:12,652 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:04:12,652 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:15,681 INFO  L124   PetriNetUnfolderBase]: 5024/7995 cut-off events.
[2024-06-14 15:04:15,681 INFO  L125   PetriNetUnfolderBase]: For 808474/808476 co-relation queries the response was YES.
[2024-06-14 15:04:15,741 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72885 conditions, 7995 events. 5024/7995 cut-off events. For 808474/808476 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 51274 event pairs, 1129 based on Foata normal form. 8/8002 useless extension candidates. Maximal degree in co-relation 72757. Up to 7446 conditions per place. 
[2024-06-14 15:04:15,783 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 408 selfloop transitions, 95 changer transitions 0/507 dead transitions.
[2024-06-14 15:04:15,783 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 507 transitions, 8518 flow
[2024-06-14 15:04:15,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:04:15,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:04:15,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-14 15:04:15,784 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 15:04:15,784 INFO  L175             Difference]: Start difference. First operand has 274 places, 429 transitions, 6429 flow. Second operand 10 states and 190 transitions.
[2024-06-14 15:04:15,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 507 transitions, 8518 flow
[2024-06-14 15:04:17,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 507 transitions, 8176 flow, removed 156 selfloop flow, removed 3 redundant places.
[2024-06-14 15:04:17,229 INFO  L231             Difference]: Finished difference. Result has 283 places, 461 transitions, 7005 flow
[2024-06-14 15:04:17,229 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6087, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7005, PETRI_PLACES=283, PETRI_TRANSITIONS=461}
[2024-06-14 15:04:17,230 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 240 predicate places.
[2024-06-14 15:04:17,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 283 places, 461 transitions, 7005 flow
[2024-06-14 15:04:17,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:17,230 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:17,230 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:17,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-14 15:04:17,230 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:04:17,231 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:17,232 INFO  L85        PathProgramCache]: Analyzing trace with hash -605000365, now seen corresponding path program 14 times
[2024-06-14 15:04:17,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:17,232 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636940595]
[2024-06-14 15:04:17,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:17,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:17,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:25,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:25,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:25,346 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636940595]
[2024-06-14 15:04:25,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636940595] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:25,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:25,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:04:25,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18909168]
[2024-06-14 15:04:25,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:25,347 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:04:25,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:25,348 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:04:25,348 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:04:25,639 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:04:25,639 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 461 transitions, 7005 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:25,640 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:25,640 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:04:25,640 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:29,770 INFO  L124   PetriNetUnfolderBase]: 5327/8458 cut-off events.
[2024-06-14 15:04:29,771 INFO  L125   PetriNetUnfolderBase]: For 896022/896024 co-relation queries the response was YES.
[2024-06-14 15:04:29,840 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79359 conditions, 8458 events. 5327/8458 cut-off events. For 896022/896024 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 54492 event pairs, 896 based on Foata normal form. 8/8465 useless extension candidates. Maximal degree in co-relation 79227. Up to 7613 conditions per place. 
[2024-06-14 15:04:29,886 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 419 selfloop transitions, 118 changer transitions 0/541 dead transitions.
[2024-06-14 15:04:29,886 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 541 transitions, 9736 flow
[2024-06-14 15:04:29,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:04:29,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:04:29,887 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-14 15:04:29,887 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 15:04:29,888 INFO  L175             Difference]: Start difference. First operand has 283 places, 461 transitions, 7005 flow. Second operand 10 states and 190 transitions.
[2024-06-14 15:04:29,888 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 541 transitions, 9736 flow
[2024-06-14 15:04:32,775 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 541 transitions, 9423 flow, removed 118 selfloop flow, removed 5 redundant places.
[2024-06-14 15:04:32,785 INFO  L231             Difference]: Finished difference. Result has 291 places, 498 transitions, 8159 flow
[2024-06-14 15:04:32,785 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6692, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8159, PETRI_PLACES=291, PETRI_TRANSITIONS=498}
[2024-06-14 15:04:32,786 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 248 predicate places.
[2024-06-14 15:04:32,786 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 498 transitions, 8159 flow
[2024-06-14 15:04:32,786 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:32,786 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:32,786 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:32,786 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-14 15:04:32,787 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:04:32,787 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:32,787 INFO  L85        PathProgramCache]: Analyzing trace with hash -106444441, now seen corresponding path program 15 times
[2024-06-14 15:04:32,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:32,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564657352]
[2024-06-14 15:04:32,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:32,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:32,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:41,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:41,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:41,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564657352]
[2024-06-14 15:04:41,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564657352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:41,117 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:41,117 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:04:41,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243848649]
[2024-06-14 15:04:41,117 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:41,117 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:04:41,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:41,118 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:04:41,118 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:04:41,340 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:04:41,340 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 498 transitions, 8159 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:41,340 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:41,341 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:04:41,341 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:44,751 INFO  L124   PetriNetUnfolderBase]: 5566/8814 cut-off events.
[2024-06-14 15:04:44,752 INFO  L125   PetriNetUnfolderBase]: For 945354/945356 co-relation queries the response was YES.
[2024-06-14 15:04:44,824 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83754 conditions, 8814 events. 5566/8814 cut-off events. For 945354/945356 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 57198 event pairs, 1355 based on Foata normal form. 8/8821 useless extension candidates. Maximal degree in co-relation 83617. Up to 8191 conditions per place. 
[2024-06-14 15:04:44,873 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 485 selfloop transitions, 91 changer transitions 0/580 dead transitions.
[2024-06-14 15:04:44,873 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 580 transitions, 10606 flow
[2024-06-14 15:04:44,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:04:44,874 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:04:44,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-14 15:04:44,875 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-14 15:04:44,875 INFO  L175             Difference]: Start difference. First operand has 291 places, 498 transitions, 8159 flow. Second operand 10 states and 188 transitions.
[2024-06-14 15:04:44,875 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 580 transitions, 10606 flow
[2024-06-14 15:04:47,052 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 580 transitions, 10206 flow, removed 162 selfloop flow, removed 5 redundant places.
[2024-06-14 15:04:47,059 INFO  L231             Difference]: Finished difference. Result has 298 places, 536 transitions, 8905 flow
[2024-06-14 15:04:47,060 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7759, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8905, PETRI_PLACES=298, PETRI_TRANSITIONS=536}
[2024-06-14 15:04:47,060 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 255 predicate places.
[2024-06-14 15:04:47,060 INFO  L495      AbstractCegarLoop]: Abstraction has has 298 places, 536 transitions, 8905 flow
[2024-06-14 15:04:47,060 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:47,061 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:47,061 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:47,061 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-14 15:04:47,061 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:04:47,061 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:47,062 INFO  L85        PathProgramCache]: Analyzing trace with hash -102298895, now seen corresponding path program 1 times
[2024-06-14 15:04:47,062 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:47,062 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134368215]
[2024-06-14 15:04:47,062 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:47,062 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:47,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:56,723 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:56,723 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:56,723 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134368215]
[2024-06-14 15:04:56,723 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134368215] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:56,723 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:56,723 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:04:56,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438247936]
[2024-06-14 15:04:56,724 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:56,724 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:04:56,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:56,724 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:04:56,724 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:04:56,862 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 15:04:56,862 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 536 transitions, 8905 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:56,862 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:56,863 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 15:04:56,863 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:05:00,706 INFO  L124   PetriNetUnfolderBase]: 5465/8731 cut-off events.
[2024-06-14 15:05:00,707 INFO  L125   PetriNetUnfolderBase]: For 889385/889385 co-relation queries the response was YES.
[2024-06-14 15:05:00,993 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81693 conditions, 8731 events. 5465/8731 cut-off events. For 889385/889385 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 57456 event pairs, 1468 based on Foata normal form. 4/8729 useless extension candidates. Maximal degree in co-relation 81553. Up to 8364 conditions per place. 
[2024-06-14 15:05:01,040 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 524 selfloop transitions, 29 changer transitions 0/562 dead transitions.
[2024-06-14 15:05:01,040 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 562 transitions, 10415 flow
[2024-06-14 15:05:01,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:05:01,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:05:01,041 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-14 15:05:01,041 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 15:05:01,042 INFO  L175             Difference]: Start difference. First operand has 298 places, 536 transitions, 8905 flow. Second operand 7 states and 133 transitions.
[2024-06-14 15:05:01,042 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 562 transitions, 10415 flow
[2024-06-14 15:05:02,754 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 562 transitions, 10114 flow, removed 124 selfloop flow, removed 5 redundant places.
[2024-06-14 15:05:02,762 INFO  L231             Difference]: Finished difference. Result has 301 places, 546 transitions, 8856 flow
[2024-06-14 15:05:02,762 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8604, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8856, PETRI_PLACES=301, PETRI_TRANSITIONS=546}
[2024-06-14 15:05:02,763 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 258 predicate places.
[2024-06-14 15:05:02,763 INFO  L495      AbstractCegarLoop]: Abstraction has has 301 places, 546 transitions, 8856 flow
[2024-06-14 15:05:02,763 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:02,763 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:05:02,763 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:05:02,763 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-14 15:05:02,763 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:05:02,764 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:05:02,764 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345669303, now seen corresponding path program 2 times
[2024-06-14 15:05:02,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:05:02,765 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408410885]
[2024-06-14 15:05:02,765 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:05:02,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:05:02,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:05:11,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:05:11,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:05:11,776 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408410885]
[2024-06-14 15:05:11,776 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408410885] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:05:11,776 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:05:11,776 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:05:11,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036361298]
[2024-06-14 15:05:11,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:05:11,777 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:05:11,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:05:11,777 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:05:11,777 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:05:11,860 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 15:05:11,861 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 546 transitions, 8856 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:11,861 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:05:11,861 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 15:05:11,861 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:05:15,224 INFO  L124   PetriNetUnfolderBase]: 5462/8730 cut-off events.
[2024-06-14 15:05:15,225 INFO  L125   PetriNetUnfolderBase]: For 891264/891264 co-relation queries the response was YES.
[2024-06-14 15:05:15,282 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81555 conditions, 8730 events. 5462/8730 cut-off events. For 891264/891264 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 57445 event pairs, 1468 based on Foata normal form. 3/8729 useless extension candidates. Maximal degree in co-relation 81412. Up to 8431 conditions per place. 
[2024-06-14 15:05:15,328 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 532 selfloop transitions, 18 changer transitions 0/559 dead transitions.
[2024-06-14 15:05:15,329 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 559 transitions, 10056 flow
[2024-06-14 15:05:15,329 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:05:15,330 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:05:15,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-14 15:05:15,330 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39285714285714285
[2024-06-14 15:05:15,330 INFO  L175             Difference]: Start difference. First operand has 301 places, 546 transitions, 8856 flow. Second operand 8 states and 132 transitions.
[2024-06-14 15:05:15,330 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 559 transitions, 10056 flow
[2024-06-14 15:05:16,983 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 559 transitions, 9940 flow, removed 54 selfloop flow, removed 2 redundant places.
[2024-06-14 15:05:16,991 INFO  L231             Difference]: Finished difference. Result has 307 places, 549 transitions, 8857 flow
[2024-06-14 15:05:16,992 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8740, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8857, PETRI_PLACES=307, PETRI_TRANSITIONS=549}
[2024-06-14 15:05:16,992 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 264 predicate places.
[2024-06-14 15:05:16,992 INFO  L495      AbstractCegarLoop]: Abstraction has has 307 places, 549 transitions, 8857 flow
[2024-06-14 15:05:16,992 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:16,992 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:05:16,993 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:05:16,993 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-14 15:05:16,993 INFO  L420      AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:05:16,993 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:05:16,993 INFO  L85        PathProgramCache]: Analyzing trace with hash 819025183, now seen corresponding path program 3 times
[2024-06-14 15:05:16,993 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:05:16,993 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496006831]
[2024-06-14 15:05:16,994 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:05:16,994 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:05:17,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:05:26,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:05:26,062 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:05:26,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496006831]
[2024-06-14 15:05:26,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496006831] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:05:26,062 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:05:26,063 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:05:26,063 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835391330]
[2024-06-14 15:05:26,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:05:26,063 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:05:26,063 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:05:26,063 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:05:26,063 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:05:26,185 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 15:05:26,186 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 549 transitions, 8857 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:26,186 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:05:26,186 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 15:05:26,186 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:05:30,036 INFO  L124   PetriNetUnfolderBase]: 5455/8720 cut-off events.
[2024-06-14 15:05:30,036 INFO  L125   PetriNetUnfolderBase]: For 899865/899865 co-relation queries the response was YES.
[2024-06-14 15:05:30,151 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81462 conditions, 8720 events. 5455/8720 cut-off events. For 899865/899865 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 57453 event pairs, 1465 based on Foata normal form. 2/8716 useless extension candidates. Maximal degree in co-relation 81316. Up to 8416 conditions per place. 
[2024-06-14 15:05:30,217 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 532 selfloop transitions, 22 changer transitions 0/563 dead transitions.
[2024-06-14 15:05:30,217 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 563 transitions, 10075 flow
[2024-06-14 15:05:30,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:05:30,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:05:30,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-14 15:05:30,219 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4217687074829932
[2024-06-14 15:05:30,219 INFO  L175             Difference]: Start difference. First operand has 307 places, 549 transitions, 8857 flow. Second operand 7 states and 124 transitions.
[2024-06-14 15:05:30,219 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 563 transitions, 10075 flow
Killed by 15