./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.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/mix035_pso.opt_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix035_pso.opt_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 17:14:57,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:14:57,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:14:57,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:14:57,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:14:57,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:14:57,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:14:57,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:14:57,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:14:57,474 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:14:57,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:14:57,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:14:57,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:14:57,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:14:57,476 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:14:57,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:14:57,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:14:57,477 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:14:57,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:14:57,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:14:57,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:14:57,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:14:57,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:14:57,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:14:57,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:14:57,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:14:57,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:14:57,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:14:57,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:14:57,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:14:57,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:14:57,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:14:57,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:14:57,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:14:57,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:14:57,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:14:57,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:14:57,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:14:57,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:14:57,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:14:57,486 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:14:57,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:14:57,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:14:57,487 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 17:14:57,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:14:57,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:14:57,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:14:57,748 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:14:57,749 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:14:57,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2024-06-04 17:14:58,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:14:59,198 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:14:59,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2024-06-04 17:14:59,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488345f69/05b3b28eee504f909b502e872712fd63/FLAG6c9c7c2d9 [2024-06-04 17:14:59,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488345f69/05b3b28eee504f909b502e872712fd63 [2024-06-04 17:14:59,231 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:14:59,234 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:14:59,235 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/mix035_pso.opt_tso.opt.yml/witness.yml [2024-06-04 17:14:59,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:14:59,440 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:14:59,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:14:59,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:14:59,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:14:59,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:14:59" (1/2) ... [2024-06-04 17:14:59,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44cc35f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:14:59, skipping insertion in model container [2024-06-04 17:14:59,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:14:59" (1/2) ... [2024-06-04 17:14:59,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@9d706ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:14:59, skipping insertion in model container [2024-06-04 17:14:59,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:14:59" (2/2) ... [2024-06-04 17:14:59,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44cc35f0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:14:59, skipping insertion in model container [2024-06-04 17:14:59,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:14:59" (2/2) ... [2024-06-04 17:14:59,451 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:14:59,550 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:14:59,551 INFO L97 edCorrectnessWitness]: Location invariant before [L840-L840] (((((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 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 )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 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 )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-04 17:14:59,552 INFO L97 edCorrectnessWitness]: Location invariant before [L841-L841] (((((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 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 )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 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 )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-04 17:14:59,552 INFO L97 edCorrectnessWitness]: Location invariant before [L838-L838] (((((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 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 )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 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 )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-04 17:14:59,553 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:14:59,553 INFO L106 edCorrectnessWitness]: ghost_update [L836-L836] multithreaded = 1; [2024-06-04 17:14:59,600 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:14:59,941 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:14:59,955 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:15:00,418 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:15:00,475 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:15:00,476 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00 WrapperNode [2024-06-04 17:15:00,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:15:00,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:15:00,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:15:00,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:15:00,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (1/1) ... [2024-06-04 17:15:00,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (1/1) ... [2024-06-04 17:15:00,674 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2024-06-04 17:15:00,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:15:00,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:15:00,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:15:00,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:15:00,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (1/1) ... [2024-06-04 17:15:00,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (1/1) ... [2024-06-04 17:15:00,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (1/1) ... [2024-06-04 17:15:00,782 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 17:15:00,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (1/1) ... [2024-06-04 17:15:00,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (1/1) ... [2024-06-04 17:15:00,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (1/1) ... [2024-06-04 17:15:00,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (1/1) ... [2024-06-04 17:15:00,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (1/1) ... [2024-06-04 17:15:00,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (1/1) ... [2024-06-04 17:15:00,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:15:00,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:15:00,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:15:00,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:15:00,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (1/1) ... [2024-06-04 17:15:00,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:15:01,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:15:01,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 17:15:01,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 17:15:01,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:15:01,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:15:01,097 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:15:01,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:15:01,098 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:15:01,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:15:01,098 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 17:15:01,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 17:15:01,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:15:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:15:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:15:01,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:15:01,100 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 17:15:01,218 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:15:01,219 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:15:02,923 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:15:02,925 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:15:03,359 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:15:03,360 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:15:03,360 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:15:03 BoogieIcfgContainer [2024-06-04 17:15:03,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:15:03,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:15:03,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:15:03,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:15:03,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:14:59" (1/4) ... [2024-06-04 17:15:03,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a7203f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:15:03, skipping insertion in model container [2024-06-04 17:15:03,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:14:59" (2/4) ... [2024-06-04 17:15:03,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a7203f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:15:03, skipping insertion in model container [2024-06-04 17:15:03,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:00" (3/4) ... [2024-06-04 17:15:03,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a7203f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:15:03, skipping insertion in model container [2024-06-04 17:15:03,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:15:03" (4/4) ... [2024-06-04 17:15:03,369 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2024-06-04 17:15:03,384 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:15:03,384 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 17:15:03,384 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:15:03,563 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:15:03,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow [2024-06-04 17:15:03,671 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2024-06-04 17:15:03,672 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:15:03,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:15:03,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow [2024-06-04 17:15:03,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow [2024-06-04 17:15:03,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:15:03,698 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;@2eda24b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:15:03,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 17:15:03,710 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:15:03,710 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:15:03,710 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:15:03,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:03,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:15:03,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:15:03,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:03,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1632138003, now seen corresponding path program 1 times [2024-06-04 17:15:03,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:03,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509217929] [2024-06-04 17:15:03,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:03,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:12,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509217929] [2024-06-04 17:15:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509217929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:12,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:12,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:15:12,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648089256] [2024-06-04 17:15:12,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:12,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:15:12,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:12,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:15:12,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:15:12,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-04 17:15:12,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:12,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:12,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-04 17:15:12,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:13,727 INFO L124 PetriNetUnfolderBase]: 869/1439 cut-off events. [2024-06-04 17:15:13,727 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-04 17:15:13,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2819 conditions, 1439 events. 869/1439 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7341 event pairs, 566 based on Foata normal form. 1/1386 useless extension candidates. Maximal degree in co-relation 2804. Up to 1315 conditions per place. [2024-06-04 17:15:13,743 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-04 17:15:13,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 175 flow [2024-06-04 17:15:13,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:15:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:15:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-06-04 17:15:13,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2024-06-04 17:15:13,757 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 81 transitions. [2024-06-04 17:15:13,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 175 flow [2024-06-04 17:15:13,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 17:15:13,764 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow [2024-06-04 17:15:13,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-04 17:15:13,770 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2024-06-04 17:15:13,770 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow [2024-06-04 17:15:13,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:13,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:13,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:13,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:15:13,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:15:13,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:13,772 INFO L85 PathProgramCache]: Analyzing trace with hash -821543540, now seen corresponding path program 1 times [2024-06-04 17:15:13,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:13,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035576462] [2024-06-04 17:15:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:13,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:20,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:20,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035576462] [2024-06-04 17:15:20,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035576462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:20,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:20,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:15:20,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451899201] [2024-06-04 17:15:20,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:20,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:15:20,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:20,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:15:20,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:15:20,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-04 17:15:20,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:20,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:20,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-04 17:15:20,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:21,423 INFO L124 PetriNetUnfolderBase]: 996/1590 cut-off events. [2024-06-04 17:15:21,423 INFO L125 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2024-06-04 17:15:21,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3607 conditions, 1590 events. 996/1590 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8017 event pairs, 519 based on Foata normal form. 3/1570 useless extension candidates. Maximal degree in co-relation 3592. Up to 1484 conditions per place. [2024-06-04 17:15:21,435 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 40 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2024-06-04 17:15:21,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 244 flow [2024-06-04 17:15:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:15:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:15:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-06-04 17:15:21,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5930232558139535 [2024-06-04 17:15:21,439 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 102 transitions. [2024-06-04 17:15:21,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 244 flow [2024-06-04 17:15:21,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:15:21,443 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow [2024-06-04 17:15:21,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-06-04 17:15:21,443 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2024-06-04 17:15:21,444 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow [2024-06-04 17:15:21,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:21,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:21,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:21,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:15:21,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:15:21,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1879442065, now seen corresponding path program 1 times [2024-06-04 17:15:21,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:21,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990460016] [2024-06-04 17:15:21,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:21,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:28,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:28,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990460016] [2024-06-04 17:15:28,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990460016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:28,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:28,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:15:28,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763450510] [2024-06-04 17:15:28,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:28,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:15:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:28,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:15:28,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:15:28,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 17:15:28,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:28,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:28,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 17:15:28,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:29,922 INFO L124 PetriNetUnfolderBase]: 1265/1984 cut-off events. [2024-06-04 17:15:29,924 INFO L125 PetriNetUnfolderBase]: For 1076/1076 co-relation queries the response was YES. [2024-06-04 17:15:29,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4983 conditions, 1984 events. 1265/1984 cut-off events. For 1076/1076 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9784 event pairs, 445 based on Foata normal form. 6/1959 useless extension candidates. Maximal degree in co-relation 4966. Up to 1828 conditions per place. [2024-06-04 17:15:29,937 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 52 selfloop transitions, 12 changer transitions 0/70 dead transitions. [2024-06-04 17:15:29,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 356 flow [2024-06-04 17:15:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:15:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:15:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-06-04 17:15:29,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5387596899224806 [2024-06-04 17:15:29,943 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 6 states and 139 transitions. [2024-06-04 17:15:29,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 356 flow [2024-06-04 17:15:29,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 336 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-04 17:15:29,947 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 183 flow [2024-06-04 17:15:29,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=120, 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=6, PETRI_FLOW=183, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-06-04 17:15:29,948 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2024-06-04 17:15:29,948 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 183 flow [2024-06-04 17:15:29,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:29,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:29,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:29,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:15:29,949 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:15:29,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1919090944, now seen corresponding path program 1 times [2024-06-04 17:15:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:29,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227078406] [2024-06-04 17:15:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227078406] [2024-06-04 17:15:42,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227078406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:42,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:42,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:15:42,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610688906] [2024-06-04 17:15:42,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:42,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:15:42,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:42,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:15:42,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:15:42,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 17:15:42,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:42,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:42,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 17:15:42,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:43,993 INFO L124 PetriNetUnfolderBase]: 1085/1811 cut-off events. [2024-06-04 17:15:43,993 INFO L125 PetriNetUnfolderBase]: For 1768/1768 co-relation queries the response was YES. [2024-06-04 17:15:43,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4869 conditions, 1811 events. 1085/1811 cut-off events. For 1768/1768 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9338 event pairs, 442 based on Foata normal form. 4/1807 useless extension candidates. Maximal degree in co-relation 4850. Up to 1611 conditions per place. [2024-06-04 17:15:44,007 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 44 selfloop transitions, 8 changer transitions 0/59 dead transitions. [2024-06-04 17:15:44,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 331 flow [2024-06-04 17:15:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:15:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:15:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-04 17:15:44,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930232558139535 [2024-06-04 17:15:44,010 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 183 flow. Second operand 5 states and 106 transitions. [2024-06-04 17:15:44,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 331 flow [2024-06-04 17:15:44,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 304 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 17:15:44,016 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 200 flow [2024-06-04 17:15:44,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-06-04 17:15:44,018 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2024-06-04 17:15:44,018 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 200 flow [2024-06-04 17:15:44,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:44,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:44,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:44,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:15:44,019 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-04 17:15:44,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1425082109, now seen corresponding path program 1 times [2024-06-04 17:15:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:44,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754979651] [2024-06-04 17:15:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:57,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-04 17:15:57,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:57,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754979651] [2024-06-04 17:15:57,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754979651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:57,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:57,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:15:57,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127503487] [2024-06-04 17:15:57,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:57,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:15:57,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:57,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:15:57,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:15:57,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:15:57,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 200 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:57,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:57,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:15:57,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:59,147 INFO L124 PetriNetUnfolderBase]: 1277/2018 cut-off events. [2024-06-04 17:15:59,147 INFO L125 PetriNetUnfolderBase]: For 3038/3038 co-relation queries the response was YES. [2024-06-04 17:15:59,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5999 conditions, 2018 events. 1277/2018 cut-off events. For 3038/3038 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9959 event pairs, 487 based on Foata normal form. 4/2011 useless extension candidates. Maximal degree in co-relation 5978. Up to 1826 conditions per place. [2024-06-04 17:15:59,161 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 54 selfloop transitions, 16 changer transitions 0/76 dead transitions. [2024-06-04 17:15:59,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 448 flow [2024-06-04 17:15:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:15:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:15:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-06-04 17:15:59,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-04 17:15:59,163 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 200 flow. Second operand 6 states and 129 transitions. [2024-06-04 17:15:59,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 448 flow [2024-06-04 17:15:59,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 428 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 17:15:59,169 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 262 flow [2024-06-04 17:15:59,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2024-06-04 17:15:59,169 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2024-06-04 17:15:59,169 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 262 flow [2024-06-04 17:15:59,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:59,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:59,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:59,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:15:59,170 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:15:59,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:59,171 INFO L85 PathProgramCache]: Analyzing trace with hash -759929237, now seen corresponding path program 2 times [2024-06-04 17:15:59,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:59,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20002849] [2024-06-04 17:15:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:12,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:12,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20002849] [2024-06-04 17:16:12,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20002849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:12,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:12,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:16:12,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418406170] [2024-06-04 17:16:12,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:12,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:16:12,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:12,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:16:12,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:16:12,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:16:12,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:12,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:12,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:16:12,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:13,910 INFO L124 PetriNetUnfolderBase]: 1267/2006 cut-off events. [2024-06-04 17:16:13,911 INFO L125 PetriNetUnfolderBase]: For 4386/4390 co-relation queries the response was YES. [2024-06-04 17:16:13,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6439 conditions, 2006 events. 1267/2006 cut-off events. For 4386/4390 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9904 event pairs, 486 based on Foata normal form. 8/2004 useless extension candidates. Maximal degree in co-relation 6417. Up to 1818 conditions per place. [2024-06-04 17:16:13,923 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 48 selfloop transitions, 16 changer transitions 0/70 dead transitions. [2024-06-04 17:16:13,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 432 flow [2024-06-04 17:16:13,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:16:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:16:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-06-04 17:16:13,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47674418604651164 [2024-06-04 17:16:13,925 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 262 flow. Second operand 6 states and 123 transitions. [2024-06-04 17:16:13,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 432 flow [2024-06-04 17:16:13,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 402 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-04 17:16:13,930 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 272 flow [2024-06-04 17:16:13,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-06-04 17:16:13,931 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2024-06-04 17:16:13,931 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 272 flow [2024-06-04 17:16:13,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:13,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:13,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:13,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:16:13,932 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:16:13,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:13,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1574218929, now seen corresponding path program 1 times [2024-06-04 17:16:13,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:13,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503246666] [2024-06-04 17:16:13,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:13,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:27,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:27,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503246666] [2024-06-04 17:16:27,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503246666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:27,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:27,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:16:27,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584445826] [2024-06-04 17:16:27,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:27,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:16:27,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:16:27,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:16:27,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:16:27,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 272 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:27,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:27,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:16:27,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:29,263 INFO L124 PetriNetUnfolderBase]: 1325/2105 cut-off events. [2024-06-04 17:16:29,263 INFO L125 PetriNetUnfolderBase]: For 5380/5382 co-relation queries the response was YES. [2024-06-04 17:16:29,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6900 conditions, 2105 events. 1325/2105 cut-off events. For 5380/5382 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10521 event pairs, 520 based on Foata normal form. 6/2101 useless extension candidates. Maximal degree in co-relation 6876. Up to 1909 conditions per place. [2024-06-04 17:16:29,278 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 64 selfloop transitions, 24 changer transitions 0/94 dead transitions. [2024-06-04 17:16:29,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 602 flow [2024-06-04 17:16:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:16:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:16:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-04 17:16:29,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738372093023256 [2024-06-04 17:16:29,281 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 272 flow. Second operand 8 states and 163 transitions. [2024-06-04 17:16:29,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 602 flow [2024-06-04 17:16:29,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 94 transitions, 546 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 17:16:29,288 INFO L231 Difference]: Finished difference. Result has 64 places, 67 transitions, 382 flow [2024-06-04 17:16:29,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=382, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2024-06-04 17:16:29,290 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2024-06-04 17:16:29,290 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 67 transitions, 382 flow [2024-06-04 17:16:29,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:29,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:29,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:29,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:16:29,291 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:16:29,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1239443087, now seen corresponding path program 2 times [2024-06-04 17:16:29,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:29,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848528987] [2024-06-04 17:16:29,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:29,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:43,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:43,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848528987] [2024-06-04 17:16:43,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848528987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:43,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:43,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:16:43,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864595116] [2024-06-04 17:16:43,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:43,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:16:43,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:43,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:16:43,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:16:43,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:16:43,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 67 transitions, 382 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:43,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:43,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:16:43,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:45,243 INFO L124 PetriNetUnfolderBase]: 1347/2150 cut-off events. [2024-06-04 17:16:45,243 INFO L125 PetriNetUnfolderBase]: For 7299/7303 co-relation queries the response was YES. [2024-06-04 17:16:45,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7572 conditions, 2150 events. 1347/2150 cut-off events. For 7299/7303 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10835 event pairs, 513 based on Foata normal form. 8/2144 useless extension candidates. Maximal degree in co-relation 7546. Up to 1918 conditions per place. [2024-06-04 17:16:45,258 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 64 selfloop transitions, 26 changer transitions 0/96 dead transitions. [2024-06-04 17:16:45,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 674 flow [2024-06-04 17:16:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:16:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:16:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-06-04 17:16:45,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47840531561461797 [2024-06-04 17:16:45,260 INFO L175 Difference]: Start difference. First operand has 64 places, 67 transitions, 382 flow. Second operand 7 states and 144 transitions. [2024-06-04 17:16:45,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 674 flow [2024-06-04 17:16:45,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 634 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-04 17:16:45,268 INFO L231 Difference]: Finished difference. Result has 68 places, 70 transitions, 441 flow [2024-06-04 17:16:45,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=441, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2024-06-04 17:16:45,269 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2024-06-04 17:16:45,269 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 441 flow [2024-06-04 17:16:45,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:45,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:45,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:45,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:16:45,270 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:16:45,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1504310407, now seen corresponding path program 3 times [2024-06-04 17:16:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:45,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126924932] [2024-06-04 17:16:45,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:59,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:59,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126924932] [2024-06-04 17:16:59,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126924932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:59,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:59,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:16:59,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106930742] [2024-06-04 17:16:59,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:59,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:16:59,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:59,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:16:59,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:16:59,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:16:59,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 441 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:59,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:59,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:16:59,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:01,487 INFO L124 PetriNetUnfolderBase]: 1369/2189 cut-off events. [2024-06-04 17:17:01,487 INFO L125 PetriNetUnfolderBase]: For 9794/9796 co-relation queries the response was YES. [2024-06-04 17:17:01,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8231 conditions, 2189 events. 1369/2189 cut-off events. For 9794/9796 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 11010 event pairs, 449 based on Foata normal form. 4/2180 useless extension candidates. Maximal degree in co-relation 8204. Up to 1834 conditions per place. [2024-06-04 17:17:01,500 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 60 selfloop transitions, 37 changer transitions 0/103 dead transitions. [2024-06-04 17:17:01,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 103 transitions, 811 flow [2024-06-04 17:17:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:17:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:17:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-04 17:17:01,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983388704318937 [2024-06-04 17:17:01,503 INFO L175 Difference]: Start difference. First operand has 68 places, 70 transitions, 441 flow. Second operand 7 states and 150 transitions. [2024-06-04 17:17:01,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 103 transitions, 811 flow [2024-06-04 17:17:01,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 103 transitions, 726 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-04 17:17:01,511 INFO L231 Difference]: Finished difference. Result has 70 places, 76 transitions, 516 flow [2024-06-04 17:17:01,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=516, PETRI_PLACES=70, PETRI_TRANSITIONS=76} [2024-06-04 17:17:01,512 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2024-06-04 17:17:01,512 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 76 transitions, 516 flow [2024-06-04 17:17:01,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:01,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:01,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:01,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:17:01,513 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:17:01,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2107099049, now seen corresponding path program 4 times [2024-06-04 17:17:01,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:01,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624731562] [2024-06-04 17:17:01,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:01,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:17:17,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:17,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624731562] [2024-06-04 17:17:17,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624731562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:17,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:17,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:17:17,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901609305] [2024-06-04 17:17:17,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:17,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:17:17,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:17,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:17:17,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:17:17,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:17:17,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 76 transitions, 516 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:17,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:17,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:17:17,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:18,933 INFO L124 PetriNetUnfolderBase]: 1359/2176 cut-off events. [2024-06-04 17:17:18,933 INFO L125 PetriNetUnfolderBase]: For 9917/9921 co-relation queries the response was YES. [2024-06-04 17:17:18,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8161 conditions, 2176 events. 1359/2176 cut-off events. For 9917/9921 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10916 event pairs, 456 based on Foata normal form. 4/2167 useless extension candidates. Maximal degree in co-relation 8133. Up to 1826 conditions per place. [2024-06-04 17:17:18,945 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 55 selfloop transitions, 37 changer transitions 0/98 dead transitions. [2024-06-04 17:17:18,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 98 transitions, 764 flow [2024-06-04 17:17:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:17:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:17:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-06-04 17:17:18,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47840531561461797 [2024-06-04 17:17:18,947 INFO L175 Difference]: Start difference. First operand has 70 places, 76 transitions, 516 flow. Second operand 7 states and 144 transitions. [2024-06-04 17:17:18,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 98 transitions, 764 flow [2024-06-04 17:17:18,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 98 transitions, 706 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-04 17:17:18,961 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 540 flow [2024-06-04 17:17:18,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=540, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2024-06-04 17:17:18,963 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2024-06-04 17:17:18,965 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 540 flow [2024-06-04 17:17:18,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:18,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:18,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:18,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:17:18,966 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:17:18,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1246123091, now seen corresponding path program 1 times [2024-06-04 17:17:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:18,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783808611] [2024-06-04 17:17:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:17:33,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:33,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783808611] [2024-06-04 17:17:33,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783808611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:33,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:33,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:17:33,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566298230] [2024-06-04 17:17:33,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:33,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:17:33,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:33,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:17:33,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:17:33,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 17:17:33,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 540 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:33,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:33,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 17:17:33,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:34,438 INFO L124 PetriNetUnfolderBase]: 1181/1979 cut-off events. [2024-06-04 17:17:34,438 INFO L125 PetriNetUnfolderBase]: For 9780/9782 co-relation queries the response was YES. [2024-06-04 17:17:34,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7493 conditions, 1979 events. 1181/1979 cut-off events. For 9780/9782 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10272 event pairs, 401 based on Foata normal form. 4/1969 useless extension candidates. Maximal degree in co-relation 7463. Up to 1735 conditions per place. [2024-06-04 17:17:34,451 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 81 selfloop transitions, 13 changer transitions 0/101 dead transitions. [2024-06-04 17:17:34,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 101 transitions, 829 flow [2024-06-04 17:17:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:17:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:17:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-04 17:17:34,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750830564784053 [2024-06-04 17:17:34,453 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 540 flow. Second operand 7 states and 143 transitions. [2024-06-04 17:17:34,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 101 transitions, 829 flow [2024-06-04 17:17:34,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 101 transitions, 726 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 17:17:34,463 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 521 flow [2024-06-04 17:17:34,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=521, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2024-06-04 17:17:34,463 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2024-06-04 17:17:34,464 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 521 flow [2024-06-04 17:17:34,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:34,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:34,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:34,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:17:34,464 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:17:34,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:34,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1782324144, now seen corresponding path program 1 times [2024-06-04 17:17:34,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:34,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531387744] [2024-06-04 17:17:34,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:34,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:17:48,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:48,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531387744] [2024-06-04 17:17:48,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531387744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:48,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:48,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:17:48,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36022130] [2024-06-04 17:17:48,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:48,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:17:48,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:48,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:17:48,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:17:48,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-04 17:17:48,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 521 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:48,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:48,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-04 17:17:48,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:49,238 INFO L124 PetriNetUnfolderBase]: 1070/1841 cut-off events. [2024-06-04 17:17:49,238 INFO L125 PetriNetUnfolderBase]: For 10656/10668 co-relation queries the response was YES. [2024-06-04 17:17:49,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7271 conditions, 1841 events. 1070/1841 cut-off events. For 10656/10668 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9853 event pairs, 401 based on Foata normal form. 11/1824 useless extension candidates. Maximal degree in co-relation 7239. Up to 1605 conditions per place. [2024-06-04 17:17:49,249 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 72 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-06-04 17:17:49,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 92 transitions, 723 flow [2024-06-04 17:17:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:17:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:17:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-06-04 17:17:49,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2024-06-04 17:17:49,252 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 521 flow. Second operand 5 states and 105 transitions. [2024-06-04 17:17:49,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 92 transitions, 723 flow [2024-06-04 17:17:49,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 684 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-04 17:17:49,263 INFO L231 Difference]: Finished difference. Result has 77 places, 84 transitions, 528 flow [2024-06-04 17:17:49,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=528, PETRI_PLACES=77, PETRI_TRANSITIONS=84} [2024-06-04 17:17:49,264 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2024-06-04 17:17:49,264 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 84 transitions, 528 flow [2024-06-04 17:17:49,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:49,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:49,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:49,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:17:49,265 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:17:49,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:49,266 INFO L85 PathProgramCache]: Analyzing trace with hash -582524724, now seen corresponding path program 1 times [2024-06-04 17:17:49,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:49,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110185551] [2024-06-04 17:17:49,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:49,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:18:03,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:03,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110185551] [2024-06-04 17:18:03,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110185551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:03,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:03,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:18:03,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048360520] [2024-06-04 17:18:03,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:03,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:18:03,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:03,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:18:03,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:18:03,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 17:18:03,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 528 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:03,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:03,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 17:18:03,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:04,665 INFO L124 PetriNetUnfolderBase]: 1222/2017 cut-off events. [2024-06-04 17:18:04,665 INFO L125 PetriNetUnfolderBase]: For 14358/14370 co-relation queries the response was YES. [2024-06-04 17:18:04,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8458 conditions, 2017 events. 1222/2017 cut-off events. For 14358/14370 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10540 event pairs, 473 based on Foata normal form. 11/2013 useless extension candidates. Maximal degree in co-relation 8425. Up to 1828 conditions per place. [2024-06-04 17:18:04,678 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 74 selfloop transitions, 11 changer transitions 0/96 dead transitions. [2024-06-04 17:18:04,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 96 transitions, 746 flow [2024-06-04 17:18:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:18:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:18:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-04 17:18:04,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2024-06-04 17:18:04,680 INFO L175 Difference]: Start difference. First operand has 77 places, 84 transitions, 528 flow. Second operand 6 states and 117 transitions. [2024-06-04 17:18:04,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 96 transitions, 746 flow [2024-06-04 17:18:04,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 96 transitions, 722 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-04 17:18:04,691 INFO L231 Difference]: Finished difference. Result has 80 places, 87 transitions, 560 flow [2024-06-04 17:18:04,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=560, PETRI_PLACES=80, PETRI_TRANSITIONS=87} [2024-06-04 17:18:04,692 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2024-06-04 17:18:04,692 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 87 transitions, 560 flow [2024-06-04 17:18:04,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:04,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:04,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:04,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:18:04,693 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:18:04,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1013981938, now seen corresponding path program 1 times [2024-06-04 17:18:04,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:04,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036130678] [2024-06-04 17:18:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:14,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-04 17:18:14,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:14,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036130678] [2024-06-04 17:18:14,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036130678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:14,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:14,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:18:14,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080341781] [2024-06-04 17:18:14,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:14,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:18:14,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:14,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:18:14,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:18:14,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:18:14,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 87 transitions, 560 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:14,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:14,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:18:14,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:16,296 INFO L124 PetriNetUnfolderBase]: 1644/2642 cut-off events. [2024-06-04 17:18:16,296 INFO L125 PetriNetUnfolderBase]: For 23383/23385 co-relation queries the response was YES. [2024-06-04 17:18:16,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11747 conditions, 2642 events. 1644/2642 cut-off events. For 23383/23385 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13974 event pairs, 523 based on Foata normal form. 18/2659 useless extension candidates. Maximal degree in co-relation 11713. Up to 2069 conditions per place. [2024-06-04 17:18:16,309 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 102 selfloop transitions, 41 changer transitions 0/150 dead transitions. [2024-06-04 17:18:16,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 150 transitions, 1217 flow [2024-06-04 17:18:16,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:18:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:18:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-06-04 17:18:16,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46744186046511627 [2024-06-04 17:18:16,311 INFO L175 Difference]: Start difference. First operand has 80 places, 87 transitions, 560 flow. Second operand 10 states and 201 transitions. [2024-06-04 17:18:16,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 150 transitions, 1217 flow [2024-06-04 17:18:16,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 150 transitions, 1181 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 17:18:16,327 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 868 flow [2024-06-04 17:18:16,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=868, PETRI_PLACES=91, PETRI_TRANSITIONS=110} [2024-06-04 17:18:16,328 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places. [2024-06-04 17:18:16,328 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 868 flow [2024-06-04 17:18:16,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:16,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:16,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:16,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:18:16,329 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:18:16,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:16,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1646436374, now seen corresponding path program 2 times [2024-06-04 17:18:16,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:16,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636597731] [2024-06-04 17:18:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:16,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:18:32,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:32,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636597731] [2024-06-04 17:18:32,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636597731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:32,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:32,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:18:32,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287116842] [2024-06-04 17:18:32,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:32,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:18:32,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:32,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:18:32,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:18:32,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:18:32,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 110 transitions, 868 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:32,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:32,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:18:32,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:33,862 INFO L124 PetriNetUnfolderBase]: 1683/2715 cut-off events. [2024-06-04 17:18:33,862 INFO L125 PetriNetUnfolderBase]: For 28299/28303 co-relation queries the response was YES. [2024-06-04 17:18:33,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12446 conditions, 2715 events. 1683/2715 cut-off events. For 28299/28303 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14513 event pairs, 534 based on Foata normal form. 44/2758 useless extension candidates. Maximal degree in co-relation 12406. Up to 2133 conditions per place. [2024-06-04 17:18:33,876 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 92 selfloop transitions, 46 changer transitions 0/145 dead transitions. [2024-06-04 17:18:33,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 145 transitions, 1288 flow [2024-06-04 17:18:33,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:18:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:18:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-04 17:18:33,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2024-06-04 17:18:33,879 INFO L175 Difference]: Start difference. First operand has 91 places, 110 transitions, 868 flow. Second operand 8 states and 165 transitions. [2024-06-04 17:18:33,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 145 transitions, 1288 flow [2024-06-04 17:18:33,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 145 transitions, 1274 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-04 17:18:33,899 INFO L231 Difference]: Finished difference. Result has 98 places, 111 transitions, 982 flow [2024-06-04 17:18:33,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=982, PETRI_PLACES=98, PETRI_TRANSITIONS=111} [2024-06-04 17:18:33,900 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2024-06-04 17:18:33,900 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 111 transitions, 982 flow [2024-06-04 17:18:33,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:33,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:33,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:33,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:18:33,901 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:18:33,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:33,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1132130068, now seen corresponding path program 3 times [2024-06-04 17:18:33,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:33,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405525054] [2024-06-04 17:18:33,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:33,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:18:44,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:44,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405525054] [2024-06-04 17:18:44,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405525054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:44,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:44,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:18:44,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774804044] [2024-06-04 17:18:44,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:44,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:18:44,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:44,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:18:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:18:45,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:18:45,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 111 transitions, 982 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:45,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:45,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:18:45,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:46,917 INFO L124 PetriNetUnfolderBase]: 1758/2828 cut-off events. [2024-06-04 17:18:46,917 INFO L125 PetriNetUnfolderBase]: For 30956/30958 co-relation queries the response was YES. [2024-06-04 17:18:46,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13384 conditions, 2828 events. 1758/2828 cut-off events. For 30956/30958 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15175 event pairs, 475 based on Foata normal form. 20/2846 useless extension candidates. Maximal degree in co-relation 13341. Up to 2289 conditions per place. [2024-06-04 17:18:46,936 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 81 selfloop transitions, 56 changer transitions 0/144 dead transitions. [2024-06-04 17:18:46,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 144 transitions, 1388 flow [2024-06-04 17:18:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:18:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:18:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-04 17:18:46,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49127906976744184 [2024-06-04 17:18:46,939 INFO L175 Difference]: Start difference. First operand has 98 places, 111 transitions, 982 flow. Second operand 8 states and 169 transitions. [2024-06-04 17:18:46,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 144 transitions, 1388 flow [2024-06-04 17:18:46,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 144 transitions, 1298 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 17:18:46,965 INFO L231 Difference]: Finished difference. Result has 100 places, 112 transitions, 1035 flow [2024-06-04 17:18:46,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1035, PETRI_PLACES=100, PETRI_TRANSITIONS=112} [2024-06-04 17:18:46,966 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places. [2024-06-04 17:18:46,966 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 112 transitions, 1035 flow [2024-06-04 17:18:46,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:46,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:46,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:46,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:18:46,967 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:18:46,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:46,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1761912242, now seen corresponding path program 1 times [2024-06-04 17:18:46,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:46,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22783359] [2024-06-04 17:18:46,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:46,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:18:59,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:59,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22783359] [2024-06-04 17:18:59,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22783359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:59,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:59,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:18:59,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677795445] [2024-06-04 17:18:59,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:59,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:18:59,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:59,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:18:59,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:18:59,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:18:59,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 112 transitions, 1035 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:59,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:59,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:18:59,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:00,942 INFO L124 PetriNetUnfolderBase]: 1775/2872 cut-off events. [2024-06-04 17:19:00,943 INFO L125 PetriNetUnfolderBase]: For 33255/33259 co-relation queries the response was YES. [2024-06-04 17:19:00,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13786 conditions, 2872 events. 1775/2872 cut-off events. For 33255/33259 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15584 event pairs, 592 based on Foata normal form. 8/2878 useless extension candidates. Maximal degree in co-relation 13742. Up to 2569 conditions per place. [2024-06-04 17:19:00,959 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 107 selfloop transitions, 31 changer transitions 0/145 dead transitions. [2024-06-04 17:19:00,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 145 transitions, 1454 flow [2024-06-04 17:19:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:19:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:19:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-04 17:19:00,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47093023255813954 [2024-06-04 17:19:00,962 INFO L175 Difference]: Start difference. First operand has 100 places, 112 transitions, 1035 flow. Second operand 8 states and 162 transitions. [2024-06-04 17:19:00,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 145 transitions, 1454 flow [2024-06-04 17:19:00,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 145 transitions, 1331 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 17:19:00,991 INFO L231 Difference]: Finished difference. Result has 103 places, 117 transitions, 1042 flow [2024-06-04 17:19:00,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1042, PETRI_PLACES=103, PETRI_TRANSITIONS=117} [2024-06-04 17:19:00,992 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 59 predicate places. [2024-06-04 17:19:00,992 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 117 transitions, 1042 flow [2024-06-04 17:19:00,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:00,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:00,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:00,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:19:00,993 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:19:00,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1804123087, now seen corresponding path program 1 times [2024-06-04 17:19:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:00,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783711088] [2024-06-04 17:19:00,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:14,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:14,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783711088] [2024-06-04 17:19:14,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783711088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:14,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:14,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:19:14,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666401993] [2024-06-04 17:19:14,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:14,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:19:14,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:14,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:19:14,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:19:15,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 17:19:15,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 117 transitions, 1042 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:15,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:15,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 17:19:15,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:16,481 INFO L124 PetriNetUnfolderBase]: 1694/2755 cut-off events. [2024-06-04 17:19:16,481 INFO L125 PetriNetUnfolderBase]: For 34941/34958 co-relation queries the response was YES. [2024-06-04 17:19:16,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13661 conditions, 2755 events. 1694/2755 cut-off events. For 34941/34958 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 15002 event pairs, 532 based on Foata normal form. 17/2759 useless extension candidates. Maximal degree in co-relation 13615. Up to 2462 conditions per place. [2024-06-04 17:19:16,496 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 86 selfloop transitions, 31 changer transitions 0/133 dead transitions. [2024-06-04 17:19:16,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 133 transitions, 1338 flow [2024-06-04 17:19:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:19:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:19:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-06-04 17:19:16,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47674418604651164 [2024-06-04 17:19:16,498 INFO L175 Difference]: Start difference. First operand has 103 places, 117 transitions, 1042 flow. Second operand 6 states and 123 transitions. [2024-06-04 17:19:16,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 133 transitions, 1338 flow [2024-06-04 17:19:16,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 133 transitions, 1255 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-04 17:19:16,517 INFO L231 Difference]: Finished difference. Result has 104 places, 120 transitions, 1064 flow [2024-06-04 17:19:16,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1064, PETRI_PLACES=104, PETRI_TRANSITIONS=120} [2024-06-04 17:19:16,517 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places. [2024-06-04 17:19:16,518 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 120 transitions, 1064 flow [2024-06-04 17:19:16,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:16,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:16,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:16,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:19:16,518 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:19:16,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:16,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1008194918, now seen corresponding path program 4 times [2024-06-04 17:19:16,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:16,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950937465] [2024-06-04 17:19:16,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:16,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:32,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:32,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950937465] [2024-06-04 17:19:32,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950937465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:32,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:32,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:19:32,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277417603] [2024-06-04 17:19:32,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:32,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:19:32,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:32,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:19:32,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:19:32,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:19:32,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 120 transitions, 1064 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:32,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:32,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:19:32,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:34,450 INFO L124 PetriNetUnfolderBase]: 1890/3034 cut-off events. [2024-06-04 17:19:34,451 INFO L125 PetriNetUnfolderBase]: For 42361/42363 co-relation queries the response was YES. [2024-06-04 17:19:34,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15330 conditions, 3034 events. 1890/3034 cut-off events. For 42361/42363 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16221 event pairs, 501 based on Foata normal form. 20/3053 useless extension candidates. Maximal degree in co-relation 15283. Up to 2485 conditions per place. [2024-06-04 17:19:34,480 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 88 selfloop transitions, 56 changer transitions 0/151 dead transitions. [2024-06-04 17:19:34,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 151 transitions, 1492 flow [2024-06-04 17:19:34,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:19:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:19:34,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-04 17:19:34,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2024-06-04 17:19:34,487 INFO L175 Difference]: Start difference. First operand has 104 places, 120 transitions, 1064 flow. Second operand 8 states and 165 transitions. [2024-06-04 17:19:34,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 151 transitions, 1492 flow [2024-06-04 17:19:34,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 151 transitions, 1423 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-04 17:19:34,527 INFO L231 Difference]: Finished difference. Result has 108 places, 121 transitions, 1142 flow [2024-06-04 17:19:34,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1142, PETRI_PLACES=108, PETRI_TRANSITIONS=121} [2024-06-04 17:19:34,528 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 64 predicate places. [2024-06-04 17:19:34,528 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 121 transitions, 1142 flow [2024-06-04 17:19:34,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:34,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:34,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:34,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:19:34,529 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:19:34,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:34,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1001754110, now seen corresponding path program 2 times [2024-06-04 17:19:34,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:34,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784396148] [2024-06-04 17:19:34,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:34,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:48,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784396148] [2024-06-04 17:19:48,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784396148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:48,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:48,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:19:48,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562399345] [2024-06-04 17:19:48,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:48,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:19:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:19:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:19:48,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:19:48,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 121 transitions, 1142 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:48,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:48,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:19:48,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:50,137 INFO L124 PetriNetUnfolderBase]: 1918/3105 cut-off events. [2024-06-04 17:19:50,137 INFO L125 PetriNetUnfolderBase]: For 45194/45200 co-relation queries the response was YES. [2024-06-04 17:19:50,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15970 conditions, 3105 events. 1918/3105 cut-off events. For 45194/45200 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 17012 event pairs, 589 based on Foata normal form. 10/3114 useless extension candidates. Maximal degree in co-relation 15922. Up to 2777 conditions per place. [2024-06-04 17:19:50,157 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 111 selfloop transitions, 36 changer transitions 0/154 dead transitions. [2024-06-04 17:19:50,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 154 transitions, 1602 flow [2024-06-04 17:19:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:19:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:19:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-04 17:19:50,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45930232558139533 [2024-06-04 17:19:50,165 INFO L175 Difference]: Start difference. First operand has 108 places, 121 transitions, 1142 flow. Second operand 8 states and 158 transitions. [2024-06-04 17:19:50,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 154 transitions, 1602 flow [2024-06-04 17:19:50,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 154 transitions, 1469 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 17:19:50,194 INFO L231 Difference]: Finished difference. Result has 111 places, 129 transitions, 1188 flow [2024-06-04 17:19:50,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1188, PETRI_PLACES=111, PETRI_TRANSITIONS=129} [2024-06-04 17:19:50,195 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 67 predicate places. [2024-06-04 17:19:50,195 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 129 transitions, 1188 flow [2024-06-04 17:19:50,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:50,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:50,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:50,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:19:50,196 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:19:50,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash -535202470, now seen corresponding path program 3 times [2024-06-04 17:19:50,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:50,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812283020] [2024-06-04 17:19:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:20:03,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:03,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812283020] [2024-06-04 17:20:03,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812283020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:03,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:03,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:20:03,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238139578] [2024-06-04 17:20:03,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:03,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:20:03,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:03,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:20:03,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:20:03,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:20:03,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 129 transitions, 1188 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:03,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:03,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:20:03,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:05,421 INFO L124 PetriNetUnfolderBase]: 1935/3132 cut-off events. [2024-06-04 17:20:05,421 INFO L125 PetriNetUnfolderBase]: For 48661/48667 co-relation queries the response was YES. [2024-06-04 17:20:05,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16435 conditions, 3132 events. 1935/3132 cut-off events. For 48661/48667 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17192 event pairs, 525 based on Foata normal form. 10/3141 useless extension candidates. Maximal degree in co-relation 16385. Up to 2721 conditions per place. [2024-06-04 17:20:05,448 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 111 selfloop transitions, 43 changer transitions 0/161 dead transitions. [2024-06-04 17:20:05,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 161 transitions, 1732 flow [2024-06-04 17:20:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:20:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:20:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-04 17:20:05,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680232558139535 [2024-06-04 17:20:05,452 INFO L175 Difference]: Start difference. First operand has 111 places, 129 transitions, 1188 flow. Second operand 8 states and 161 transitions. [2024-06-04 17:20:05,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 161 transitions, 1732 flow [2024-06-04 17:20:05,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 161 transitions, 1657 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-04 17:20:05,490 INFO L231 Difference]: Finished difference. Result has 116 places, 133 transitions, 1286 flow [2024-06-04 17:20:05,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1286, PETRI_PLACES=116, PETRI_TRANSITIONS=133} [2024-06-04 17:20:05,491 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 72 predicate places. [2024-06-04 17:20:05,491 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 133 transitions, 1286 flow [2024-06-04 17:20:05,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:05,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:05,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:05,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:20:05,492 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:20:05,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1008010220, now seen corresponding path program 4 times [2024-06-04 17:20:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:05,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95817376] [2024-06-04 17:20:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:05,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:17,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-04 17:20:17,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:17,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95817376] [2024-06-04 17:20:17,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95817376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:17,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:17,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:20:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451411866] [2024-06-04 17:20:17,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:17,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:20:17,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:17,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:20:17,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:20:17,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:20:17,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 133 transitions, 1286 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:17,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:17,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:20:17,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:19,718 INFO L124 PetriNetUnfolderBase]: 1927/3110 cut-off events. [2024-06-04 17:20:19,718 INFO L125 PetriNetUnfolderBase]: For 51384/51390 co-relation queries the response was YES. [2024-06-04 17:20:19,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16274 conditions, 3110 events. 1927/3110 cut-off events. For 51384/51390 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 16976 event pairs, 577 based on Foata normal form. 10/3119 useless extension candidates. Maximal degree in co-relation 16223. Up to 2792 conditions per place. [2024-06-04 17:20:19,738 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 116 selfloop transitions, 35 changer transitions 0/158 dead transitions. [2024-06-04 17:20:19,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 158 transitions, 1672 flow [2024-06-04 17:20:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:20:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:20:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-04 17:20:19,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622093023255814 [2024-06-04 17:20:19,741 INFO L175 Difference]: Start difference. First operand has 116 places, 133 transitions, 1286 flow. Second operand 8 states and 159 transitions. [2024-06-04 17:20:19,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 158 transitions, 1672 flow [2024-06-04 17:20:19,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 158 transitions, 1573 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-04 17:20:19,783 INFO L231 Difference]: Finished difference. Result has 120 places, 133 transitions, 1264 flow [2024-06-04 17:20:19,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1264, PETRI_PLACES=120, PETRI_TRANSITIONS=133} [2024-06-04 17:20:19,783 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 76 predicate places. [2024-06-04 17:20:19,783 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 133 transitions, 1264 flow [2024-06-04 17:20:19,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:19,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:19,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:19,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:20:19,784 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:20:19,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1092839251, now seen corresponding path program 2 times [2024-06-04 17:20:19,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:19,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152568745] [2024-06-04 17:20:19,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:19,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:20:34,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:34,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152568745] [2024-06-04 17:20:34,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152568745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:34,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:34,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:20:34,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447315705] [2024-06-04 17:20:34,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:34,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:20:34,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:34,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:20:34,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:20:34,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 17:20:34,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 133 transitions, 1264 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:34,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:34,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 17:20:34,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:36,105 INFO L124 PetriNetUnfolderBase]: 1808/2975 cut-off events. [2024-06-04 17:20:36,105 INFO L125 PetriNetUnfolderBase]: For 54346/54361 co-relation queries the response was YES. [2024-06-04 17:20:36,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15678 conditions, 2975 events. 1808/2975 cut-off events. For 54346/54361 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16713 event pairs, 573 based on Foata normal form. 16/2972 useless extension candidates. Maximal degree in co-relation 15625. Up to 2629 conditions per place. [2024-06-04 17:20:36,125 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 88 selfloop transitions, 35 changer transitions 0/144 dead transitions. [2024-06-04 17:20:36,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 144 transitions, 1562 flow [2024-06-04 17:20:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:20:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:20:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2024-06-04 17:20:36,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46124031007751937 [2024-06-04 17:20:36,127 INFO L175 Difference]: Start difference. First operand has 120 places, 133 transitions, 1264 flow. Second operand 6 states and 119 transitions. [2024-06-04 17:20:36,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 144 transitions, 1562 flow [2024-06-04 17:20:36,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 144 transitions, 1449 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 17:20:36,157 INFO L231 Difference]: Finished difference. Result has 117 places, 136 transitions, 1263 flow [2024-06-04 17:20:36,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1263, PETRI_PLACES=117, PETRI_TRANSITIONS=136} [2024-06-04 17:20:36,157 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 73 predicate places. [2024-06-04 17:20:36,158 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 136 transitions, 1263 flow [2024-06-04 17:20:36,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:36,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:36,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:36,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:20:36,159 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:20:36,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:36,159 INFO L85 PathProgramCache]: Analyzing trace with hash -389043106, now seen corresponding path program 5 times [2024-06-04 17:20:36,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:36,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780876891] [2024-06-04 17:20:36,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:36,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:20:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:50,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780876891] [2024-06-04 17:20:50,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780876891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:50,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:50,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:20:50,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750927552] [2024-06-04 17:20:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:50,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:20:50,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:50,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:20:50,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:20:50,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:20:50,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 136 transitions, 1263 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:50,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:50,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:20:50,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:52,113 INFO L124 PetriNetUnfolderBase]: 2205/3586 cut-off events. [2024-06-04 17:20:52,113 INFO L125 PetriNetUnfolderBase]: For 64266/64270 co-relation queries the response was YES. [2024-06-04 17:20:52,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18923 conditions, 3586 events. 2205/3586 cut-off events. For 64266/64270 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 20499 event pairs, 534 based on Foata normal form. 20/3605 useless extension candidates. Maximal degree in co-relation 18871. Up to 2834 conditions per place. [2024-06-04 17:20:52,137 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 134 selfloop transitions, 65 changer transitions 0/206 dead transitions. [2024-06-04 17:20:52,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 206 transitions, 2067 flow [2024-06-04 17:20:52,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:20:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:20:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 225 transitions. [2024-06-04 17:20:52,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47568710359408034 [2024-06-04 17:20:52,141 INFO L175 Difference]: Start difference. First operand has 117 places, 136 transitions, 1263 flow. Second operand 11 states and 225 transitions. [2024-06-04 17:20:52,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 206 transitions, 2067 flow [2024-06-04 17:20:52,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 206 transitions, 1971 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-04 17:20:52,192 INFO L231 Difference]: Finished difference. Result has 127 places, 157 transitions, 1610 flow [2024-06-04 17:20:52,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1610, PETRI_PLACES=127, PETRI_TRANSITIONS=157} [2024-06-04 17:20:52,193 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 83 predicate places. [2024-06-04 17:20:52,193 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 157 transitions, 1610 flow [2024-06-04 17:20:52,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:52,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:52,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:52,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:20:52,194 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:20:52,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash 306548640, now seen corresponding path program 6 times [2024-06-04 17:20:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:52,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449055794] [2024-06-04 17:20:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:04,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:04,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449055794] [2024-06-04 17:21:04,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449055794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:04,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:04,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:21:04,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847413756] [2024-06-04 17:21:04,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:04,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:21:04,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:04,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:21:04,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:21:04,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:21:04,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 157 transitions, 1610 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:04,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:04,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:21:04,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:06,642 INFO L124 PetriNetUnfolderBase]: 2694/4460 cut-off events. [2024-06-04 17:21:06,643 INFO L125 PetriNetUnfolderBase]: For 88048/88050 co-relation queries the response was YES. [2024-06-04 17:21:06,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24679 conditions, 4460 events. 2694/4460 cut-off events. For 88048/88050 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 27451 event pairs, 433 based on Foata normal form. 18/4477 useless extension candidates. Maximal degree in co-relation 24623. Up to 2550 conditions per place. [2024-06-04 17:21:06,673 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 137 selfloop transitions, 82 changer transitions 0/226 dead transitions. [2024-06-04 17:21:06,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 226 transitions, 2712 flow [2024-06-04 17:21:06,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:21:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:21:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions. [2024-06-04 17:21:06,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930232558139535 [2024-06-04 17:21:06,676 INFO L175 Difference]: Start difference. First operand has 127 places, 157 transitions, 1610 flow. Second operand 10 states and 212 transitions. [2024-06-04 17:21:06,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 226 transitions, 2712 flow [2024-06-04 17:21:06,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 226 transitions, 2543 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-04 17:21:06,765 INFO L231 Difference]: Finished difference. Result has 133 places, 174 transitions, 1992 flow [2024-06-04 17:21:06,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1485, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1992, PETRI_PLACES=133, PETRI_TRANSITIONS=174} [2024-06-04 17:21:06,766 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places. [2024-06-04 17:21:06,766 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 174 transitions, 1992 flow [2024-06-04 17:21:06,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:06,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:06,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:06,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:21:06,767 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:21:06,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1392729740, now seen corresponding path program 7 times [2024-06-04 17:21:06,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:06,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350526624] [2024-06-04 17:21:06,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:06,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:17,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:17,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350526624] [2024-06-04 17:21:17,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350526624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:17,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:17,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:21:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578185154] [2024-06-04 17:21:17,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:17,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:21:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:17,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:21:17,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:21:18,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:21:18,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 174 transitions, 1992 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:18,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:18,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:21:18,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:20,121 INFO L124 PetriNetUnfolderBase]: 2893/4809 cut-off events. [2024-06-04 17:21:20,122 INFO L125 PetriNetUnfolderBase]: For 92782/92784 co-relation queries the response was YES. [2024-06-04 17:21:20,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26536 conditions, 4809 events. 2893/4809 cut-off events. For 92782/92784 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 30265 event pairs, 941 based on Foata normal form. 26/4834 useless extension candidates. Maximal degree in co-relation 26477. Up to 3722 conditions per place. [2024-06-04 17:21:20,154 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 158 selfloop transitions, 63 changer transitions 0/228 dead transitions. [2024-06-04 17:21:20,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 228 transitions, 2800 flow [2024-06-04 17:21:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:21:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:21:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 206 transitions. [2024-06-04 17:21:20,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790697674418605 [2024-06-04 17:21:20,157 INFO L175 Difference]: Start difference. First operand has 133 places, 174 transitions, 1992 flow. Second operand 10 states and 206 transitions. [2024-06-04 17:21:20,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 228 transitions, 2800 flow [2024-06-04 17:21:20,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 228 transitions, 2637 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-04 17:21:20,265 INFO L231 Difference]: Finished difference. Result has 138 places, 185 transitions, 2208 flow [2024-06-04 17:21:20,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2208, PETRI_PLACES=138, PETRI_TRANSITIONS=185} [2024-06-04 17:21:20,266 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 94 predicate places. [2024-06-04 17:21:20,266 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 185 transitions, 2208 flow [2024-06-04 17:21:20,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:20,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:20,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:20,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:21:20,267 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:21:20,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1798403215, now seen corresponding path program 1 times [2024-06-04 17:21:20,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:20,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483057678] [2024-06-04 17:21:20,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:20,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:33,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:33,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483057678] [2024-06-04 17:21:33,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483057678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:33,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:33,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:21:33,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498132852] [2024-06-04 17:21:33,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:33,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:21:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:33,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:21:33,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:21:34,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 17:21:34,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 185 transitions, 2208 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:34,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:34,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 17:21:34,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:35,669 INFO L124 PetriNetUnfolderBase]: 2733/4620 cut-off events. [2024-06-04 17:21:35,669 INFO L125 PetriNetUnfolderBase]: For 77544/77544 co-relation queries the response was YES. [2024-06-04 17:21:35,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25223 conditions, 4620 events. 2733/4620 cut-off events. For 77544/77544 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 29598 event pairs, 1230 based on Foata normal form. 2/4621 useless extension candidates. Maximal degree in co-relation 25162. Up to 4234 conditions per place. [2024-06-04 17:21:35,703 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 180 selfloop transitions, 12 changer transitions 0/200 dead transitions. [2024-06-04 17:21:35,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 200 transitions, 2670 flow [2024-06-04 17:21:35,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:21:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:21:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-04 17:21:35,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4689922480620155 [2024-06-04 17:21:35,705 INFO L175 Difference]: Start difference. First operand has 138 places, 185 transitions, 2208 flow. Second operand 6 states and 121 transitions. [2024-06-04 17:21:35,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 200 transitions, 2670 flow [2024-06-04 17:21:35,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 200 transitions, 2562 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 17:21:35,794 INFO L231 Difference]: Finished difference. Result has 137 places, 188 transitions, 2166 flow [2024-06-04 17:21:35,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2166, PETRI_PLACES=137, PETRI_TRANSITIONS=188} [2024-06-04 17:21:35,794 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 93 predicate places. [2024-06-04 17:21:35,795 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 188 transitions, 2166 flow [2024-06-04 17:21:35,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:35,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:35,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:35,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:21:35,795 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:21:35,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1792689295, now seen corresponding path program 2 times [2024-06-04 17:21:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:35,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438901183] [2024-06-04 17:21:35,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:35,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:49,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:49,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438901183] [2024-06-04 17:21:49,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438901183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:49,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:49,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:21:49,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607095961] [2024-06-04 17:21:49,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:49,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:21:49,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:21:49,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:21:49,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 17:21:49,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 188 transitions, 2166 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:49,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:49,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 17:21:49,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:51,198 INFO L124 PetriNetUnfolderBase]: 2735/4626 cut-off events. [2024-06-04 17:21:51,198 INFO L125 PetriNetUnfolderBase]: For 80752/80754 co-relation queries the response was YES. [2024-06-04 17:21:51,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25451 conditions, 4626 events. 2735/4626 cut-off events. For 80752/80754 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 29657 event pairs, 1234 based on Foata normal form. 4/4629 useless extension candidates. Maximal degree in co-relation 25389. Up to 4228 conditions per place. [2024-06-04 17:21:51,229 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 176 selfloop transitions, 17 changer transitions 0/201 dead transitions. [2024-06-04 17:21:51,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 201 transitions, 2624 flow [2024-06-04 17:21:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:21:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:21:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-04 17:21:51,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4689922480620155 [2024-06-04 17:21:51,230 INFO L175 Difference]: Start difference. First operand has 137 places, 188 transitions, 2166 flow. Second operand 6 states and 121 transitions. [2024-06-04 17:21:51,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 201 transitions, 2624 flow [2024-06-04 17:21:51,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 201 transitions, 2580 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-04 17:21:51,299 INFO L231 Difference]: Finished difference. Result has 139 places, 191 transitions, 2204 flow [2024-06-04 17:21:51,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2204, PETRI_PLACES=139, PETRI_TRANSITIONS=191} [2024-06-04 17:21:51,300 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 95 predicate places. [2024-06-04 17:21:51,300 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 191 transitions, 2204 flow [2024-06-04 17:21:51,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:51,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:51,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:51,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:21:51,301 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:21:51,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:51,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1792681359, now seen corresponding path program 1 times [2024-06-04 17:21:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:51,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608468286] [2024-06-04 17:21:51,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:06,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:06,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608468286] [2024-06-04 17:22:06,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608468286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:06,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:06,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:22:06,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73299990] [2024-06-04 17:22:06,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:06,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:22:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:22:06,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:22:06,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 17:22:06,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 191 transitions, 2204 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:06,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:06,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 17:22:06,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:08,046 INFO L124 PetriNetUnfolderBase]: 2710/4593 cut-off events. [2024-06-04 17:22:08,046 INFO L125 PetriNetUnfolderBase]: For 86017/86017 co-relation queries the response was YES. [2024-06-04 17:22:08,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25779 conditions, 4593 events. 2710/4593 cut-off events. For 86017/86017 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 29666 event pairs, 1248 based on Foata normal form. 1/4580 useless extension candidates. Maximal degree in co-relation 25716. Up to 4193 conditions per place. [2024-06-04 17:22:08,082 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 168 selfloop transitions, 15 changer transitions 0/203 dead transitions. [2024-06-04 17:22:08,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 203 transitions, 2634 flow [2024-06-04 17:22:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:22:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:22:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-04 17:22:08,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-04 17:22:08,083 INFO L175 Difference]: Start difference. First operand has 139 places, 191 transitions, 2204 flow. Second operand 7 states and 133 transitions. [2024-06-04 17:22:08,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 203 transitions, 2634 flow [2024-06-04 17:22:08,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 203 transitions, 2574 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-04 17:22:08,204 INFO L231 Difference]: Finished difference. Result has 142 places, 194 transitions, 2220 flow [2024-06-04 17:22:08,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2220, PETRI_PLACES=142, PETRI_TRANSITIONS=194} [2024-06-04 17:22:08,205 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 98 predicate places. [2024-06-04 17:22:08,205 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 194 transitions, 2220 flow [2024-06-04 17:22:08,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:08,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:08,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:08,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:22:08,206 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:22:08,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash 742020906, now seen corresponding path program 1 times [2024-06-04 17:22:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:08,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270502151] [2024-06-04 17:22:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:08,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270502151] [2024-06-04 17:22:22,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270502151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:22,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:22,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:22,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150071731] [2024-06-04 17:22:22,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:22,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:22,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:22,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:22,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:23,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:22:23,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 194 transitions, 2220 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:23,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:23,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:22:23,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:25,765 INFO L124 PetriNetUnfolderBase]: 3266/5541 cut-off events. [2024-06-04 17:22:25,765 INFO L125 PetriNetUnfolderBase]: For 112823/112823 co-relation queries the response was YES. [2024-06-04 17:22:25,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31371 conditions, 5541 events. 3266/5541 cut-off events. For 112823/112823 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 37084 event pairs, 1039 based on Foata normal form. 12/5551 useless extension candidates. Maximal degree in co-relation 31307. Up to 4097 conditions per place. [2024-06-04 17:22:25,803 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 155 selfloop transitions, 96 changer transitions 0/258 dead transitions. [2024-06-04 17:22:25,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 258 transitions, 3337 flow [2024-06-04 17:22:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-04 17:22:25,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48320413436692505 [2024-06-04 17:22:25,806 INFO L175 Difference]: Start difference. First operand has 142 places, 194 transitions, 2220 flow. Second operand 9 states and 187 transitions. [2024-06-04 17:22:25,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 258 transitions, 3337 flow [2024-06-04 17:22:25,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 258 transitions, 3283 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-04 17:22:25,936 INFO L231 Difference]: Finished difference. Result has 148 places, 220 transitions, 2875 flow [2024-06-04 17:22:25,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2875, PETRI_PLACES=148, PETRI_TRANSITIONS=220} [2024-06-04 17:22:25,937 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 104 predicate places. [2024-06-04 17:22:25,937 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 220 transitions, 2875 flow [2024-06-04 17:22:25,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:25,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:25,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-04 17:22:25,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:22:25,938 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:22:25,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:25,938 INFO L85 PathProgramCache]: Analyzing trace with hash 855426887, now seen corresponding path program 1 times [2024-06-04 17:22:25,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:25,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478381971] [2024-06-04 17:22:25,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:25,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:40,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:40,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478381971] [2024-06-04 17:22:40,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478381971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:40,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:40,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:22:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96311785] [2024-06-04 17:22:40,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:40,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:22:40,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:40,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:22:40,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:22:40,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:22:40,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 220 transitions, 2875 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:40,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:40,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:22:40,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:42,140 INFO L124 PetriNetUnfolderBase]: 3224/5451 cut-off events. [2024-06-04 17:22:42,141 INFO L125 PetriNetUnfolderBase]: For 119391/119397 co-relation queries the response was YES. [2024-06-04 17:22:42,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32385 conditions, 5451 events. 3224/5451 cut-off events. For 119391/119397 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 36330 event pairs, 1157 based on Foata normal form. 2/5431 useless extension candidates. Maximal degree in co-relation 32318. Up to 4985 conditions per place. [2024-06-04 17:22:42,186 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 181 selfloop transitions, 37 changer transitions 0/237 dead transitions. [2024-06-04 17:22:42,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 237 transitions, 3397 flow [2024-06-04 17:22:42,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:22:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:22:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-04 17:22:42,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-04 17:22:42,188 INFO L175 Difference]: Start difference. First operand has 148 places, 220 transitions, 2875 flow. Second operand 7 states and 133 transitions. [2024-06-04 17:22:42,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 237 transitions, 3397 flow [2024-06-04 17:22:42,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 237 transitions, 3259 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-04 17:22:42,324 INFO L231 Difference]: Finished difference. Result has 151 places, 223 transitions, 2857 flow [2024-06-04 17:22:42,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2737, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2857, PETRI_PLACES=151, PETRI_TRANSITIONS=223} [2024-06-04 17:22:42,324 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 107 predicate places. [2024-06-04 17:22:42,324 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 223 transitions, 2857 flow [2024-06-04 17:22:42,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:42,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:42,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:42,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:22:42,325 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:22:42,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:42,325 INFO L85 PathProgramCache]: Analyzing trace with hash -35019928, now seen corresponding path program 2 times [2024-06-04 17:22:42,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:42,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127761756] [2024-06-04 17:22:42,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:42,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:57,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:57,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127761756] [2024-06-04 17:22:57,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127761756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:57,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:57,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:57,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867554204] [2024-06-04 17:22:57,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:57,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:57,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:57,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:57,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:57,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:22:57,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 223 transitions, 2857 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:57,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:57,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:22:57,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:59,898 INFO L124 PetriNetUnfolderBase]: 3396/5754 cut-off events. [2024-06-04 17:22:59,898 INFO L125 PetriNetUnfolderBase]: For 129017/129017 co-relation queries the response was YES. [2024-06-04 17:22:59,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33976 conditions, 5754 events. 3396/5754 cut-off events. For 129017/129017 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 38636 event pairs, 1101 based on Foata normal form. 12/5765 useless extension candidates. Maximal degree in co-relation 33908. Up to 4868 conditions per place. [2024-06-04 17:22:59,941 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 164 selfloop transitions, 93 changer transitions 0/265 dead transitions. [2024-06-04 17:22:59,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 265 transitions, 3627 flow [2024-06-04 17:22:59,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-06-04 17:22:59,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4754521963824289 [2024-06-04 17:22:59,944 INFO L175 Difference]: Start difference. First operand has 151 places, 223 transitions, 2857 flow. Second operand 9 states and 184 transitions. [2024-06-04 17:22:59,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 265 transitions, 3627 flow [2024-06-04 17:23:00,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 265 transitions, 3529 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-04 17:23:00,092 INFO L231 Difference]: Finished difference. Result has 157 places, 231 transitions, 3084 flow [2024-06-04 17:23:00,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2759, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3084, PETRI_PLACES=157, PETRI_TRANSITIONS=231} [2024-06-04 17:23:00,092 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 113 predicate places. [2024-06-04 17:23:00,093 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 231 transitions, 3084 flow [2024-06-04 17:23:00,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:00,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:00,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:00,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:23:00,093 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:23:00,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1852121414, now seen corresponding path program 3 times [2024-06-04 17:23:00,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:00,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971683618] [2024-06-04 17:23:00,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:00,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:23:13,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:13,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971683618] [2024-06-04 17:23:13,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971683618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:13,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:13,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:23:13,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166151473] [2024-06-04 17:23:13,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:13,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:23:13,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:13,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:23:13,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:23:13,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:23:13,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 231 transitions, 3084 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:13,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:13,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:23:13,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:16,179 INFO L124 PetriNetUnfolderBase]: 3482/5918 cut-off events. [2024-06-04 17:23:16,179 INFO L125 PetriNetUnfolderBase]: For 141021/141025 co-relation queries the response was YES. [2024-06-04 17:23:16,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35684 conditions, 5918 events. 3482/5918 cut-off events. For 141021/141025 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 40157 event pairs, 1105 based on Foata normal form. 12/5927 useless extension candidates. Maximal degree in co-relation 35613. Up to 3956 conditions per place. [2024-06-04 17:23:16,226 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 151 selfloop transitions, 111 changer transitions 0/270 dead transitions. [2024-06-04 17:23:16,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 270 transitions, 3903 flow [2024-06-04 17:23:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:23:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:23:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-04 17:23:16,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4780361757105943 [2024-06-04 17:23:16,229 INFO L175 Difference]: Start difference. First operand has 157 places, 231 transitions, 3084 flow. Second operand 9 states and 185 transitions. [2024-06-04 17:23:16,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 270 transitions, 3903 flow [2024-06-04 17:23:16,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 270 transitions, 3769 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-04 17:23:16,391 INFO L231 Difference]: Finished difference. Result has 164 places, 233 transitions, 3276 flow [2024-06-04 17:23:16,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2950, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3276, PETRI_PLACES=164, PETRI_TRANSITIONS=233} [2024-06-04 17:23:16,392 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 120 predicate places. [2024-06-04 17:23:16,392 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 233 transitions, 3276 flow [2024-06-04 17:23:16,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:16,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:16,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:16,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:23:16,393 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-04 17:23:16,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1183544220, now seen corresponding path program 4 times [2024-06-04 17:23:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:16,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726375061] [2024-06-04 17:23:16,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:23:30,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:30,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726375061] [2024-06-04 17:23:30,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726375061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:30,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:30,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:23:30,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948668682] [2024-06-04 17:23:30,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:30,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:23:30,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:30,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:23:30,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:23:31,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:23:31,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 233 transitions, 3276 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:31,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:31,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:23:31,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:33,374 INFO L124 PetriNetUnfolderBase]: 3458/5882 cut-off events. [2024-06-04 17:23:33,374 INFO L125 PetriNetUnfolderBase]: For 141177/141177 co-relation queries the response was YES. [2024-06-04 17:23:33,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35186 conditions, 5882 events. 3458/5882 cut-off events. For 141177/141177 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 39920 event pairs, 1119 based on Foata normal form. 12/5893 useless extension candidates. Maximal degree in co-relation 35113. Up to 4978 conditions per place. [2024-06-04 17:23:33,427 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 166 selfloop transitions, 91 changer transitions 0/265 dead transitions. [2024-06-04 17:23:33,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 265 transitions, 3904 flow [2024-06-04 17:23:33,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:23:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:23:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-06-04 17:23:33,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4754521963824289 [2024-06-04 17:23:33,430 INFO L175 Difference]: Start difference. First operand has 164 places, 233 transitions, 3276 flow. Second operand 9 states and 184 transitions. [2024-06-04 17:23:33,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 265 transitions, 3904 flow [2024-06-04 17:23:33,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 265 transitions, 3688 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-04 17:23:33,735 INFO L231 Difference]: Finished difference. Result has 166 places, 232 transitions, 3196 flow [2024-06-04 17:23:33,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3010, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3196, PETRI_PLACES=166, PETRI_TRANSITIONS=232} [2024-06-04 17:23:33,735 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 122 predicate places. [2024-06-04 17:23:33,735 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 232 transitions, 3196 flow [2024-06-04 17:23:33,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:33,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:33,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:33,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:23:33,736 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:23:33,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:33,736 INFO L85 PathProgramCache]: Analyzing trace with hash 261023851, now seen corresponding path program 2 times [2024-06-04 17:23:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:33,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53708452] [2024-06-04 17:23:33,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:33,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:49,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-04 17:23:49,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:49,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53708452] [2024-06-04 17:23:49,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53708452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:49,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:49,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:23:49,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178226925] [2024-06-04 17:23:49,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:49,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:23:49,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:23:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:23:49,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:23:49,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 232 transitions, 3196 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:49,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:49,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:23:49,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:51,207 INFO L124 PetriNetUnfolderBase]: 3378/5732 cut-off events. [2024-06-04 17:23:51,207 INFO L125 PetriNetUnfolderBase]: For 138964/138973 co-relation queries the response was YES. [2024-06-04 17:23:51,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34316 conditions, 5732 events. 3378/5732 cut-off events. For 138964/138973 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 38682 event pairs, 1125 based on Foata normal form. 5/5699 useless extension candidates. Maximal degree in co-relation 34242. Up to 5237 conditions per place. [2024-06-04 17:23:51,252 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 181 selfloop transitions, 48 changer transitions 0/248 dead transitions. [2024-06-04 17:23:51,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 248 transitions, 3832 flow [2024-06-04 17:23:51,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:23:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:23:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 17:23:51,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-04 17:23:51,253 INFO L175 Difference]: Start difference. First operand has 166 places, 232 transitions, 3196 flow. Second operand 7 states and 131 transitions. [2024-06-04 17:23:51,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 248 transitions, 3832 flow [2024-06-04 17:23:51,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 248 transitions, 3471 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-04 17:23:51,397 INFO L231 Difference]: Finished difference. Result has 164 places, 238 transitions, 3023 flow [2024-06-04 17:23:51,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2835, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3023, PETRI_PLACES=164, PETRI_TRANSITIONS=238} [2024-06-04 17:23:51,398 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 120 predicate places. [2024-06-04 17:23:51,398 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 238 transitions, 3023 flow [2024-06-04 17:23:51,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:51,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:51,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:51,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:23:51,398 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:23:51,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:51,398 INFO L85 PathProgramCache]: Analyzing trace with hash 261439561, now seen corresponding path program 3 times [2024-06-04 17:23:51,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:51,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454782980] [2024-06-04 17:23:51,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:51,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:06,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:06,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454782980] [2024-06-04 17:24:06,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454782980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:06,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:06,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:24:06,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800968286] [2024-06-04 17:24:06,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:06,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:24:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:06,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:24:06,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:24:06,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:24:06,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 238 transitions, 3023 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:06,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:06,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:24:06,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:08,703 INFO L124 PetriNetUnfolderBase]: 3372/5734 cut-off events. [2024-06-04 17:24:08,703 INFO L125 PetriNetUnfolderBase]: For 140775/140786 co-relation queries the response was YES. [2024-06-04 17:24:08,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33613 conditions, 5734 events. 3372/5734 cut-off events. For 140775/140786 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 38700 event pairs, 1166 based on Foata normal form. 10/5713 useless extension candidates. Maximal degree in co-relation 33541. Up to 5232 conditions per place. [2024-06-04 17:24:08,760 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 179 selfloop transitions, 49 changer transitions 0/247 dead transitions. [2024-06-04 17:24:08,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 247 transitions, 3509 flow [2024-06-04 17:24:08,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:24:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:24:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-04 17:24:08,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:24:08,761 INFO L175 Difference]: Start difference. First operand has 164 places, 238 transitions, 3023 flow. Second operand 7 states and 129 transitions. [2024-06-04 17:24:08,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 247 transitions, 3509 flow [2024-06-04 17:24:08,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 247 transitions, 3395 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-06-04 17:24:08,924 INFO L231 Difference]: Finished difference. Result has 168 places, 238 transitions, 3013 flow [2024-06-04 17:24:08,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2909, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3013, PETRI_PLACES=168, PETRI_TRANSITIONS=238} [2024-06-04 17:24:08,924 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 124 predicate places. [2024-06-04 17:24:08,925 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 238 transitions, 3013 flow [2024-06-04 17:24:08,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:08,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:08,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:08,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:24:08,925 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:24:08,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:08,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1266985885, now seen corresponding path program 1 times [2024-06-04 17:24:08,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:08,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020106961] [2024-06-04 17:24:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:08,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:24,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:24,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020106961] [2024-06-04 17:24:24,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020106961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:24,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:24,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:24:24,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118428891] [2024-06-04 17:24:24,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:24,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:24:24,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:24,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:24:24,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:24:24,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 17:24:24,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 238 transitions, 3013 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:24,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:24,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 17:24:24,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:26,754 INFO L124 PetriNetUnfolderBase]: 3290/5680 cut-off events. [2024-06-04 17:24:26,754 INFO L125 PetriNetUnfolderBase]: For 130063/130063 co-relation queries the response was YES. [2024-06-04 17:24:26,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32708 conditions, 5680 events. 3290/5680 cut-off events. For 130063/130063 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 38941 event pairs, 1432 based on Foata normal form. 1/5680 useless extension candidates. Maximal degree in co-relation 32634. Up to 5167 conditions per place. [2024-06-04 17:24:26,796 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 230 selfloop transitions, 15 changer transitions 0/256 dead transitions. [2024-06-04 17:24:26,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 256 transitions, 3609 flow [2024-06-04 17:24:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:24:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:24:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-04 17:24:26,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4584717607973422 [2024-06-04 17:24:26,798 INFO L175 Difference]: Start difference. First operand has 168 places, 238 transitions, 3013 flow. Second operand 7 states and 138 transitions. [2024-06-04 17:24:26,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 256 transitions, 3609 flow [2024-06-04 17:24:26,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 256 transitions, 3503 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 17:24:26,960 INFO L231 Difference]: Finished difference. Result has 169 places, 241 transitions, 2993 flow [2024-06-04 17:24:26,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2907, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2993, PETRI_PLACES=169, PETRI_TRANSITIONS=241} [2024-06-04 17:24:26,961 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 125 predicate places. [2024-06-04 17:24:26,961 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 241 transitions, 2993 flow [2024-06-04 17:24:26,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:26,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:26,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:26,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:24:26,962 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:24:26,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:26,962 INFO L85 PathProgramCache]: Analyzing trace with hash 84076843, now seen corresponding path program 1 times [2024-06-04 17:24:26,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:26,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228395760] [2024-06-04 17:24:26,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:26,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:41,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:41,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228395760] [2024-06-04 17:24:41,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228395760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:41,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:41,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:24:41,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408592149] [2024-06-04 17:24:41,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:41,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:24:41,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:41,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:24:41,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:24:41,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:24:41,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 241 transitions, 2993 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:41,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:41,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:24:41,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:43,450 INFO L124 PetriNetUnfolderBase]: 3377/5771 cut-off events. [2024-06-04 17:24:43,450 INFO L125 PetriNetUnfolderBase]: For 136839/136839 co-relation queries the response was YES. [2024-06-04 17:24:43,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33680 conditions, 5771 events. 3377/5771 cut-off events. For 136839/136839 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 39153 event pairs, 1459 based on Foata normal form. 2/5772 useless extension candidates. Maximal degree in co-relation 33605. Up to 5334 conditions per place. [2024-06-04 17:24:43,493 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 237 selfloop transitions, 15 changer transitions 0/258 dead transitions. [2024-06-04 17:24:43,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 258 transitions, 3595 flow [2024-06-04 17:24:43,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:24:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:24:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 17:24:43,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-04 17:24:43,494 INFO L175 Difference]: Start difference. First operand has 169 places, 241 transitions, 2993 flow. Second operand 7 states and 131 transitions. [2024-06-04 17:24:43,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 258 transitions, 3595 flow [2024-06-04 17:24:43,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 258 transitions, 3531 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-04 17:24:43,666 INFO L231 Difference]: Finished difference. Result has 171 places, 244 transitions, 3015 flow [2024-06-04 17:24:43,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2929, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3015, PETRI_PLACES=171, PETRI_TRANSITIONS=244} [2024-06-04 17:24:43,667 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 127 predicate places. [2024-06-04 17:24:43,667 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 244 transitions, 3015 flow [2024-06-04 17:24:43,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:43,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:43,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:43,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:24:43,668 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-04 17:24:43,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1271747671, now seen corresponding path program 2 times [2024-06-04 17:24:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:43,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77973714] [2024-06-04 17:24:43,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:58,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77973714] [2024-06-04 17:24:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77973714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:58,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:58,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:24:58,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986435975] [2024-06-04 17:24:58,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:58,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:24:58,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:58,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:24:58,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:24:58,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:24:58,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 244 transitions, 3015 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:58,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:58,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:24:58,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:00,697 INFO L124 PetriNetUnfolderBase]: 3395/5801 cut-off events. [2024-06-04 17:25:00,697 INFO L125 PetriNetUnfolderBase]: For 144892/144894 co-relation queries the response was YES. [2024-06-04 17:25:00,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34534 conditions, 5801 events. 3395/5801 cut-off events. For 144892/144894 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 39326 event pairs, 1466 based on Foata normal form. 4/5804 useless extension candidates. Maximal degree in co-relation 34458. Up to 5330 conditions per place. [2024-06-04 17:25:00,740 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 230 selfloop transitions, 27 changer transitions 0/263 dead transitions. [2024-06-04 17:25:00,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 263 transitions, 3747 flow [2024-06-04 17:25:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:25:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:25:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-04 17:25:00,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44518272425249167 [2024-06-04 17:25:00,741 INFO L175 Difference]: Start difference. First operand has 171 places, 244 transitions, 3015 flow. Second operand 7 states and 134 transitions. [2024-06-04 17:25:00,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 263 transitions, 3747 flow [2024-06-04 17:25:00,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 263 transitions, 3683 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-04 17:25:00,908 INFO L231 Difference]: Finished difference. Result has 173 places, 250 transitions, 3117 flow [2024-06-04 17:25:00,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2951, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3117, PETRI_PLACES=173, PETRI_TRANSITIONS=250} [2024-06-04 17:25:00,909 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 129 predicate places. [2024-06-04 17:25:00,909 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 250 transitions, 3117 flow [2024-06-04 17:25:00,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:00,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:00,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:00,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:25:00,909 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-04 17:25:00,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:00,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1460466069, now seen corresponding path program 3 times [2024-06-04 17:25:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:00,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328037139] [2024-06-04 17:25:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:25:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:15,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328037139] [2024-06-04 17:25:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328037139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:15,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:15,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:25:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135441738] [2024-06-04 17:25:15,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:15,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:25:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:25:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:25:16,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:25:16,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 250 transitions, 3117 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:16,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:16,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:25:16,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:17,813 INFO L124 PetriNetUnfolderBase]: 3389/5791 cut-off events. [2024-06-04 17:25:17,813 INFO L125 PetriNetUnfolderBase]: For 152158/152160 co-relation queries the response was YES. [2024-06-04 17:25:17,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35027 conditions, 5791 events. 3389/5791 cut-off events. For 152158/152160 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 39253 event pairs, 1463 based on Foata normal form. 4/5794 useless extension candidates. Maximal degree in co-relation 34950. Up to 5325 conditions per place. [2024-06-04 17:25:17,858 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 228 selfloop transitions, 28 changer transitions 0/262 dead transitions. [2024-06-04 17:25:17,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 262 transitions, 3671 flow [2024-06-04 17:25:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:25:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:25:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-04 17:25:17,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43853820598006643 [2024-06-04 17:25:17,859 INFO L175 Difference]: Start difference. First operand has 173 places, 250 transitions, 3117 flow. Second operand 7 states and 132 transitions. [2024-06-04 17:25:17,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 262 transitions, 3671 flow [2024-06-04 17:25:18,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 262 transitions, 3566 flow, removed 42 selfloop flow, removed 3 redundant places. [2024-06-04 17:25:18,034 INFO L231 Difference]: Finished difference. Result has 177 places, 250 transitions, 3074 flow [2024-06-04 17:25:18,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3012, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3074, PETRI_PLACES=177, PETRI_TRANSITIONS=250} [2024-06-04 17:25:18,035 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 133 predicate places. [2024-06-04 17:25:18,035 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 250 transitions, 3074 flow [2024-06-04 17:25:18,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:18,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:18,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:18,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:25:18,036 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-04 17:25:18,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1398832272, now seen corresponding path program 1 times [2024-06-04 17:25:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:18,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389750501] [2024-06-04 17:25:18,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:18,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:25:32,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:32,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389750501] [2024-06-04 17:25:32,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389750501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:32,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:32,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:25:32,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658615361] [2024-06-04 17:25:32,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:32,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:25:32,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:32,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:25:32,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:25:32,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:25:32,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 250 transitions, 3074 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:32,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:32,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:25:32,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:34,550 INFO L124 PetriNetUnfolderBase]: 3497/5931 cut-off events. [2024-06-04 17:25:34,550 INFO L125 PetriNetUnfolderBase]: For 180125/180129 co-relation queries the response was YES. [2024-06-04 17:25:34,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36867 conditions, 5931 events. 3497/5931 cut-off events. For 180125/180129 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 40170 event pairs, 1360 based on Foata normal form. 6/5936 useless extension candidates. Maximal degree in co-relation 36788. Up to 5412 conditions per place. [2024-06-04 17:25:34,599 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 231 selfloop transitions, 27 changer transitions 0/271 dead transitions. [2024-06-04 17:25:34,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 271 transitions, 3706 flow [2024-06-04 17:25:34,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:25:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:25:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-04 17:25:34,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4584717607973422 [2024-06-04 17:25:34,600 INFO L175 Difference]: Start difference. First operand has 177 places, 250 transitions, 3074 flow. Second operand 7 states and 138 transitions. [2024-06-04 17:25:34,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 271 transitions, 3706 flow [2024-06-04 17:25:34,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 271 transitions, 3642 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 17:25:34,789 INFO L231 Difference]: Finished difference. Result has 178 places, 253 transitions, 3120 flow [2024-06-04 17:25:34,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3010, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3120, PETRI_PLACES=178, PETRI_TRANSITIONS=253} [2024-06-04 17:25:34,790 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 134 predicate places. [2024-06-04 17:25:34,790 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 253 transitions, 3120 flow [2024-06-04 17:25:34,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:34,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:34,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:34,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:25:34,790 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-04 17:25:34,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:34,791 INFO L85 PathProgramCache]: Analyzing trace with hash -840029880, now seen corresponding path program 2 times [2024-06-04 17:25:34,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:34,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961506159] [2024-06-04 17:25:34,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:34,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:25:48,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:48,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961506159] [2024-06-04 17:25:48,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961506159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:48,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:48,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:25:48,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972065383] [2024-06-04 17:25:48,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:48,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:25:48,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:48,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:25:48,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:25:48,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:25:48,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 253 transitions, 3120 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:48,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:48,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:25:48,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:50,828 INFO L124 PetriNetUnfolderBase]: 3521/5971 cut-off events. [2024-06-04 17:25:50,828 INFO L125 PetriNetUnfolderBase]: For 192070/192074 co-relation queries the response was YES. [2024-06-04 17:25:50,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37910 conditions, 5971 events. 3521/5971 cut-off events. For 192070/192074 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 40533 event pairs, 1361 based on Foata normal form. 6/5976 useless extension candidates. Maximal degree in co-relation 37830. Up to 5426 conditions per place. [2024-06-04 17:25:50,881 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 233 selfloop transitions, 32 changer transitions 0/278 dead transitions. [2024-06-04 17:25:50,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 278 transitions, 3903 flow [2024-06-04 17:25:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:25:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:25:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-04 17:25:50,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4584717607973422 [2024-06-04 17:25:50,883 INFO L175 Difference]: Start difference. First operand has 178 places, 253 transitions, 3120 flow. Second operand 7 states and 138 transitions. [2024-06-04 17:25:50,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 278 transitions, 3903 flow [2024-06-04 17:25:51,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 278 transitions, 3831 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-04 17:25:51,124 INFO L231 Difference]: Finished difference. Result has 182 places, 261 transitions, 3252 flow [2024-06-04 17:25:51,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3048, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3252, PETRI_PLACES=182, PETRI_TRANSITIONS=261} [2024-06-04 17:25:51,124 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 138 predicate places. [2024-06-04 17:25:51,124 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 261 transitions, 3252 flow [2024-06-04 17:25:51,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:51,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:51,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:51,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:25:51,125 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:25:51,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1404554128, now seen corresponding path program 1 times [2024-06-04 17:25:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:51,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045582789] [2024-06-04 17:25:51,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:26:05,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:05,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045582789] [2024-06-04 17:26:05,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045582789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:05,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:05,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:26:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058871177] [2024-06-04 17:26:05,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:05,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:26:05,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:05,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:26:05,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:26:05,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:26:05,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 261 transitions, 3252 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 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-04 17:26:05,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:05,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:26:05,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:07,946 INFO L124 PetriNetUnfolderBase]: 3440/5843 cut-off events. [2024-06-04 17:26:07,947 INFO L125 PetriNetUnfolderBase]: For 200131/200145 co-relation queries the response was YES. [2024-06-04 17:26:07,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37895 conditions, 5843 events. 3440/5843 cut-off events. For 200131/200145 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 39576 event pairs, 1230 based on Foata normal form. 5/5821 useless extension candidates. Maximal degree in co-relation 37813. Up to 5305 conditions per place. [2024-06-04 17:26:08,000 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 215 selfloop transitions, 42 changer transitions 0/279 dead transitions. [2024-06-04 17:26:08,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 279 transitions, 3860 flow [2024-06-04 17:26:08,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:26:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:26:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-04 17:26:08,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4273255813953488 [2024-06-04 17:26:08,003 INFO L175 Difference]: Start difference. First operand has 182 places, 261 transitions, 3252 flow. Second operand 8 states and 147 transitions. [2024-06-04 17:26:08,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 279 transitions, 3860 flow [2024-06-04 17:26:08,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 279 transitions, 3781 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-04 17:26:08,194 INFO L231 Difference]: Finished difference. Result has 187 places, 264 transitions, 3309 flow [2024-06-04 17:26:08,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3173, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3309, PETRI_PLACES=187, PETRI_TRANSITIONS=264} [2024-06-04 17:26:08,195 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 143 predicate places. [2024-06-04 17:26:08,195 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 264 transitions, 3309 flow [2024-06-04 17:26:08,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 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-04 17:26:08,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:08,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:08,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:26:08,196 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:26:08,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1542722802, now seen corresponding path program 3 times [2024-06-04 17:26:08,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:08,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813099887] [2024-06-04 17:26:08,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:08,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:26:21,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:21,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813099887] [2024-06-04 17:26:21,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813099887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:21,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:21,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:26:21,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60528625] [2024-06-04 17:26:21,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:21,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:26:21,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:21,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:26:21,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:26:22,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:26:22,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 264 transitions, 3309 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:22,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:22,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:26:22,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:24,048 INFO L124 PetriNetUnfolderBase]: 3523/5975 cut-off events. [2024-06-04 17:26:24,048 INFO L125 PetriNetUnfolderBase]: For 208346/208356 co-relation queries the response was YES. [2024-06-04 17:26:24,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39162 conditions, 5975 events. 3523/5975 cut-off events. For 208346/208356 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 40522 event pairs, 1360 based on Foata normal form. 6/5975 useless extension candidates. Maximal degree in co-relation 39078. Up to 5450 conditions per place. [2024-06-04 17:26:24,099 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 242 selfloop transitions, 26 changer transitions 0/281 dead transitions. [2024-06-04 17:26:24,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 281 transitions, 3922 flow [2024-06-04 17:26:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:26:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:26:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-04 17:26:24,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4485049833887043 [2024-06-04 17:26:24,100 INFO L175 Difference]: Start difference. First operand has 187 places, 264 transitions, 3309 flow. Second operand 7 states and 135 transitions. [2024-06-04 17:26:24,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 281 transitions, 3922 flow [2024-06-04 17:26:24,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 281 transitions, 3778 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-04 17:26:24,328 INFO L231 Difference]: Finished difference. Result has 188 places, 265 transitions, 3236 flow [2024-06-04 17:26:24,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3169, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3236, PETRI_PLACES=188, PETRI_TRANSITIONS=265} [2024-06-04 17:26:24,329 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 144 predicate places. [2024-06-04 17:26:24,329 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 265 transitions, 3236 flow [2024-06-04 17:26:24,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:24,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:24,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:24,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:26:24,330 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:26:24,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash 625569410, now seen corresponding path program 4 times [2024-06-04 17:26:24,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:24,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531510769] [2024-06-04 17:26:24,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:24,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:26:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531510769] [2024-06-04 17:26:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531510769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:38,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:38,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:26:38,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303098278] [2024-06-04 17:26:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:38,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:26:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:38,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:26:38,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:26:38,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:26:38,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 265 transitions, 3236 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:38,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:38,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:26:38,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:40,409 INFO L124 PetriNetUnfolderBase]: 3538/5996 cut-off events. [2024-06-04 17:26:40,409 INFO L125 PetriNetUnfolderBase]: For 215911/215921 co-relation queries the response was YES. [2024-06-04 17:26:40,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39412 conditions, 5996 events. 3538/5996 cut-off events. For 215911/215921 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 40698 event pairs, 1358 based on Foata normal form. 6/5991 useless extension candidates. Maximal degree in co-relation 39327. Up to 5451 conditions per place. [2024-06-04 17:26:40,455 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 235 selfloop transitions, 34 changer transitions 0/282 dead transitions. [2024-06-04 17:26:40,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 282 transitions, 3884 flow [2024-06-04 17:26:40,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:26:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:26:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-04 17:26:40,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44518272425249167 [2024-06-04 17:26:40,456 INFO L175 Difference]: Start difference. First operand has 188 places, 265 transitions, 3236 flow. Second operand 7 states and 134 transitions. [2024-06-04 17:26:40,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 282 transitions, 3884 flow [2024-06-04 17:26:40,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 282 transitions, 3796 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 17:26:40,674 INFO L231 Difference]: Finished difference. Result has 188 places, 268 transitions, 3284 flow [2024-06-04 17:26:40,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3148, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3284, PETRI_PLACES=188, PETRI_TRANSITIONS=268} [2024-06-04 17:26:40,675 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 144 predicate places. [2024-06-04 17:26:40,675 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 268 transitions, 3284 flow [2024-06-04 17:26:40,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:40,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:40,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:40,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:26:40,676 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:26:40,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:40,676 INFO L85 PathProgramCache]: Analyzing trace with hash -492694926, now seen corresponding path program 5 times [2024-06-04 17:26:40,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:40,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435548350] [2024-06-04 17:26:40,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:40,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:26:54,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:54,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435548350] [2024-06-04 17:26:54,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435548350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:54,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:54,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:26:54,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946384854] [2024-06-04 17:26:54,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:54,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:26:54,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:54,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:26:54,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:26:55,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:26:55,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 268 transitions, 3284 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:55,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:55,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:26:55,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:57,095 INFO L124 PetriNetUnfolderBase]: 3554/6026 cut-off events. [2024-06-04 17:26:57,095 INFO L125 PetriNetUnfolderBase]: For 228673/228687 co-relation queries the response was YES. [2024-06-04 17:26:57,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40371 conditions, 6026 events. 3554/6026 cut-off events. For 228673/228687 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 40982 event pairs, 1366 based on Foata normal form. 8/6023 useless extension candidates. Maximal degree in co-relation 40285. Up to 5434 conditions per place. [2024-06-04 17:26:57,148 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 228 selfloop transitions, 48 changer transitions 0/289 dead transitions. [2024-06-04 17:26:57,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 289 transitions, 4103 flow [2024-06-04 17:26:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:26:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:26:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-04 17:26:57,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4485049833887043 [2024-06-04 17:26:57,149 INFO L175 Difference]: Start difference. First operand has 188 places, 268 transitions, 3284 flow. Second operand 7 states and 135 transitions. [2024-06-04 17:26:57,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 289 transitions, 4103 flow [2024-06-04 17:26:57,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 289 transitions, 3989 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-04 17:26:57,449 INFO L231 Difference]: Finished difference. Result has 191 places, 276 transitions, 3428 flow [2024-06-04 17:26:57,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3170, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3428, PETRI_PLACES=191, PETRI_TRANSITIONS=276} [2024-06-04 17:26:57,449 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 147 predicate places. [2024-06-04 17:26:57,450 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 276 transitions, 3428 flow [2024-06-04 17:26:57,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:57,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:57,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:57,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:26:57,450 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:26:57,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:57,451 INFO L85 PathProgramCache]: Analyzing trace with hash 769459940, now seen corresponding path program 6 times [2024-06-04 17:26:57,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:57,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042460579] [2024-06-04 17:26:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:57,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:27:12,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:12,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042460579] [2024-06-04 17:27:12,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042460579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:12,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:27:12,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268035274] [2024-06-04 17:27:12,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:12,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:27:12,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:12,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:27:12,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:27:12,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:27:12,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 276 transitions, 3428 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:27:12,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:12,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:27:12,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:14,588 INFO L124 PetriNetUnfolderBase]: 3552/6023 cut-off events. [2024-06-04 17:27:14,588 INFO L125 PetriNetUnfolderBase]: For 238734/238740 co-relation queries the response was YES. [2024-06-04 17:27:14,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40948 conditions, 6023 events. 3552/6023 cut-off events. For 238734/238740 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 40890 event pairs, 1368 based on Foata normal form. 8/6025 useless extension candidates. Maximal degree in co-relation 40860. Up to 5433 conditions per place. [2024-06-04 17:27:14,642 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 227 selfloop transitions, 49 changer transitions 0/289 dead transitions. [2024-06-04 17:27:14,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 289 transitions, 4041 flow [2024-06-04 17:27:14,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:27:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:27:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-04 17:27:14,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44518272425249167 [2024-06-04 17:27:14,643 INFO L175 Difference]: Start difference. First operand has 191 places, 276 transitions, 3428 flow. Second operand 7 states and 134 transitions. [2024-06-04 17:27:14,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 289 transitions, 4041 flow [2024-06-04 17:27:14,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 289 transitions, 3851 flow, removed 61 selfloop flow, removed 4 redundant places. [2024-06-04 17:27:14,921 INFO L231 Difference]: Finished difference. Result has 194 places, 277 transitions, 3361 flow [2024-06-04 17:27:14,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3250, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3361, PETRI_PLACES=194, PETRI_TRANSITIONS=277} [2024-06-04 17:27:14,921 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 150 predicate places. [2024-06-04 17:27:14,921 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 277 transitions, 3361 flow [2024-06-04 17:27:14,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:27:14,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:14,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:14,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:27:14,922 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:27:14,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:14,922 INFO L85 PathProgramCache]: Analyzing trace with hash -484861040, now seen corresponding path program 2 times [2024-06-04 17:27:14,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:14,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002485064] [2024-06-04 17:27:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:27:30,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:30,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002485064] [2024-06-04 17:27:30,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002485064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:30,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:30,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:27:30,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4727067] [2024-06-04 17:27:30,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:30,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:27:30,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:30,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:27:30,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:27:30,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:27:30,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 277 transitions, 3361 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 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-04 17:27:30,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:30,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:27:30,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:32,417 INFO L124 PetriNetUnfolderBase]: 3477/5890 cut-off events. [2024-06-04 17:27:32,417 INFO L125 PetriNetUnfolderBase]: For 235189/235192 co-relation queries the response was YES. [2024-06-04 17:27:32,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39604 conditions, 5890 events. 3477/5890 cut-off events. For 235189/235192 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 39792 event pairs, 1169 based on Foata normal form. 2/5861 useless extension candidates. Maximal degree in co-relation 39515. Up to 5314 conditions per place. [2024-06-04 17:27:32,472 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 206 selfloop transitions, 63 changer transitions 0/296 dead transitions. [2024-06-04 17:27:32,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 296 transitions, 4125 flow [2024-06-04 17:27:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:27:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:27:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-04 17:27:32,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42441860465116277 [2024-06-04 17:27:32,473 INFO L175 Difference]: Start difference. First operand has 194 places, 277 transitions, 3361 flow. Second operand 8 states and 146 transitions. [2024-06-04 17:27:32,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 296 transitions, 4125 flow [2024-06-04 17:27:32,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 296 transitions, 4049 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 17:27:32,799 INFO L231 Difference]: Finished difference. Result has 199 places, 285 transitions, 3539 flow [2024-06-04 17:27:32,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3285, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3539, PETRI_PLACES=199, PETRI_TRANSITIONS=285} [2024-06-04 17:27:32,799 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 155 predicate places. [2024-06-04 17:27:32,800 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 285 transitions, 3539 flow [2024-06-04 17:27:32,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 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-04 17:27:32,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:32,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:32,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:27:32,800 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:27:32,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -498193520, now seen corresponding path program 3 times [2024-06-04 17:27:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:32,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880803544] [2024-06-04 17:27:32,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:32,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:27:49,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:49,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880803544] [2024-06-04 17:27:49,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880803544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:49,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:49,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:27:49,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85887033] [2024-06-04 17:27:49,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:49,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:27:49,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:49,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:27:49,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:27:49,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:27:49,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 285 transitions, 3539 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 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-04 17:27:49,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:49,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:27:49,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:51,649 INFO L124 PetriNetUnfolderBase]: 3472/5888 cut-off events. [2024-06-04 17:27:51,650 INFO L125 PetriNetUnfolderBase]: For 245765/245778 co-relation queries the response was YES. [2024-06-04 17:27:51,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40259 conditions, 5888 events. 3472/5888 cut-off events. For 245765/245778 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 39864 event pairs, 1170 based on Foata normal form. 2/5858 useless extension candidates. Maximal degree in co-relation 40168. Up to 5310 conditions per place. [2024-06-04 17:27:51,708 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 210 selfloop transitions, 63 changer transitions 0/300 dead transitions. [2024-06-04 17:27:51,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 300 transitions, 4275 flow [2024-06-04 17:27:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:27:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:27:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-04 17:27:51,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43023255813953487 [2024-06-04 17:27:51,709 INFO L175 Difference]: Start difference. First operand has 199 places, 285 transitions, 3539 flow. Second operand 8 states and 148 transitions. [2024-06-04 17:27:51,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 300 transitions, 4275 flow [2024-06-04 17:27:51,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 300 transitions, 4155 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-04 17:27:51,961 INFO L231 Difference]: Finished difference. Result has 203 places, 289 transitions, 3613 flow [2024-06-04 17:27:51,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3425, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3613, PETRI_PLACES=203, PETRI_TRANSITIONS=289} [2024-06-04 17:27:51,961 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 159 predicate places. [2024-06-04 17:27:51,962 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 289 transitions, 3613 flow [2024-06-04 17:27:51,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 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-04 17:27:51,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:51,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:51,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:27:51,962 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:27:51,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:51,962 INFO L85 PathProgramCache]: Analyzing trace with hash -485306510, now seen corresponding path program 4 times [2024-06-04 17:27:51,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:51,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352553354] [2024-06-04 17:27:51,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:51,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:28:07,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-04 17:28:07,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:28:07,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352553354] [2024-06-04 17:28:07,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352553354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:28:07,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:28:07,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:28:07,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023755585] [2024-06-04 17:28:07,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:28:07,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:28:07,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:28:07,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:28:07,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:28:07,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:28:07,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 289 transitions, 3613 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 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-04 17:28:07,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:28:07,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:28:07,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:28:09,400 INFO L124 PetriNetUnfolderBase]: 3468/5881 cut-off events. [2024-06-04 17:28:09,400 INFO L125 PetriNetUnfolderBase]: For 250947/250960 co-relation queries the response was YES. [2024-06-04 17:28:09,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40382 conditions, 5881 events. 3468/5881 cut-off events. For 250947/250960 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 39812 event pairs, 1169 based on Foata normal form. 5/5855 useless extension candidates. Maximal degree in co-relation 40289. Up to 5307 conditions per place. [2024-06-04 17:28:09,452 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 207 selfloop transitions, 65 changer transitions 0/299 dead transitions. [2024-06-04 17:28:09,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 299 transitions, 4189 flow [2024-06-04 17:28:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:28:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:28:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-04 17:28:09,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42441860465116277 [2024-06-04 17:28:09,453 INFO L175 Difference]: Start difference. First operand has 203 places, 289 transitions, 3613 flow. Second operand 8 states and 146 transitions. [2024-06-04 17:28:09,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 299 transitions, 4189 flow [2024-06-04 17:28:09,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 299 transitions, 4040 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-04 17:28:09,794 INFO L231 Difference]: Finished difference. Result has 207 places, 289 transitions, 3600 flow [2024-06-04 17:28:09,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3464, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3600, PETRI_PLACES=207, PETRI_TRANSITIONS=289} [2024-06-04 17:28:09,795 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 163 predicate places. [2024-06-04 17:28:09,795 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 289 transitions, 3600 flow [2024-06-04 17:28:09,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 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-04 17:28:09,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:28:09,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:28:09,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:28:09,796 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:28:09,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:28:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1763390421, now seen corresponding path program 1 times [2024-06-04 17:28:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:28:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297131351] [2024-06-04 17:28:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:28:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:28:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:28:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:28:24,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:28:24,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297131351] [2024-06-04 17:28:24,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297131351] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:28:24,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:28:24,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:28:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122243820] [2024-06-04 17:28:24,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:28:24,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:28:24,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:28:24,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:28:24,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:28:24,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:28:24,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 289 transitions, 3600 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 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-04 17:28:24,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:28:24,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:28:24,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:28:26,998 INFO L124 PetriNetUnfolderBase]: 3544/6009 cut-off events. [2024-06-04 17:28:26,998 INFO L125 PetriNetUnfolderBase]: For 258003/258003 co-relation queries the response was YES. [2024-06-04 17:28:27,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41087 conditions, 6009 events. 3544/6009 cut-off events. For 258003/258003 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 40653 event pairs, 1501 based on Foata normal form. 1/6009 useless extension candidates. Maximal degree in co-relation 40993. Up to 5527 conditions per place. [2024-06-04 17:28:27,051 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 279 selfloop transitions, 18 changer transitions 0/308 dead transitions. [2024-06-04 17:28:27,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 308 transitions, 4320 flow [2024-06-04 17:28:27,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:28:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:28:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-04 17:28:27,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4273255813953488 [2024-06-04 17:28:27,053 INFO L175 Difference]: Start difference. First operand has 207 places, 289 transitions, 3600 flow. Second operand 8 states and 147 transitions. [2024-06-04 17:28:27,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 308 transitions, 4320 flow [2024-06-04 17:28:27,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 308 transitions, 4198 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-04 17:28:27,383 INFO L231 Difference]: Finished difference. Result has 209 places, 292 transitions, 3588 flow [2024-06-04 17:28:27,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3478, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3588, PETRI_PLACES=209, PETRI_TRANSITIONS=292} [2024-06-04 17:28:27,384 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 165 predicate places. [2024-06-04 17:28:27,384 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 292 transitions, 3588 flow [2024-06-04 17:28:27,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 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-04 17:28:27,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:28:27,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:28:27,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:28:27,385 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:28:27,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:28:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash -816651098, now seen corresponding path program 1 times [2024-06-04 17:28:27,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:28:27,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802742875] [2024-06-04 17:28:27,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:28:27,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:28:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:28:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:28:42,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:28:42,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802742875] [2024-06-04 17:28:42,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802742875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:28:42,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:28:42,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:28:42,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762847490] [2024-06-04 17:28:42,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:28:42,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:28:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:28:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:28:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:28:42,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:28:42,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 292 transitions, 3588 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 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-04 17:28:42,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:28:42,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:28:42,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15