./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix011.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix011.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/mix011.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix011.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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:05:56,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:05:56,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:05:56,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:05:56,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:05:56,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:05:56,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:05:56,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:05:56,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:05:56,427 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:05:56,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:05:56,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:05:56,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:05:56,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:05:56,431 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:05:56,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:05:56,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:05:56,431 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:05:56,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:05:56,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:05:56,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:05:56,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:05:56,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:05:56,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:05:56,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:05:56,434 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:05:56,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:05:56,434 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:05:56,435 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:05:56,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:05:56,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:05:56,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:05:56,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:05:56,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:05:56,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:05:56,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:05:56,437 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:05:56,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:05:56,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:05:56,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:05:56,438 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:05:56,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:05:56,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:05:56,439 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 [2024-06-27 22:05:56,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:05:56,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:05:56,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:05:56,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:05:56,684 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:05:56,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011.opt.i [2024-06-27 22:05:57,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:05:58,144 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:05:58,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011.opt.i [2024-06-27 22:05:58,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e164e8d59/6676734eb1d643c18c1ce2c988e49f13/FLAGe6d3f07fb [2024-06-27 22:05:58,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e164e8d59/6676734eb1d643c18c1ce2c988e49f13 [2024-06-27 22:05:58,175 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:05:58,176 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:05:58,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix011.opt.yml/witness.yml [2024-06-27 22:05:58,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:05:58,253 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:05:58,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:05:58,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:05:58,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:05:58,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:05:58" (1/2) ... [2024-06-27 22:05:58,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcb0e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:05:58, skipping insertion in model container [2024-06-27 22:05:58,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:05:58" (1/2) ... [2024-06-27 22:05:58,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@45c44385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:05:58, skipping insertion in model container [2024-06-27 22:05:58,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:05:58" (2/2) ... [2024-06-27 22:05:58,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcb0e43 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58, skipping insertion in model container [2024-06-27 22:05:58,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:05:58" (2/2) ... [2024-06-27 22:05:58,282 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:05:58,310 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:05:58,312 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )z) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$mem_tmp) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 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 )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1_used >= 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 )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 22:05:58,312 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )z) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$mem_tmp) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 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 )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1_used >= 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 )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 22:05:58,312 INFO L97 edCorrectnessWitness]: Location invariant before [L857-L857] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )z) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$mem_tmp) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 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 )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1_used >= 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 )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 22:05:58,312 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:05:58,313 INFO L106 edCorrectnessWitness]: ghost_update [L852-L852] multithreaded = 1; [2024-06-27 22:05:58,359 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:05:58,554 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011.opt.i[944,957] [2024-06-27 22:05:58,756 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:05:58,765 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:05:58,795 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011.opt.i[944,957] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:05:58,923 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:05:58,975 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:05:58,976 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58 WrapperNode [2024-06-27 22:05:58,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:05:58,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:05:58,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:05:58,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:05:58,984 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 27.06 10:05:58" (1/1) ... [2024-06-27 22:05:59,018 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 27.06 10:05:58" (1/1) ... [2024-06-27 22:05:59,058 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-06-27 22:05:59,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:05:59,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:05:59,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:05:59,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:05:59,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58" (1/1) ... [2024-06-27 22:05:59,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58" (1/1) ... [2024-06-27 22:05:59,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58" (1/1) ... [2024-06-27 22:05:59,105 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-27 22:05:59,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58" (1/1) ... [2024-06-27 22:05:59,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58" (1/1) ... [2024-06-27 22:05:59,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58" (1/1) ... [2024-06-27 22:05:59,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58" (1/1) ... [2024-06-27 22:05:59,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58" (1/1) ... [2024-06-27 22:05:59,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58" (1/1) ... [2024-06-27 22:05:59,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:05:59,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:05:59,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:05:59,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:05:59,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58" (1/1) ... [2024-06-27 22:05:59,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:05:59,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:05:59,181 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-27 22:05:59,197 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-27 22:05:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:05:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:05:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:05:59,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:05:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:05:59,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:05:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:05:59,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:05:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:05:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:05:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:05:59,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:05:59,225 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:05:59,345 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:05:59,347 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:05:59,812 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:05:59,812 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:06:00,058 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:06:00,058 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:06:00,059 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:06:00 BoogieIcfgContainer [2024-06-27 22:06:00,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:06:00,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:06:00,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:06:00,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:06:00,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:05:58" (1/4) ... [2024-06-27 22:06:00,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff60669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:06:00, skipping insertion in model container [2024-06-27 22:06:00,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:05:58" (2/4) ... [2024-06-27 22:06:00,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff60669 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:06:00, skipping insertion in model container [2024-06-27 22:06:00,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:05:58" (3/4) ... [2024-06-27 22:06:00,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff60669 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:06:00, skipping insertion in model container [2024-06-27 22:06:00,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:06:00" (4/4) ... [2024-06-27 22:06:00,070 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011.opt.i [2024-06-27 22:06:00,085 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:06:00,085 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:06:00,086 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:06:00,150 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:06:00,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 110 flow [2024-06-27 22:06:00,218 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-06-27 22:06:00,218 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:06:00,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-06-27 22:06:00,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 49 transitions, 110 flow [2024-06-27 22:06:00,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 46 transitions, 101 flow [2024-06-27 22:06:00,239 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:06:00,250 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;@34061a86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:06:00,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:06:00,254 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:06:00,254 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 22:06:00,254 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:06:00,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:00,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:06:00,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:00,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:00,260 INFO L85 PathProgramCache]: Analyzing trace with hash 368048057, now seen corresponding path program 1 times [2024-06-27 22:06:00,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:00,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332410190] [2024-06-27 22:06:00,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:00,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:01,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:01,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332410190] [2024-06-27 22:06:01,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332410190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:01,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:01,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:06:01,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717959359] [2024-06-27 22:06:01,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:01,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:06:01,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:01,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:06:01,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:06:01,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-06-27 22:06:01,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:01,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:01,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-06-27 22:06:01,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:02,888 INFO L124 PetriNetUnfolderBase]: 3657/6129 cut-off events. [2024-06-27 22:06:02,888 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-27 22:06:02,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11471 conditions, 6129 events. 3657/6129 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 41087 event pairs, 2984 based on Foata normal form. 181/5822 useless extension candidates. Maximal degree in co-relation 11459. Up to 5253 conditions per place. [2024-06-27 22:06:02,927 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 41 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2024-06-27 22:06:02,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 227 flow [2024-06-27 22:06:02,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:06:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:06:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-06-27 22:06:02,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2024-06-27 22:06:02,940 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 101 flow. Second operand 3 states and 102 transitions. [2024-06-27 22:06:02,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 227 flow [2024-06-27 22:06:02,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:06:02,945 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 133 flow [2024-06-27 22:06:02,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-06-27 22:06:02,950 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2024-06-27 22:06:02,950 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 133 flow [2024-06-27 22:06:02,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:02,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:02,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:02,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:06:02,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:02,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1506998672, now seen corresponding path program 1 times [2024-06-27 22:06:02,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:02,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048739013] [2024-06-27 22:06:02,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:02,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:04,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:04,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048739013] [2024-06-27 22:06:04,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048739013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:04,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:04,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:06:04,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140317040] [2024-06-27 22:06:04,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:04,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:06:04,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:04,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:06:04,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:06:04,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-27 22:06:04,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:04,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:04,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-27 22:06:04,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:05,282 INFO L124 PetriNetUnfolderBase]: 4173/6893 cut-off events. [2024-06-27 22:06:05,283 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2024-06-27 22:06:05,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14333 conditions, 6893 events. 4173/6893 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 45585 event pairs, 3007 based on Foata normal form. 3/6446 useless extension candidates. Maximal degree in co-relation 14321. Up to 5953 conditions per place. [2024-06-27 22:06:05,326 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 53 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2024-06-27 22:06:05,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 323 flow [2024-06-27 22:06:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:06:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:06:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2024-06-27 22:06:05,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6581632653061225 [2024-06-27 22:06:05,332 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 133 flow. Second operand 4 states and 129 transitions. [2024-06-27 22:06:05,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 323 flow [2024-06-27 22:06:05,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:06:05,336 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 179 flow [2024-06-27 22:06:05,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-06-27 22:06:05,337 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2024-06-27 22:06:05,337 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 179 flow [2024-06-27 22:06:05,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:05,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:05,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:05,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:06:05,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:05,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:05,346 INFO L85 PathProgramCache]: Analyzing trace with hash -527680774, now seen corresponding path program 1 times [2024-06-27 22:06:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:05,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144218189] [2024-06-27 22:06:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:06,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:06,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144218189] [2024-06-27 22:06:06,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144218189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:06,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:06,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:06:06,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314288505] [2024-06-27 22:06:06,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:06,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:06:06,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:06,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:06:06,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:06:07,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-27 22:06:07,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:07,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:07,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-27 22:06:07,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:07,827 INFO L124 PetriNetUnfolderBase]: 4199/6148 cut-off events. [2024-06-27 22:06:07,827 INFO L125 PetriNetUnfolderBase]: For 2324/2324 co-relation queries the response was YES. [2024-06-27 22:06:07,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14994 conditions, 6148 events. 4199/6148 cut-off events. For 2324/2324 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 34918 event pairs, 1482 based on Foata normal form. 5/5930 useless extension candidates. Maximal degree in co-relation 14980. Up to 5877 conditions per place. [2024-06-27 22:06:07,864 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 70 selfloop transitions, 21 changer transitions 0/104 dead transitions. [2024-06-27 22:06:07,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 104 transitions, 523 flow [2024-06-27 22:06:07,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:06:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:06:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-06-27 22:06:07,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-06-27 22:06:07,867 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 179 flow. Second operand 5 states and 168 transitions. [2024-06-27 22:06:07,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 104 transitions, 523 flow [2024-06-27 22:06:07,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 104 transitions, 504 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 22:06:07,871 INFO L231 Difference]: Finished difference. Result has 63 places, 67 transitions, 308 flow [2024-06-27 22:06:07,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2024-06-27 22:06:07,872 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2024-06-27 22:06:07,872 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 308 flow [2024-06-27 22:06:07,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:07,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:07,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:07,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:06:07,873 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:07,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash 564408113, now seen corresponding path program 1 times [2024-06-27 22:06:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:07,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656139789] [2024-06-27 22:06:07,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:09,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:09,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656139789] [2024-06-27 22:06:09,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656139789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:09,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:09,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:06:09,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926484523] [2024-06-27 22:06:09,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:09,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:06:09,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:09,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:06:09,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:06:09,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-27 22:06:09,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 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-27 22:06:09,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:09,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-27 22:06:09,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:10,884 INFO L124 PetriNetUnfolderBase]: 4243/6989 cut-off events. [2024-06-27 22:06:10,884 INFO L125 PetriNetUnfolderBase]: For 6350/6350 co-relation queries the response was YES. [2024-06-27 22:06:10,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18491 conditions, 6989 events. 4243/6989 cut-off events. For 6350/6350 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 46460 event pairs, 1868 based on Foata normal form. 10/6532 useless extension candidates. Maximal degree in co-relation 18474. Up to 5853 conditions per place. [2024-06-27 22:06:10,935 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 78 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2024-06-27 22:06:10,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 116 transitions, 664 flow [2024-06-27 22:06:10,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:06:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:06:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2024-06-27 22:06:10,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 22:06:10,939 INFO L175 Difference]: Start difference. First operand has 63 places, 67 transitions, 308 flow. Second operand 6 states and 196 transitions. [2024-06-27 22:06:10,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 116 transitions, 664 flow [2024-06-27 22:06:10,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 116 transitions, 652 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 22:06:10,948 INFO L231 Difference]: Finished difference. Result has 68 places, 70 transitions, 383 flow [2024-06-27 22:06:10,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2024-06-27 22:06:10,949 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2024-06-27 22:06:10,950 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 383 flow [2024-06-27 22:06:10,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 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-27 22:06:10,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:10,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:10,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:06:10,951 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:10,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash 416766308, now seen corresponding path program 1 times [2024-06-27 22:06:10,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:10,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696171464] [2024-06-27 22:06:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696171464] [2024-06-27 22:06:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696171464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:12,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:12,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:06:12,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347939979] [2024-06-27 22:06:12,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:12,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:06:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:12,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:06:12,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:06:12,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 22:06:12,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 383 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:12,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:12,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 22:06:12,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:13,356 INFO L124 PetriNetUnfolderBase]: 4248/6950 cut-off events. [2024-06-27 22:06:13,356 INFO L125 PetriNetUnfolderBase]: For 10119/10119 co-relation queries the response was YES. [2024-06-27 22:06:13,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20026 conditions, 6950 events. 4248/6950 cut-off events. For 10119/10119 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 45848 event pairs, 2410 based on Foata normal form. 2/6455 useless extension candidates. Maximal degree in co-relation 20005. Up to 6056 conditions per place. [2024-06-27 22:06:13,400 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 68 selfloop transitions, 12 changer transitions 0/92 dead transitions. [2024-06-27 22:06:13,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 92 transitions, 603 flow [2024-06-27 22:06:13,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:06:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:06:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-06-27 22:06:13,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5673469387755102 [2024-06-27 22:06:13,403 INFO L175 Difference]: Start difference. First operand has 68 places, 70 transitions, 383 flow. Second operand 5 states and 139 transitions. [2024-06-27 22:06:13,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 92 transitions, 603 flow [2024-06-27 22:06:13,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 92 transitions, 532 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-27 22:06:13,414 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 366 flow [2024-06-27 22:06:13,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2024-06-27 22:06:13,417 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 15 predicate places. [2024-06-27 22:06:13,418 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 366 flow [2024-06-27 22:06:13,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:13,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:13,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:13,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:06:13,419 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:13,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:13,419 INFO L85 PathProgramCache]: Analyzing trace with hash -10600720, now seen corresponding path program 1 times [2024-06-27 22:06:13,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:13,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18898905] [2024-06-27 22:06:13,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:13,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:13,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18898905] [2024-06-27 22:06:13,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18898905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:13,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:13,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:06:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189841920] [2024-06-27 22:06:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:13,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:06:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:13,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:06:13,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:06:13,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 49 [2024-06-27 22:06:13,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:13,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:13,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 49 [2024-06-27 22:06:13,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:13,880 INFO L124 PetriNetUnfolderBase]: 1185/2720 cut-off events. [2024-06-27 22:06:13,881 INFO L125 PetriNetUnfolderBase]: For 2003/2193 co-relation queries the response was YES. [2024-06-27 22:06:13,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5871 conditions, 2720 events. 1185/2720 cut-off events. For 2003/2193 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22513 event pairs, 424 based on Foata normal form. 7/2525 useless extension candidates. Maximal degree in co-relation 5847. Up to 1602 conditions per place. [2024-06-27 22:06:13,902 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 27 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2024-06-27 22:06:13,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 73 transitions, 398 flow [2024-06-27 22:06:13,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:06:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:06:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-06-27 22:06:13,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7482993197278912 [2024-06-27 22:06:13,904 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 366 flow. Second operand 3 states and 110 transitions. [2024-06-27 22:06:13,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 73 transitions, 398 flow [2024-06-27 22:06:13,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 379 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:06:13,909 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 309 flow [2024-06-27 22:06:13,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-06-27 22:06:13,911 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2024-06-27 22:06:13,911 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 309 flow [2024-06-27 22:06:13,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:13,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:13,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:13,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:06:13,912 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:13,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:13,912 INFO L85 PathProgramCache]: Analyzing trace with hash -311058941, now seen corresponding path program 1 times [2024-06-27 22:06:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:13,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175961600] [2024-06-27 22:06:13,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:15,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:15,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175961600] [2024-06-27 22:06:15,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175961600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:15,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:15,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:06:15,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302159964] [2024-06-27 22:06:15,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:15,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:06:15,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:15,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:06:15,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:06:15,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:06:15,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 309 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:15,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:15,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:06:15,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:16,468 INFO L124 PetriNetUnfolderBase]: 4414/7054 cut-off events. [2024-06-27 22:06:16,468 INFO L125 PetriNetUnfolderBase]: For 11712/11712 co-relation queries the response was YES. [2024-06-27 22:06:16,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19981 conditions, 7054 events. 4414/7054 cut-off events. For 11712/11712 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 44001 event pairs, 2020 based on Foata normal form. 4/6878 useless extension candidates. Maximal degree in co-relation 19957. Up to 6057 conditions per place. [2024-06-27 22:06:16,521 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 78 selfloop transitions, 31 changer transitions 5/125 dead transitions. [2024-06-27 22:06:16,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 125 transitions, 777 flow [2024-06-27 22:06:16,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:06:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:06:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2024-06-27 22:06:16,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-06-27 22:06:16,583 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 309 flow. Second operand 7 states and 196 transitions. [2024-06-27 22:06:16,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 125 transitions, 777 flow [2024-06-27 22:06:16,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 125 transitions, 753 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:06:16,594 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 489 flow [2024-06-27 22:06:16,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-06-27 22:06:16,596 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 20 predicate places. [2024-06-27 22:06:16,596 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 489 flow [2024-06-27 22:06:16,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:16,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:16,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:16,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:06:16,597 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:16,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash -327497823, now seen corresponding path program 2 times [2024-06-27 22:06:16,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:16,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460070632] [2024-06-27 22:06:16,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:18,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:18,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460070632] [2024-06-27 22:06:18,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460070632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:18,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:18,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:06:18,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612539709] [2024-06-27 22:06:18,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:18,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:06:18,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:18,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:06:18,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:06:18,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:06:18,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 489 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:18,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:18,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:06:18,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:19,109 INFO L124 PetriNetUnfolderBase]: 3991/5939 cut-off events. [2024-06-27 22:06:19,109 INFO L125 PetriNetUnfolderBase]: For 12491/12493 co-relation queries the response was YES. [2024-06-27 22:06:19,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19068 conditions, 5939 events. 3991/5939 cut-off events. For 12491/12493 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 33249 event pairs, 1268 based on Foata normal form. 8/5923 useless extension candidates. Maximal degree in co-relation 19040. Up to 5403 conditions per place. [2024-06-27 22:06:19,151 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 72 selfloop transitions, 44 changer transitions 0/127 dead transitions. [2024-06-27 22:06:19,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 127 transitions, 999 flow [2024-06-27 22:06:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:06:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:06:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-06-27 22:06:19,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5612244897959183 [2024-06-27 22:06:19,153 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 489 flow. Second operand 6 states and 165 transitions. [2024-06-27 22:06:19,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 127 transitions, 999 flow [2024-06-27 22:06:19,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 127 transitions, 950 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 22:06:19,171 INFO L231 Difference]: Finished difference. Result has 79 places, 96 transitions, 731 flow [2024-06-27 22:06:19,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=731, PETRI_PLACES=79, PETRI_TRANSITIONS=96} [2024-06-27 22:06:19,172 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 24 predicate places. [2024-06-27 22:06:19,172 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 731 flow [2024-06-27 22:06:19,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:19,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:19,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:19,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:06:19,173 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:19,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:19,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1080478467, now seen corresponding path program 3 times [2024-06-27 22:06:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:19,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149688073] [2024-06-27 22:06:19,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:19,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:20,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:20,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149688073] [2024-06-27 22:06:20,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149688073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:20,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:20,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:06:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701858864] [2024-06-27 22:06:20,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:20,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:06:20,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:20,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:06:20,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:06:20,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:06:20,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 731 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:20,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:20,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:06:20,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:21,425 INFO L124 PetriNetUnfolderBase]: 3974/5919 cut-off events. [2024-06-27 22:06:21,426 INFO L125 PetriNetUnfolderBase]: For 15176/15178 co-relation queries the response was YES. [2024-06-27 22:06:21,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19481 conditions, 5919 events. 3974/5919 cut-off events. For 15176/15178 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 33045 event pairs, 1264 based on Foata normal form. 5/5902 useless extension candidates. Maximal degree in co-relation 19449. Up to 5382 conditions per place. [2024-06-27 22:06:21,467 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 67 selfloop transitions, 48 changer transitions 0/126 dead transitions. [2024-06-27 22:06:21,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 126 transitions, 1061 flow [2024-06-27 22:06:21,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:06:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:06:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-06-27 22:06:21,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-06-27 22:06:21,469 INFO L175 Difference]: Start difference. First operand has 79 places, 96 transitions, 731 flow. Second operand 6 states and 161 transitions. [2024-06-27 22:06:21,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 126 transitions, 1061 flow [2024-06-27 22:06:21,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 126 transitions, 1014 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-27 22:06:21,486 INFO L231 Difference]: Finished difference. Result has 84 places, 96 transitions, 792 flow [2024-06-27 22:06:21,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=792, PETRI_PLACES=84, PETRI_TRANSITIONS=96} [2024-06-27 22:06:21,487 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 29 predicate places. [2024-06-27 22:06:21,487 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 792 flow [2024-06-27 22:06:21,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:21,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:21,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:21,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:06:21,488 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:21,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:21,488 INFO L85 PathProgramCache]: Analyzing trace with hash -321775967, now seen corresponding path program 1 times [2024-06-27 22:06:21,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127631524] [2024-06-27 22:06:21,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:21,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:23,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:23,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127631524] [2024-06-27 22:06:23,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127631524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:23,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:23,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:06:23,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641110287] [2024-06-27 22:06:23,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:23,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:06:23,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:23,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:06:23,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:06:23,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:06:23,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 96 transitions, 792 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:23,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:23,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:06:23,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:24,379 INFO L124 PetriNetUnfolderBase]: 4251/7060 cut-off events. [2024-06-27 22:06:24,380 INFO L125 PetriNetUnfolderBase]: For 20678/20680 co-relation queries the response was YES. [2024-06-27 22:06:24,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22257 conditions, 7060 events. 4251/7060 cut-off events. For 20678/20680 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 45875 event pairs, 2245 based on Foata normal form. 4/6881 useless extension candidates. Maximal degree in co-relation 22221. Up to 6015 conditions per place. [2024-06-27 22:06:24,423 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 110 selfloop transitions, 16 changer transitions 0/137 dead transitions. [2024-06-27 22:06:24,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 137 transitions, 1190 flow [2024-06-27 22:06:24,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:06:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:06:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-06-27 22:06:24,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247813411078717 [2024-06-27 22:06:24,425 INFO L175 Difference]: Start difference. First operand has 84 places, 96 transitions, 792 flow. Second operand 7 states and 180 transitions. [2024-06-27 22:06:24,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 137 transitions, 1190 flow [2024-06-27 22:06:24,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 137 transitions, 1136 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 22:06:24,519 INFO L231 Difference]: Finished difference. Result has 90 places, 102 transitions, 842 flow [2024-06-27 22:06:24,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=842, PETRI_PLACES=90, PETRI_TRANSITIONS=102} [2024-06-27 22:06:24,520 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 35 predicate places. [2024-06-27 22:06:24,520 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 102 transitions, 842 flow [2024-06-27 22:06:24,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:24,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:24,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:24,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:06:24,523 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:24,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1598150075, now seen corresponding path program 1 times [2024-06-27 22:06:24,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:24,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629880915] [2024-06-27 22:06:24,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:24,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:25,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:25,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629880915] [2024-06-27 22:06:25,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629880915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:25,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:25,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:06:25,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784820659] [2024-06-27 22:06:25,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:25,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:06:25,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:25,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:06:25,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:06:25,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:06:25,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 102 transitions, 842 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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-27 22:06:25,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:25,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:06:25,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:26,520 INFO L124 PetriNetUnfolderBase]: 4479/7153 cut-off events. [2024-06-27 22:06:26,520 INFO L125 PetriNetUnfolderBase]: For 24863/24871 co-relation queries the response was YES. [2024-06-27 22:06:26,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23429 conditions, 7153 events. 4479/7153 cut-off events. For 24863/24871 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 45467 event pairs, 2401 based on Foata normal form. 1/7003 useless extension candidates. Maximal degree in co-relation 23389. Up to 6400 conditions per place. [2024-06-27 22:06:26,563 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 97 selfloop transitions, 12 changer transitions 0/121 dead transitions. [2024-06-27 22:06:26,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 121 transitions, 1155 flow [2024-06-27 22:06:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:06:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:06:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-06-27 22:06:26,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020408163265306 [2024-06-27 22:06:26,566 INFO L175 Difference]: Start difference. First operand has 90 places, 102 transitions, 842 flow. Second operand 5 states and 123 transitions. [2024-06-27 22:06:26,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 121 transitions, 1155 flow [2024-06-27 22:06:26,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 121 transitions, 1108 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 22:06:26,589 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 910 flow [2024-06-27 22:06:26,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=910, PETRI_PLACES=91, PETRI_TRANSITIONS=110} [2024-06-27 22:06:26,590 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 36 predicate places. [2024-06-27 22:06:26,590 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 910 flow [2024-06-27 22:06:26,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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-27 22:06:26,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:26,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:26,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:06:26,591 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:26,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:26,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2038127442, now seen corresponding path program 1 times [2024-06-27 22:06:26,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:26,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199352998] [2024-06-27 22:06:26,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:26,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:28,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:28,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199352998] [2024-06-27 22:06:28,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199352998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:28,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:28,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:06:28,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146915837] [2024-06-27 22:06:28,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:28,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:06:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:28,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:06:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:06:28,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:06:28,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 110 transitions, 910 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:28,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:28,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:06:28,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:29,848 INFO L124 PetriNetUnfolderBase]: 5056/8278 cut-off events. [2024-06-27 22:06:29,849 INFO L125 PetriNetUnfolderBase]: For 31114/31118 co-relation queries the response was YES. [2024-06-27 22:06:29,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27999 conditions, 8278 events. 5056/8278 cut-off events. For 31114/31118 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 53653 event pairs, 1763 based on Foata normal form. 10/8053 useless extension candidates. Maximal degree in co-relation 27957. Up to 6248 conditions per place. [2024-06-27 22:06:29,899 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 121 selfloop transitions, 64 changer transitions 0/195 dead transitions. [2024-06-27 22:06:29,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 195 transitions, 1723 flow [2024-06-27 22:06:29,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:06:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:06:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 246 transitions. [2024-06-27 22:06:29,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5578231292517006 [2024-06-27 22:06:29,901 INFO L175 Difference]: Start difference. First operand has 91 places, 110 transitions, 910 flow. Second operand 9 states and 246 transitions. [2024-06-27 22:06:29,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 195 transitions, 1723 flow [2024-06-27 22:06:29,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 195 transitions, 1706 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-27 22:06:29,945 INFO L231 Difference]: Finished difference. Result has 101 places, 129 transitions, 1223 flow [2024-06-27 22:06:29,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1223, PETRI_PLACES=101, PETRI_TRANSITIONS=129} [2024-06-27 22:06:29,946 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 46 predicate places. [2024-06-27 22:06:29,946 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 129 transitions, 1223 flow [2024-06-27 22:06:29,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:29,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:29,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:29,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:06:29,947 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:29,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:29,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1192772352, now seen corresponding path program 2 times [2024-06-27 22:06:29,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:29,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785197078] [2024-06-27 22:06:29,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:29,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:31,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:31,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785197078] [2024-06-27 22:06:31,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785197078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:31,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:31,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:06:31,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176810001] [2024-06-27 22:06:31,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:31,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:06:31,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:31,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:06:31,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:06:31,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:06:31,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 129 transitions, 1223 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:31,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:31,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:06:31,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:33,298 INFO L124 PetriNetUnfolderBase]: 5344/7978 cut-off events. [2024-06-27 22:06:33,298 INFO L125 PetriNetUnfolderBase]: For 42800/42804 co-relation queries the response was YES. [2024-06-27 22:06:33,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32289 conditions, 7978 events. 5344/7978 cut-off events. For 42800/42804 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 46451 event pairs, 1325 based on Foata normal form. 14/7938 useless extension candidates. Maximal degree in co-relation 32242. Up to 6450 conditions per place. [2024-06-27 22:06:33,348 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 118 selfloop transitions, 79 changer transitions 0/207 dead transitions. [2024-06-27 22:06:33,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 207 transitions, 2131 flow [2024-06-27 22:06:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:06:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:06:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-06-27 22:06:33,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5586734693877551 [2024-06-27 22:06:33,351 INFO L175 Difference]: Start difference. First operand has 101 places, 129 transitions, 1223 flow. Second operand 8 states and 219 transitions. [2024-06-27 22:06:33,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 207 transitions, 2131 flow [2024-06-27 22:06:33,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 207 transitions, 2071 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-06-27 22:06:33,419 INFO L231 Difference]: Finished difference. Result has 108 places, 150 transitions, 1565 flow [2024-06-27 22:06:33,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1565, PETRI_PLACES=108, PETRI_TRANSITIONS=150} [2024-06-27 22:06:33,420 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 53 predicate places. [2024-06-27 22:06:33,420 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 150 transitions, 1565 flow [2024-06-27 22:06:33,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:33,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:33,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:33,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:06:33,421 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:33,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:33,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1042255902, now seen corresponding path program 3 times [2024-06-27 22:06:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:33,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714177431] [2024-06-27 22:06:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:33,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:35,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:35,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714177431] [2024-06-27 22:06:35,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714177431] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:35,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:35,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:06:35,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461642307] [2024-06-27 22:06:35,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:35,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:06:35,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:06:35,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:06:35,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:06:35,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 150 transitions, 1565 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:35,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:35,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:06:35,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:36,612 INFO L124 PetriNetUnfolderBase]: 5470/8152 cut-off events. [2024-06-27 22:06:36,613 INFO L125 PetriNetUnfolderBase]: For 51086/51088 co-relation queries the response was YES. [2024-06-27 22:06:36,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35190 conditions, 8152 events. 5470/8152 cut-off events. For 51086/51088 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 47431 event pairs, 1268 based on Foata normal form. 8/8114 useless extension candidates. Maximal degree in co-relation 35139. Up to 6502 conditions per place. [2024-06-27 22:06:36,664 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 121 selfloop transitions, 96 changer transitions 0/227 dead transitions. [2024-06-27 22:06:36,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 227 transitions, 2539 flow [2024-06-27 22:06:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:06:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:06:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2024-06-27 22:06:36,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5561224489795918 [2024-06-27 22:06:36,669 INFO L175 Difference]: Start difference. First operand has 108 places, 150 transitions, 1565 flow. Second operand 8 states and 218 transitions. [2024-06-27 22:06:36,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 227 transitions, 2539 flow [2024-06-27 22:06:36,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 227 transitions, 2371 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-27 22:06:36,742 INFO L231 Difference]: Finished difference. Result has 114 places, 166 transitions, 1818 flow [2024-06-27 22:06:36,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1818, PETRI_PLACES=114, PETRI_TRANSITIONS=166} [2024-06-27 22:06:36,743 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 59 predicate places. [2024-06-27 22:06:36,743 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 166 transitions, 1818 flow [2024-06-27 22:06:36,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:36,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:36,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:36,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:06:36,744 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:36,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash 10689122, now seen corresponding path program 4 times [2024-06-27 22:06:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:36,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086414198] [2024-06-27 22:06:36,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:36,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:38,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:38,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086414198] [2024-06-27 22:06:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086414198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:38,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:06:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130840950] [2024-06-27 22:06:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:38,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:06:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:38,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:06:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:06:38,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:06:38,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 166 transitions, 1818 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:38,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:38,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:06:38,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:40,073 INFO L124 PetriNetUnfolderBase]: 5554/8259 cut-off events. [2024-06-27 22:06:40,073 INFO L125 PetriNetUnfolderBase]: For 59505/59507 co-relation queries the response was YES. [2024-06-27 22:06:40,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36939 conditions, 8259 events. 5554/8259 cut-off events. For 59505/59507 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 47927 event pairs, 1240 based on Foata normal form. 8/8222 useless extension candidates. Maximal degree in co-relation 36885. Up to 6542 conditions per place. [2024-06-27 22:06:40,130 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 119 selfloop transitions, 107 changer transitions 0/236 dead transitions. [2024-06-27 22:06:40,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 236 transitions, 2754 flow [2024-06-27 22:06:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:06:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:06:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2024-06-27 22:06:40,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5561224489795918 [2024-06-27 22:06:40,132 INFO L175 Difference]: Start difference. First operand has 114 places, 166 transitions, 1818 flow. Second operand 8 states and 218 transitions. [2024-06-27 22:06:40,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 236 transitions, 2754 flow [2024-06-27 22:06:40,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 236 transitions, 2654 flow, removed 21 selfloop flow, removed 2 redundant places. [2024-06-27 22:06:40,211 INFO L231 Difference]: Finished difference. Result has 120 places, 174 transitions, 2063 flow [2024-06-27 22:06:40,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2063, PETRI_PLACES=120, PETRI_TRANSITIONS=174} [2024-06-27 22:06:40,212 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 65 predicate places. [2024-06-27 22:06:40,212 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 174 transitions, 2063 flow [2024-06-27 22:06:40,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:40,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:40,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:40,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:06:40,213 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:40,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:40,214 INFO L85 PathProgramCache]: Analyzing trace with hash 10956032, now seen corresponding path program 5 times [2024-06-27 22:06:40,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:40,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243828874] [2024-06-27 22:06:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:41,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:41,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243828874] [2024-06-27 22:06:41,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243828874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:41,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:41,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:06:41,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617628474] [2024-06-27 22:06:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:41,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:06:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:41,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:06:41,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:06:42,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:06:42,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 174 transitions, 2063 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:42,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:42,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:06:42,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:43,633 INFO L124 PetriNetUnfolderBase]: 5538/8254 cut-off events. [2024-06-27 22:06:43,633 INFO L125 PetriNetUnfolderBase]: For 63189/63191 co-relation queries the response was YES. [2024-06-27 22:06:43,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37706 conditions, 8254 events. 5538/8254 cut-off events. For 63189/63191 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 48050 event pairs, 1239 based on Foata normal form. 8/8212 useless extension candidates. Maximal degree in co-relation 37650. Up to 6535 conditions per place. [2024-06-27 22:06:43,694 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 107 selfloop transitions, 113 changer transitions 0/230 dead transitions. [2024-06-27 22:06:43,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 230 transitions, 2789 flow [2024-06-27 22:06:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:06:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:06:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-06-27 22:06:43,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.548469387755102 [2024-06-27 22:06:43,696 INFO L175 Difference]: Start difference. First operand has 120 places, 174 transitions, 2063 flow. Second operand 8 states and 215 transitions. [2024-06-27 22:06:43,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 230 transitions, 2789 flow [2024-06-27 22:06:43,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 230 transitions, 2550 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-06-27 22:06:43,784 INFO L231 Difference]: Finished difference. Result has 123 places, 174 transitions, 2060 flow [2024-06-27 22:06:43,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2060, PETRI_PLACES=123, PETRI_TRANSITIONS=174} [2024-06-27 22:06:43,784 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 68 predicate places. [2024-06-27 22:06:43,785 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 174 transitions, 2060 flow [2024-06-27 22:06:43,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:43,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:43,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:43,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:06:43,785 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:43,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2021087472, now seen corresponding path program 1 times [2024-06-27 22:06:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:43,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455508842] [2024-06-27 22:06:43,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:43,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:45,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455508842] [2024-06-27 22:06:45,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455508842] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:45,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:45,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:06:45,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690390379] [2024-06-27 22:06:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:45,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:06:45,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:45,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:06:45,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:06:45,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 22:06:45,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 174 transitions, 2060 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:45,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:45,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 22:06:45,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:46,651 INFO L124 PetriNetUnfolderBase]: 4719/7722 cut-off events. [2024-06-27 22:06:46,651 INFO L125 PetriNetUnfolderBase]: For 59633/59643 co-relation queries the response was YES. [2024-06-27 22:06:46,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33351 conditions, 7722 events. 4719/7722 cut-off events. For 59633/59643 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 50984 event pairs, 2138 based on Foata normal form. 2/7566 useless extension candidates. Maximal degree in co-relation 33295. Up to 6666 conditions per place. [2024-06-27 22:06:46,709 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 162 selfloop transitions, 15 changer transitions 0/194 dead transitions. [2024-06-27 22:06:46,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 194 transitions, 2494 flow [2024-06-27 22:06:46,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:06:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:06:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-27 22:06:46,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4839650145772595 [2024-06-27 22:06:46,711 INFO L175 Difference]: Start difference. First operand has 123 places, 174 transitions, 2060 flow. Second operand 7 states and 166 transitions. [2024-06-27 22:06:46,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 194 transitions, 2494 flow [2024-06-27 22:06:46,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 194 transitions, 2249 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-27 22:06:46,771 INFO L231 Difference]: Finished difference. Result has 124 places, 177 transitions, 1881 flow [2024-06-27 22:06:46,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1881, PETRI_PLACES=124, PETRI_TRANSITIONS=177} [2024-06-27 22:06:46,772 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 69 predicate places. [2024-06-27 22:06:46,772 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 177 transitions, 1881 flow [2024-06-27 22:06:46,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:46,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:46,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:46,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:06:46,773 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:46,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:46,773 INFO L85 PathProgramCache]: Analyzing trace with hash -702672160, now seen corresponding path program 1 times [2024-06-27 22:06:46,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:46,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620267301] [2024-06-27 22:06:46,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:46,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:48,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:48,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620267301] [2024-06-27 22:06:48,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620267301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:48,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:48,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:06:48,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394096463] [2024-06-27 22:06:48,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:48,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:06:48,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:48,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:06:48,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:06:48,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:06:48,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 177 transitions, 1881 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:48,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:48,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:06:48,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:49,457 INFO L124 PetriNetUnfolderBase]: 5504/9058 cut-off events. [2024-06-27 22:06:49,458 INFO L125 PetriNetUnfolderBase]: For 67594/67606 co-relation queries the response was YES. [2024-06-27 22:06:49,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37200 conditions, 9058 events. 5504/9058 cut-off events. For 67594/67606 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 60312 event pairs, 1699 based on Foata normal form. 16/8824 useless extension candidates. Maximal degree in co-relation 37144. Up to 7132 conditions per place. [2024-06-27 22:06:49,515 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 157 selfloop transitions, 65 changer transitions 0/238 dead transitions. [2024-06-27 22:06:49,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 238 transitions, 2667 flow [2024-06-27 22:06:49,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:06:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:06:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-06-27 22:06:49,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-06-27 22:06:49,517 INFO L175 Difference]: Start difference. First operand has 124 places, 177 transitions, 1881 flow. Second operand 8 states and 216 transitions. [2024-06-27 22:06:49,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 238 transitions, 2667 flow [2024-06-27 22:06:49,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 238 transitions, 2621 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 22:06:49,593 INFO L231 Difference]: Finished difference. Result has 128 places, 184 transitions, 2047 flow [2024-06-27 22:06:49,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1835, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2047, PETRI_PLACES=128, PETRI_TRANSITIONS=184} [2024-06-27 22:06:49,593 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 73 predicate places. [2024-06-27 22:06:49,594 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 184 transitions, 2047 flow [2024-06-27 22:06:49,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:49,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:49,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:49,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:06:49,594 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:49,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:49,595 INFO L85 PathProgramCache]: Analyzing trace with hash -583690174, now seen corresponding path program 2 times [2024-06-27 22:06:49,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:49,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207260348] [2024-06-27 22:06:49,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:49,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:50,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:50,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207260348] [2024-06-27 22:06:50,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207260348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:50,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:50,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:06:50,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647433403] [2024-06-27 22:06:50,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:50,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:06:50,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:50,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:06:50,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:06:50,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:06:50,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 184 transitions, 2047 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:50,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:50,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:06:50,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:52,493 INFO L124 PetriNetUnfolderBase]: 5550/9169 cut-off events. [2024-06-27 22:06:52,494 INFO L125 PetriNetUnfolderBase]: For 76464/76476 co-relation queries the response was YES. [2024-06-27 22:06:52,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39050 conditions, 9169 events. 5550/9169 cut-off events. For 76464/76476 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 61347 event pairs, 1731 based on Foata normal form. 20/8938 useless extension candidates. Maximal degree in co-relation 38993. Up to 7396 conditions per place. [2024-06-27 22:06:52,578 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 152 selfloop transitions, 68 changer transitions 0/236 dead transitions. [2024-06-27 22:06:52,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 236 transitions, 2733 flow [2024-06-27 22:06:52,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:06:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:06:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2024-06-27 22:06:52,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433673469387755 [2024-06-27 22:06:52,580 INFO L175 Difference]: Start difference. First operand has 128 places, 184 transitions, 2047 flow. Second operand 8 states and 213 transitions. [2024-06-27 22:06:52,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 236 transitions, 2733 flow [2024-06-27 22:06:52,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 236 transitions, 2638 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-27 22:06:52,701 INFO L231 Difference]: Finished difference. Result has 132 places, 186 transitions, 2128 flow [2024-06-27 22:06:52,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1958, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2128, PETRI_PLACES=132, PETRI_TRANSITIONS=186} [2024-06-27 22:06:52,702 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 77 predicate places. [2024-06-27 22:06:52,702 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 186 transitions, 2128 flow [2024-06-27 22:06:52,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:52,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:52,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:52,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:06:52,702 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:52,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:52,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1339631772, now seen corresponding path program 3 times [2024-06-27 22:06:52,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:52,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424598427] [2024-06-27 22:06:52,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:52,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:53,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:53,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424598427] [2024-06-27 22:06:53,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424598427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:53,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:53,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:06:53,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445264430] [2024-06-27 22:06:53,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:53,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:06:53,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:53,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:06:53,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:06:53,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-06-27 22:06:53,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 186 transitions, 2128 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:53,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:53,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-06-27 22:06:53,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:54,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L768-->L771: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][120], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), 18#L856-4true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), 292#true, Black: 265#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 135#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 167#true, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 158#true, 208#true, Black: 83#(and (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 273#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (<= ~z$w_buff1_used~0 0)) (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (<= ~z$w_buff1_used~0 0))) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), 48#L758true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 87#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 225#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 284#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 285#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 162#(and (= ~z$w_buff0_used~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (= ~z$r_buff0_thd3~0 1) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$w_buff0~0 1)), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 70#true, 306#true, Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 298#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P0Thread1of1ForFork0InUse, 28#L771true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 184#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P1Thread1of1ForFork2InUse, 279#true, Black: 125#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0))]) [2024-06-27 22:06:54,189 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-06-27 22:06:54,189 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 22:06:54,189 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 22:06:54,189 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 22:06:54,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L768-->L771: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][120], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), 292#true, Black: 265#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 135#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 167#true, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 158#true, 208#true, 51#$Ultimate##0true, Black: 83#(and (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 273#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (<= ~z$w_buff1_used~0 0)) (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (<= ~z$w_buff1_used~0 0))) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), 48#L758true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 87#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 225#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 284#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 285#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 162#(and (= ~z$w_buff0_used~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (= ~z$r_buff0_thd3~0 1) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$w_buff0~0 1)), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 70#true, 306#true, Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 298#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P0Thread1of1ForFork0InUse, 28#L771true, 35#L856-5true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P2Thread1of1ForFork1InUse, Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 184#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P1Thread1of1ForFork2InUse, 279#true, Black: 125#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0))]) [2024-06-27 22:06:54,254 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-27 22:06:54,254 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 22:06:54,254 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 22:06:54,254 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 22:06:54,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L768-->L771: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][120], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), 24#L857true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), 292#true, Black: 265#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 135#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 167#true, Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 158#true, 208#true, 51#$Ultimate##0true, Black: 83#(and (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 273#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (<= ~z$w_buff1_used~0 0)) (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (<= ~z$w_buff1_used~0 0))) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), 48#L758true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 87#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 225#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 284#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 285#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 162#(and (= ~z$w_buff0_used~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (= ~z$r_buff0_thd3~0 1) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$w_buff0~0 1)), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 70#true, 306#true, Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 298#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P0Thread1of1ForFork0InUse, 28#L771true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P2Thread1of1ForFork1InUse, Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 184#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P1Thread1of1ForFork2InUse, 279#true, Black: 125#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0))]) [2024-06-27 22:06:54,328 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-27 22:06:54,328 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 22:06:54,329 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 22:06:54,329 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 22:06:54,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L768-->L771: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][120], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), 292#true, Black: 265#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 135#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 167#true, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 158#true, 51#$Ultimate##0true, 208#true, Black: 83#(and (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 273#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (<= ~z$w_buff1_used~0 0)) (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (<= ~z$w_buff1_used~0 0))) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), 48#L758true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 87#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 284#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 225#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 285#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 162#(and (= ~z$w_buff0_used~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (= ~z$r_buff0_thd3~0 1) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$w_buff0~0 1)), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 70#true, 53#L857-1true, 306#true, Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 298#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P0Thread1of1ForFork0InUse, 28#L771true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P2Thread1of1ForFork1InUse, Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 184#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P1Thread1of1ForFork2InUse, 279#true, Black: 125#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0))]) [2024-06-27 22:06:54,391 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-27 22:06:54,391 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 22:06:54,391 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 22:06:54,391 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 22:06:54,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L768-->L771: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][120], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), 292#true, Black: 265#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 135#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 167#true, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 158#true, 51#$Ultimate##0true, 208#true, Black: 83#(and (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 273#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (<= ~z$w_buff1_used~0 0)) (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (<= ~z$w_buff1_used~0 0))) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), 48#L758true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 87#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 225#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 284#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 285#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 162#(and (= ~z$w_buff0_used~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (= ~z$r_buff0_thd3~0 1) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$w_buff0~0 1)), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 70#true, 306#true, Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 298#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 27#L861true, Black: 246#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P0Thread1of1ForFork0InUse, 28#L771true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P2Thread1of1ForFork1InUse, Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 184#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P1Thread1of1ForFork2InUse, 279#true, Black: 125#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0))]) [2024-06-27 22:06:54,513 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-06-27 22:06:54,513 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 22:06:54,514 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 22:06:54,514 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 22:06:54,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L768-->L771: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][120], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), 30#L867true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), 292#true, Black: 265#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 135#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 167#true, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 158#true, 51#$Ultimate##0true, 208#true, Black: 83#(and (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 273#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (<= ~z$w_buff1_used~0 0)) (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (<= ~z$w_buff1_used~0 0))) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), 48#L758true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 87#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 225#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 284#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 285#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 162#(and (= ~z$w_buff0_used~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (= ~z$r_buff0_thd3~0 1) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$w_buff0~0 1)), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 70#true, 306#true, Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 298#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P0Thread1of1ForFork0InUse, 28#L771true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P2Thread1of1ForFork1InUse, Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 184#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P1Thread1of1ForFork2InUse, 279#true, Black: 125#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0))]) [2024-06-27 22:06:54,541 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 22:06:54,541 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 22:06:54,541 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 22:06:54,541 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 22:06:54,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L768-->L771: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][120], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), 292#true, Black: 265#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 135#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 201#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 167#true, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), 158#true, 51#$Ultimate##0true, 208#true, Black: 83#(and (= 0 ~z$flush_delayed~0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (= ~z$w_buff1_used~0 0) (<= ~z$w_buff0_used~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd2~0 0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (= ~z$r_buff1_thd3~0 0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 (div ~z$r_buff0_thd2~0 256)) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~x~0 1) (<= 0 ~z$w_buff0_used~0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (<= 0 ~z~0) (= ~z$r_buff1_thd2~0 0)), Black: 273#(or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (<= ~z$w_buff1_used~0 0)) (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$r_buff0_thd3~0 1) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (<= ~z$w_buff1_used~0 0))) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), 48#L758true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 87#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 284#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 225#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 285#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 162#(and (= ~z$w_buff0_used~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (= ~z$r_buff0_thd3~0 1) (<= ~z$r_buff1_thd0~0 0) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$w_buff0~0 1)), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~z$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~y~0) (= ~a~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 41#L18-1true, 70#true, 306#true, Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 298#(and (or (= |#ghost~multithreaded| 0) (and (<= ~z~0 ~z$w_buff0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= 0 ~z$mem_tmp~0) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= 0 ~z~0))) (= ~__unbuffered_p2_EBX~0 0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P0Thread1of1ForFork0InUse, 28#L771true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P2Thread1of1ForFork1InUse, Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (or (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 184#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), P1Thread1of1ForFork2InUse, 279#true, Black: 125#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (<= ~z~0 ~z$w_buff0~0) (<= 0 ~__unbuffered_p2_EAX~0) (<= ~__unbuffered_p2_EAX~0 ~z$w_buff0~0) (<= 0 ~z$mem_tmp~0) (<= ~__unbuffered_p1_EBX~0 ~z$w_buff0~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~__unbuffered_p1_EBX~0) (<= ~z$mem_tmp~0 ~z$w_buff0~0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$r_buff0_thd3~0 (+ ~z$w_buff0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= 2 ~x~0) (<= ~z$r_buff1_thd1~0 (+ (* (div ~z$r_buff1_thd1~0 256) 256) 1)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~a~0 1) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0~0)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (<= 0 ~y~0) (= ~__unbuffered_p2_EBX~0 0) (<= 0 ~z~0))]) [2024-06-27 22:06:54,662 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-27 22:06:54,662 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 22:06:54,662 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 22:06:54,662 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 22:06:54,989 INFO L124 PetriNetUnfolderBase]: 4774/8378 cut-off events. [2024-06-27 22:06:54,989 INFO L125 PetriNetUnfolderBase]: For 79760/79961 co-relation queries the response was YES. [2024-06-27 22:06:55,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36497 conditions, 8378 events. 4774/8378 cut-off events. For 79760/79961 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 59698 event pairs, 1137 based on Foata normal form. 183/8278 useless extension candidates. Maximal degree in co-relation 36438. Up to 5773 conditions per place. [2024-06-27 22:06:55,048 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 112 selfloop transitions, 77 changer transitions 0/242 dead transitions. [2024-06-27 22:06:55,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 242 transitions, 2908 flow [2024-06-27 22:06:55,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:06:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:06:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2024-06-27 22:06:55,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6005830903790087 [2024-06-27 22:06:55,050 INFO L175 Difference]: Start difference. First operand has 132 places, 186 transitions, 2128 flow. Second operand 7 states and 206 transitions. [2024-06-27 22:06:55,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 242 transitions, 2908 flow [2024-06-27 22:06:55,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 242 transitions, 2768 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 22:06:55,159 INFO L231 Difference]: Finished difference. Result has 135 places, 197 transitions, 2344 flow [2024-06-27 22:06:55,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2344, PETRI_PLACES=135, PETRI_TRANSITIONS=197} [2024-06-27 22:06:55,159 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 80 predicate places. [2024-06-27 22:06:55,159 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 197 transitions, 2344 flow [2024-06-27 22:06:55,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:55,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:55,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:55,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:06:55,160 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:55,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1235518238, now seen corresponding path program 1 times [2024-06-27 22:06:55,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:55,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232381044] [2024-06-27 22:06:55,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:55,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:56,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:56,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232381044] [2024-06-27 22:06:56,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232381044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:56,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:56,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:06:56,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538234940] [2024-06-27 22:06:56,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:56,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:06:56,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:56,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:06:56,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:06:56,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:06:56,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 197 transitions, 2344 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:56,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:06:56,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:06:56,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:06:58,248 INFO L124 PetriNetUnfolderBase]: 6373/10552 cut-off events. [2024-06-27 22:06:58,248 INFO L125 PetriNetUnfolderBase]: For 102754/102762 co-relation queries the response was YES. [2024-06-27 22:06:58,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48129 conditions, 10552 events. 6373/10552 cut-off events. For 102754/102762 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 71785 event pairs, 1876 based on Foata normal form. 12/10264 useless extension candidates. Maximal degree in co-relation 48067. Up to 7591 conditions per place. [2024-06-27 22:06:58,337 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 164 selfloop transitions, 122 changer transitions 0/296 dead transitions. [2024-06-27 22:06:58,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 296 transitions, 3800 flow [2024-06-27 22:06:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:06:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:06:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 249 transitions. [2024-06-27 22:06:58,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.564625850340136 [2024-06-27 22:06:58,339 INFO L175 Difference]: Start difference. First operand has 135 places, 197 transitions, 2344 flow. Second operand 9 states and 249 transitions. [2024-06-27 22:06:58,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 296 transitions, 3800 flow [2024-06-27 22:06:58,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 296 transitions, 3751 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-27 22:06:58,477 INFO L231 Difference]: Finished difference. Result has 143 places, 229 transitions, 3125 flow [2024-06-27 22:06:58,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2305, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3125, PETRI_PLACES=143, PETRI_TRANSITIONS=229} [2024-06-27 22:06:58,478 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 88 predicate places. [2024-06-27 22:06:58,478 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 229 transitions, 3125 flow [2024-06-27 22:06:58,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:06:58,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:06:58,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:06:58,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:06:58,478 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:06:58,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:06:58,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2081278158, now seen corresponding path program 2 times [2024-06-27 22:06:58,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:06:58,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549603061] [2024-06-27 22:06:58,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:06:58,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:06:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:06:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:06:59,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:06:59,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549603061] [2024-06-27 22:06:59,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549603061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:06:59,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:06:59,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:06:59,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207870224] [2024-06-27 22:06:59,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:06:59,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:06:59,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:06:59,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:06:59,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:07:00,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:07:00,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 229 transitions, 3125 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:00,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:00,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:07:00,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:01,968 INFO L124 PetriNetUnfolderBase]: 6754/11088 cut-off events. [2024-06-27 22:07:01,969 INFO L125 PetriNetUnfolderBase]: For 116337/116341 co-relation queries the response was YES. [2024-06-27 22:07:02,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54120 conditions, 11088 events. 6754/11088 cut-off events. For 116337/116341 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 75191 event pairs, 1845 based on Foata normal form. 8/10810 useless extension candidates. Maximal degree in co-relation 54055. Up to 7861 conditions per place. [2024-06-27 22:07:02,058 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 172 selfloop transitions, 145 changer transitions 0/327 dead transitions. [2024-06-27 22:07:02,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 327 transitions, 4714 flow [2024-06-27 22:07:02,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:07:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:07:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 247 transitions. [2024-06-27 22:07:02,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5600907029478458 [2024-06-27 22:07:02,060 INFO L175 Difference]: Start difference. First operand has 143 places, 229 transitions, 3125 flow. Second operand 9 states and 247 transitions. [2024-06-27 22:07:02,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 327 transitions, 4714 flow [2024-06-27 22:07:02,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 327 transitions, 4514 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-27 22:07:02,270 INFO L231 Difference]: Finished difference. Result has 151 places, 263 transitions, 3876 flow [2024-06-27 22:07:02,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2951, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3876, PETRI_PLACES=151, PETRI_TRANSITIONS=263} [2024-06-27 22:07:02,271 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 96 predicate places. [2024-06-27 22:07:02,271 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 263 transitions, 3876 flow [2024-06-27 22:07:02,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:02,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:02,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:02,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:07:02,271 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:02,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1195473368, now seen corresponding path program 3 times [2024-06-27 22:07:02,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:02,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114977667] [2024-06-27 22:07:02,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:02,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:03,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:03,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114977667] [2024-06-27 22:07:03,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114977667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:03,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:03,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:07:03,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274724243] [2024-06-27 22:07:03,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:03,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:07:03,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:03,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:07:03,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:07:03,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:07:03,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 263 transitions, 3876 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:03,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:03,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:07:03,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:05,682 INFO L124 PetriNetUnfolderBase]: 6738/11083 cut-off events. [2024-06-27 22:07:05,683 INFO L125 PetriNetUnfolderBase]: For 127661/127665 co-relation queries the response was YES. [2024-06-27 22:07:05,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55894 conditions, 11083 events. 6738/11083 cut-off events. For 127661/127665 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 75308 event pairs, 1848 based on Foata normal form. 8/10805 useless extension candidates. Maximal degree in co-relation 55825. Up to 7848 conditions per place. [2024-06-27 22:07:05,775 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 175 selfloop transitions, 143 changer transitions 0/328 dead transitions. [2024-06-27 22:07:05,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 328 transitions, 4948 flow [2024-06-27 22:07:05,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:07:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:07:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 248 transitions. [2024-06-27 22:07:05,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.562358276643991 [2024-06-27 22:07:05,776 INFO L175 Difference]: Start difference. First operand has 151 places, 263 transitions, 3876 flow. Second operand 9 states and 248 transitions. [2024-06-27 22:07:05,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 328 transitions, 4948 flow [2024-06-27 22:07:06,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 328 transitions, 4732 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-27 22:07:06,053 INFO L231 Difference]: Finished difference. Result has 158 places, 266 transitions, 4087 flow [2024-06-27 22:07:06,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3662, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4087, PETRI_PLACES=158, PETRI_TRANSITIONS=266} [2024-06-27 22:07:06,054 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 103 predicate places. [2024-06-27 22:07:06,054 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 266 transitions, 4087 flow [2024-06-27 22:07:06,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:06,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:06,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:06,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:07:06,054 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:06,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:06,055 INFO L85 PathProgramCache]: Analyzing trace with hash 462767558, now seen corresponding path program 1 times [2024-06-27 22:07:06,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:06,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086062728] [2024-06-27 22:07:06,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:06,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:06,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:06,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086062728] [2024-06-27 22:07:06,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086062728] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:06,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:06,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:07:06,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506271517] [2024-06-27 22:07:06,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:06,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:07:06,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:06,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:07:06,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:07:07,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:07:07,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 266 transitions, 4087 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:07,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:07,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:07:07,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:08,390 INFO L124 PetriNetUnfolderBase]: 6310/10232 cut-off events. [2024-06-27 22:07:08,391 INFO L125 PetriNetUnfolderBase]: For 136253/136308 co-relation queries the response was YES. [2024-06-27 22:07:08,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52808 conditions, 10232 events. 6310/10232 cut-off events. For 136253/136308 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 69475 event pairs, 2445 based on Foata normal form. 56/10042 useless extension candidates. Maximal degree in co-relation 52736. Up to 8897 conditions per place. [2024-06-27 22:07:08,484 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 263 selfloop transitions, 24 changer transitions 0/307 dead transitions. [2024-06-27 22:07:08,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 307 transitions, 5004 flow [2024-06-27 22:07:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:07:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:07:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-06-27 22:07:08,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072886297376094 [2024-06-27 22:07:08,486 INFO L175 Difference]: Start difference. First operand has 158 places, 266 transitions, 4087 flow. Second operand 7 states and 174 transitions. [2024-06-27 22:07:08,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 307 transitions, 5004 flow [2024-06-27 22:07:08,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 307 transitions, 4759 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-27 22:07:08,867 INFO L231 Difference]: Finished difference. Result has 162 places, 283 transitions, 4199 flow [2024-06-27 22:07:08,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3854, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4199, PETRI_PLACES=162, PETRI_TRANSITIONS=283} [2024-06-27 22:07:08,868 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 107 predicate places. [2024-06-27 22:07:08,868 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 283 transitions, 4199 flow [2024-06-27 22:07:08,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:08,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:08,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:08,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:07:08,869 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:08,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1563287662, now seen corresponding path program 4 times [2024-06-27 22:07:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:08,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921841983] [2024-06-27 22:07:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:08,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:10,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:10,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921841983] [2024-06-27 22:07:10,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921841983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:10,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:07:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425508103] [2024-06-27 22:07:10,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:10,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:07:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:07:10,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:07:10,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:07:10,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 283 transitions, 4199 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:10,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:10,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:07:10,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:12,237 INFO L124 PetriNetUnfolderBase]: 6400/9844 cut-off events. [2024-06-27 22:07:12,238 INFO L125 PetriNetUnfolderBase]: For 138953/139004 co-relation queries the response was YES. [2024-06-27 22:07:12,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53002 conditions, 9844 events. 6400/9844 cut-off events. For 138953/139004 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 62010 event pairs, 1285 based on Foata normal form. 67/9794 useless extension candidates. Maximal degree in co-relation 52927. Up to 8339 conditions per place. [2024-06-27 22:07:12,339 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 205 selfloop transitions, 105 changer transitions 0/330 dead transitions. [2024-06-27 22:07:12,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 330 transitions, 5127 flow [2024-06-27 22:07:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:07:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:07:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-06-27 22:07:12,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2024-06-27 22:07:12,340 INFO L175 Difference]: Start difference. First operand has 162 places, 283 transitions, 4199 flow. Second operand 8 states and 202 transitions. [2024-06-27 22:07:12,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 330 transitions, 5127 flow [2024-06-27 22:07:12,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 330 transitions, 5077 flow, removed 21 selfloop flow, removed 2 redundant places. [2024-06-27 22:07:12,663 INFO L231 Difference]: Finished difference. Result has 168 places, 289 transitions, 4474 flow [2024-06-27 22:07:12,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4153, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4474, PETRI_PLACES=168, PETRI_TRANSITIONS=289} [2024-06-27 22:07:12,664 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 113 predicate places. [2024-06-27 22:07:12,664 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 289 transitions, 4474 flow [2024-06-27 22:07:12,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:12,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:12,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:12,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:07:12,665 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:12,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:12,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1560430702, now seen corresponding path program 5 times [2024-06-27 22:07:12,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:12,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502556546] [2024-06-27 22:07:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:12,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:14,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:14,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502556546] [2024-06-27 22:07:14,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502556546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:14,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:14,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:07:14,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140644748] [2024-06-27 22:07:14,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:14,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:07:14,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:14,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:07:14,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:07:14,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:07:14,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 289 transitions, 4474 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:14,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:14,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:07:14,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:15,712 INFO L124 PetriNetUnfolderBase]: 6556/10102 cut-off events. [2024-06-27 22:07:15,712 INFO L125 PetriNetUnfolderBase]: For 148917/148964 co-relation queries the response was YES. [2024-06-27 22:07:15,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55410 conditions, 10102 events. 6556/10102 cut-off events. For 148917/148964 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 64227 event pairs, 1288 based on Foata normal form. 53/10035 useless extension candidates. Maximal degree in co-relation 55333. Up to 8208 conditions per place. [2024-06-27 22:07:15,816 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 211 selfloop transitions, 108 changer transitions 0/339 dead transitions. [2024-06-27 22:07:15,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 339 transitions, 5388 flow [2024-06-27 22:07:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:07:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:07:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-06-27 22:07:15,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2024-06-27 22:07:15,818 INFO L175 Difference]: Start difference. First operand has 168 places, 289 transitions, 4474 flow. Second operand 8 states and 203 transitions. [2024-06-27 22:07:15,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 339 transitions, 5388 flow [2024-06-27 22:07:16,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 339 transitions, 5145 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-27 22:07:16,186 INFO L231 Difference]: Finished difference. Result has 171 places, 298 transitions, 4594 flow [2024-06-27 22:07:16,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4231, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4594, PETRI_PLACES=171, PETRI_TRANSITIONS=298} [2024-06-27 22:07:16,187 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 116 predicate places. [2024-06-27 22:07:16,187 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 298 transitions, 4594 flow [2024-06-27 22:07:16,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:16,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:16,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:16,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:07:16,188 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:16,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:16,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1204680068, now seen corresponding path program 4 times [2024-06-27 22:07:16,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:16,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363276041] [2024-06-27 22:07:16,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:16,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:17,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:17,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363276041] [2024-06-27 22:07:17,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363276041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:17,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:17,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:07:17,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243099237] [2024-06-27 22:07:17,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:17,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:07:17,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:17,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:07:17,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:07:17,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:07:17,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 298 transitions, 4594 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:17,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:17,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:07:17,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:19,806 INFO L124 PetriNetUnfolderBase]: 7280/11346 cut-off events. [2024-06-27 22:07:19,807 INFO L125 PetriNetUnfolderBase]: For 162945/162947 co-relation queries the response was YES. [2024-06-27 22:07:19,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62089 conditions, 11346 events. 7280/11346 cut-off events. For 162945/162947 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 73843 event pairs, 1632 based on Foata normal form. 8/11189 useless extension candidates. Maximal degree in co-relation 62010. Up to 8557 conditions per place. [2024-06-27 22:07:19,921 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 184 selfloop transitions, 176 changer transitions 0/370 dead transitions. [2024-06-27 22:07:19,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 370 transitions, 5968 flow [2024-06-27 22:07:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:07:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:07:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-06-27 22:07:19,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5586734693877551 [2024-06-27 22:07:19,922 INFO L175 Difference]: Start difference. First operand has 171 places, 298 transitions, 4594 flow. Second operand 8 states and 219 transitions. [2024-06-27 22:07:19,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 370 transitions, 5968 flow [2024-06-27 22:07:20,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 370 transitions, 5719 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-27 22:07:20,375 INFO L231 Difference]: Finished difference. Result has 176 places, 315 transitions, 5171 flow [2024-06-27 22:07:20,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4359, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5171, PETRI_PLACES=176, PETRI_TRANSITIONS=315} [2024-06-27 22:07:20,376 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 121 predicate places. [2024-06-27 22:07:20,376 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 315 transitions, 5171 flow [2024-06-27 22:07:20,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:20,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:20,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:20,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:07:20,376 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:20,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1678763282, now seen corresponding path program 5 times [2024-06-27 22:07:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940890952] [2024-06-27 22:07:20,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:20,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:21,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:21,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940890952] [2024-06-27 22:07:21,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940890952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:21,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:21,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:07:21,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305113260] [2024-06-27 22:07:21,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:21,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:07:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:21,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:07:21,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:07:21,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:07:21,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 315 transitions, 5171 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:21,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:21,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:07:21,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:24,188 INFO L124 PetriNetUnfolderBase]: 7607/11709 cut-off events. [2024-06-27 22:07:24,188 INFO L125 PetriNetUnfolderBase]: For 179068/179070 co-relation queries the response was YES. [2024-06-27 22:07:24,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67930 conditions, 11709 events. 7607/11709 cut-off events. For 179068/179070 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 75188 event pairs, 1533 based on Foata normal form. 8/11600 useless extension candidates. Maximal degree in co-relation 67848. Up to 8826 conditions per place. [2024-06-27 22:07:24,284 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 195 selfloop transitions, 190 changer transitions 0/395 dead transitions. [2024-06-27 22:07:24,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 395 transitions, 6879 flow [2024-06-27 22:07:24,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:07:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:07:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-06-27 22:07:24,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5586734693877551 [2024-06-27 22:07:24,286 INFO L175 Difference]: Start difference. First operand has 176 places, 315 transitions, 5171 flow. Second operand 8 states and 219 transitions. [2024-06-27 22:07:24,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 395 transitions, 6879 flow [2024-06-27 22:07:24,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 395 transitions, 6367 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-27 22:07:24,745 INFO L231 Difference]: Finished difference. Result has 179 places, 341 transitions, 5622 flow [2024-06-27 22:07:24,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4731, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5622, PETRI_PLACES=179, PETRI_TRANSITIONS=341} [2024-06-27 22:07:24,746 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 124 predicate places. [2024-06-27 22:07:24,746 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 341 transitions, 5622 flow [2024-06-27 22:07:24,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:24,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:24,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:24,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:07:24,747 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:24,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1678756772, now seen corresponding path program 6 times [2024-06-27 22:07:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:24,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93367780] [2024-06-27 22:07:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:26,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:26,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93367780] [2024-06-27 22:07:26,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93367780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:26,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:26,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:07:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358327879] [2024-06-27 22:07:26,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:26,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:07:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:26,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:07:26,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:07:26,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:07:26,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 341 transitions, 5622 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:26,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:26,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:07:26,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:28,443 INFO L124 PetriNetUnfolderBase]: 7585/11675 cut-off events. [2024-06-27 22:07:28,443 INFO L125 PetriNetUnfolderBase]: For 176219/176221 co-relation queries the response was YES. [2024-06-27 22:07:28,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67854 conditions, 11675 events. 7585/11675 cut-off events. For 176219/176221 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 75064 event pairs, 1556 based on Foata normal form. 8/11567 useless extension candidates. Maximal degree in co-relation 67771. Up to 8808 conditions per place. [2024-06-27 22:07:28,559 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 202 selfloop transitions, 186 changer transitions 0/398 dead transitions. [2024-06-27 22:07:28,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 398 transitions, 6801 flow [2024-06-27 22:07:28,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:07:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:07:28,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-06-27 22:07:28,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5586734693877551 [2024-06-27 22:07:28,561 INFO L175 Difference]: Start difference. First operand has 179 places, 341 transitions, 5622 flow. Second operand 8 states and 219 transitions. [2024-06-27 22:07:28,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 398 transitions, 6801 flow [2024-06-27 22:07:29,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 398 transitions, 6514 flow, removed 44 selfloop flow, removed 3 redundant places. [2024-06-27 22:07:29,108 INFO L231 Difference]: Finished difference. Result has 184 places, 341 transitions, 5726 flow [2024-06-27 22:07:29,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5335, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5726, PETRI_PLACES=184, PETRI_TRANSITIONS=341} [2024-06-27 22:07:29,109 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 129 predicate places. [2024-06-27 22:07:29,109 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 341 transitions, 5726 flow [2024-06-27 22:07:29,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:29,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:29,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:29,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:07:29,110 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:29,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:29,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1762739940, now seen corresponding path program 2 times [2024-06-27 22:07:29,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:29,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383651910] [2024-06-27 22:07:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:29,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:29,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:29,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383651910] [2024-06-27 22:07:29,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383651910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:29,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:29,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:07:29,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395712789] [2024-06-27 22:07:29,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:29,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:07:29,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:29,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:07:29,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:07:30,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:07:30,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 341 transitions, 5726 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:30,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:30,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:07:30,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:31,719 INFO L124 PetriNetUnfolderBase]: 7034/11711 cut-off events. [2024-06-27 22:07:31,720 INFO L125 PetriNetUnfolderBase]: For 189425/189502 co-relation queries the response was YES. [2024-06-27 22:07:31,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64339 conditions, 11711 events. 7034/11711 cut-off events. For 189425/189502 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 83322 event pairs, 2575 based on Foata normal form. 71/11444 useless extension candidates. Maximal degree in co-relation 64255. Up to 9901 conditions per place. [2024-06-27 22:07:31,854 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 316 selfloop transitions, 29 changer transitions 0/367 dead transitions. [2024-06-27 22:07:31,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 367 transitions, 6547 flow [2024-06-27 22:07:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:07:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:07:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-06-27 22:07:31,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478134110787172 [2024-06-27 22:07:31,856 INFO L175 Difference]: Start difference. First operand has 184 places, 341 transitions, 5726 flow. Second operand 7 states and 164 transitions. [2024-06-27 22:07:31,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 367 transitions, 6547 flow [2024-06-27 22:07:32,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 367 transitions, 6145 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-27 22:07:32,291 INFO L231 Difference]: Finished difference. Result has 184 places, 350 transitions, 5475 flow [2024-06-27 22:07:32,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5324, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5475, PETRI_PLACES=184, PETRI_TRANSITIONS=350} [2024-06-27 22:07:32,292 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 129 predicate places. [2024-06-27 22:07:32,292 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 350 transitions, 5475 flow [2024-06-27 22:07:32,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:32,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:32,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:32,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:07:32,292 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:32,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:32,293 INFO L85 PathProgramCache]: Analyzing trace with hash 331363312, now seen corresponding path program 7 times [2024-06-27 22:07:32,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:32,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6137196] [2024-06-27 22:07:32,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:32,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:33,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:33,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6137196] [2024-06-27 22:07:33,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6137196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:33,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:33,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:07:33,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986240524] [2024-06-27 22:07:33,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:33,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:07:33,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:33,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:07:33,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:07:33,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:07:33,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 350 transitions, 5475 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:33,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:33,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:07:33,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:36,028 INFO L124 PetriNetUnfolderBase]: 7875/12117 cut-off events. [2024-06-27 22:07:36,029 INFO L125 PetriNetUnfolderBase]: For 192548/192550 co-relation queries the response was YES. [2024-06-27 22:07:36,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70378 conditions, 12117 events. 7875/12117 cut-off events. For 192548/192550 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 78240 event pairs, 1485 based on Foata normal form. 10/12020 useless extension candidates. Maximal degree in co-relation 70294. Up to 9068 conditions per place. [2024-06-27 22:07:36,151 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 222 selfloop transitions, 199 changer transitions 0/431 dead transitions. [2024-06-27 22:07:36,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 431 transitions, 7262 flow [2024-06-27 22:07:36,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:07:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:07:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-06-27 22:07:36,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-06-27 22:07:36,153 INFO L175 Difference]: Start difference. First operand has 184 places, 350 transitions, 5475 flow. Second operand 8 states and 216 transitions. [2024-06-27 22:07:36,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 431 transitions, 7262 flow [2024-06-27 22:07:36,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 431 transitions, 7207 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-27 22:07:36,879 INFO L231 Difference]: Finished difference. Result has 190 places, 374 transitions, 6258 flow [2024-06-27 22:07:36,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5420, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6258, PETRI_PLACES=190, PETRI_TRANSITIONS=374} [2024-06-27 22:07:36,879 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 135 predicate places. [2024-06-27 22:07:36,879 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 374 transitions, 6258 flow [2024-06-27 22:07:36,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:36,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:36,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:36,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:07:36,880 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:36,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:36,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2056292686, now seen corresponding path program 8 times [2024-06-27 22:07:36,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:36,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270767971] [2024-06-27 22:07:36,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:36,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:38,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:38,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270767971] [2024-06-27 22:07:38,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270767971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:38,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:38,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:07:38,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514216933] [2024-06-27 22:07:38,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:38,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:07:38,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:38,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:07:38,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:07:38,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:07:38,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 374 transitions, 6258 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:38,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:38,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:07:38,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:40,858 INFO L124 PetriNetUnfolderBase]: 7853/12074 cut-off events. [2024-06-27 22:07:40,858 INFO L125 PetriNetUnfolderBase]: For 208130/208132 co-relation queries the response was YES. [2024-06-27 22:07:40,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72263 conditions, 12074 events. 7853/12074 cut-off events. For 208130/208132 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 77875 event pairs, 1491 based on Foata normal form. 10/11981 useless extension candidates. Maximal degree in co-relation 72177. Up to 9050 conditions per place. [2024-06-27 22:07:41,004 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 199 selfloop transitions, 216 changer transitions 0/425 dead transitions. [2024-06-27 22:07:41,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 425 transitions, 7454 flow [2024-06-27 22:07:41,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:07:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:07:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2024-06-27 22:07:41,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382653061224489 [2024-06-27 22:07:41,006 INFO L175 Difference]: Start difference. First operand has 190 places, 374 transitions, 6258 flow. Second operand 8 states and 211 transitions. [2024-06-27 22:07:41,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 425 transitions, 7454 flow [2024-06-27 22:07:41,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 425 transitions, 7017 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-06-27 22:07:41,602 INFO L231 Difference]: Finished difference. Result has 194 places, 374 transitions, 6268 flow [2024-06-27 22:07:41,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5821, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6268, PETRI_PLACES=194, PETRI_TRANSITIONS=374} [2024-06-27 22:07:41,603 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 139 predicate places. [2024-06-27 22:07:41,603 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 374 transitions, 6268 flow [2024-06-27 22:07:41,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:41,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:41,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:41,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:07:41,604 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:41,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:41,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2017266720, now seen corresponding path program 9 times [2024-06-27 22:07:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:41,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997487102] [2024-06-27 22:07:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:43,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:43,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997487102] [2024-06-27 22:07:43,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997487102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:43,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:43,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:07:43,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25737404] [2024-06-27 22:07:43,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:43,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:07:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:43,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:07:43,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:07:43,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:07:43,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 374 transitions, 6268 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:43,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:43,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:07:43,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:45,418 INFO L124 PetriNetUnfolderBase]: 7831/12051 cut-off events. [2024-06-27 22:07:45,419 INFO L125 PetriNetUnfolderBase]: For 213569/213571 co-relation queries the response was YES. [2024-06-27 22:07:45,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71589 conditions, 12051 events. 7831/12051 cut-off events. For 213569/213571 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 77797 event pairs, 1469 based on Foata normal form. 10/11957 useless extension candidates. Maximal degree in co-relation 71503. Up to 9032 conditions per place. [2024-06-27 22:07:45,542 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 218 selfloop transitions, 201 changer transitions 0/429 dead transitions. [2024-06-27 22:07:45,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 429 transitions, 7456 flow [2024-06-27 22:07:45,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:07:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:07:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2024-06-27 22:07:45,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382653061224489 [2024-06-27 22:07:45,543 INFO L175 Difference]: Start difference. First operand has 194 places, 374 transitions, 6268 flow. Second operand 8 states and 211 transitions. [2024-06-27 22:07:45,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 429 transitions, 7456 flow [2024-06-27 22:07:46,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 429 transitions, 7068 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-27 22:07:46,178 INFO L231 Difference]: Finished difference. Result has 197 places, 374 transitions, 6297 flow [2024-06-27 22:07:46,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5880, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6297, PETRI_PLACES=197, PETRI_TRANSITIONS=374} [2024-06-27 22:07:46,178 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 142 predicate places. [2024-06-27 22:07:46,178 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 374 transitions, 6297 flow [2024-06-27 22:07:46,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:46,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:46,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:46,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:07:46,179 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:46,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1776102180, now seen corresponding path program 3 times [2024-06-27 22:07:46,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:46,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734814182] [2024-06-27 22:07:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:47,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:47,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734814182] [2024-06-27 22:07:47,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734814182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:47,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:47,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:07:47,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826290657] [2024-06-27 22:07:47,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:47,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:07:47,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:47,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:07:47,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:07:47,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:07:47,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 374 transitions, 6297 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:47,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:47,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:07:47,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:48,994 INFO L124 PetriNetUnfolderBase]: 7244/12106 cut-off events. [2024-06-27 22:07:48,995 INFO L125 PetriNetUnfolderBase]: For 224293/224366 co-relation queries the response was YES. [2024-06-27 22:07:49,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67700 conditions, 12106 events. 7244/12106 cut-off events. For 224293/224366 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 86959 event pairs, 2613 based on Foata normal form. 67/11819 useless extension candidates. Maximal degree in co-relation 67613. Up to 10169 conditions per place. [2024-06-27 22:07:49,121 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 330 selfloop transitions, 40 changer transitions 0/392 dead transitions. [2024-06-27 22:07:49,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 392 transitions, 7141 flow [2024-06-27 22:07:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:07:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:07:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-06-27 22:07:49,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2024-06-27 22:07:49,122 INFO L175 Difference]: Start difference. First operand has 197 places, 374 transitions, 6297 flow. Second operand 7 states and 161 transitions. [2024-06-27 22:07:49,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 392 transitions, 7141 flow [2024-06-27 22:07:49,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 392 transitions, 6763 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 22:07:49,576 INFO L231 Difference]: Finished difference. Result has 198 places, 378 transitions, 6062 flow [2024-06-27 22:07:49,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5919, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6062, PETRI_PLACES=198, PETRI_TRANSITIONS=378} [2024-06-27 22:07:49,577 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 143 predicate places. [2024-06-27 22:07:49,577 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 378 transitions, 6062 flow [2024-06-27 22:07:49,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:49,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:49,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:49,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:07:49,577 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:49,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1768459812, now seen corresponding path program 1 times [2024-06-27 22:07:49,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:49,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253813151] [2024-06-27 22:07:49,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:49,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:50,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:50,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253813151] [2024-06-27 22:07:50,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253813151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:50,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:50,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:07:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103474124] [2024-06-27 22:07:50,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:50,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:07:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:50,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:07:50,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:07:50,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:07:50,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 378 transitions, 6062 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:50,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:50,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:07:50,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:52,335 INFO L124 PetriNetUnfolderBase]: 7281/12021 cut-off events. [2024-06-27 22:07:52,335 INFO L125 PetriNetUnfolderBase]: For 224598/224661 co-relation queries the response was YES. [2024-06-27 22:07:52,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67277 conditions, 12021 events. 7281/12021 cut-off events. For 224598/224661 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 85783 event pairs, 2860 based on Foata normal form. 58/11756 useless extension candidates. Maximal degree in co-relation 67189. Up to 10261 conditions per place. [2024-06-27 22:07:52,464 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 365 selfloop transitions, 18 changer transitions 0/405 dead transitions. [2024-06-27 22:07:52,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 405 transitions, 7043 flow [2024-06-27 22:07:52,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:07:52,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:07:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-06-27 22:07:52,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2024-06-27 22:07:52,466 INFO L175 Difference]: Start difference. First operand has 198 places, 378 transitions, 6062 flow. Second operand 7 states and 161 transitions. [2024-06-27 22:07:52,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 405 transitions, 7043 flow [2024-06-27 22:07:52,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 405 transitions, 6928 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 22:07:52,966 INFO L231 Difference]: Finished difference. Result has 201 places, 388 transitions, 6161 flow [2024-06-27 22:07:52,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5947, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6161, PETRI_PLACES=201, PETRI_TRANSITIONS=388} [2024-06-27 22:07:52,967 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 146 predicate places. [2024-06-27 22:07:52,967 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 388 transitions, 6161 flow [2024-06-27 22:07:52,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:52,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:52,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:52,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:07:52,967 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:52,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1776108132, now seen corresponding path program 2 times [2024-06-27 22:07:52,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:52,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577007639] [2024-06-27 22:07:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:54,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:54,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577007639] [2024-06-27 22:07:54,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577007639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:54,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:54,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:07:54,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839258048] [2024-06-27 22:07:54,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:54,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:07:54,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:54,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:07:54,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:07:54,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:07:54,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 388 transitions, 6161 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:54,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:54,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:07:54,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:07:55,919 INFO L124 PetriNetUnfolderBase]: 7278/12013 cut-off events. [2024-06-27 22:07:55,920 INFO L125 PetriNetUnfolderBase]: For 234279/234342 co-relation queries the response was YES. [2024-06-27 22:07:55,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68555 conditions, 12013 events. 7278/12013 cut-off events. For 234279/234342 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 85718 event pairs, 2866 based on Foata normal form. 57/11745 useless extension candidates. Maximal degree in co-relation 68465. Up to 10243 conditions per place. [2024-06-27 22:07:56,052 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 359 selfloop transitions, 25 changer transitions 0/406 dead transitions. [2024-06-27 22:07:56,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 406 transitions, 7033 flow [2024-06-27 22:07:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:07:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:07:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-06-27 22:07:56,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46647230320699706 [2024-06-27 22:07:56,054 INFO L175 Difference]: Start difference. First operand has 201 places, 388 transitions, 6161 flow. Second operand 7 states and 160 transitions. [2024-06-27 22:07:56,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 406 transitions, 7033 flow [2024-06-27 22:07:56,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 406 transitions, 6983 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-27 22:07:56,504 INFO L231 Difference]: Finished difference. Result has 205 places, 392 transitions, 6224 flow [2024-06-27 22:07:56,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6111, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6224, PETRI_PLACES=205, PETRI_TRANSITIONS=392} [2024-06-27 22:07:56,505 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 150 predicate places. [2024-06-27 22:07:56,505 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 392 transitions, 6224 flow [2024-06-27 22:07:56,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:56,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:07:56,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:07:56,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:07:56,506 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:07:56,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:07:56,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2008678170, now seen corresponding path program 1 times [2024-06-27 22:07:56,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:07:56,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641501280] [2024-06-27 22:07:56,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:07:56,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:07:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:07:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:07:58,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:07:58,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641501280] [2024-06-27 22:07:58,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641501280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:07:58,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:07:58,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:07:58,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480965271] [2024-06-27 22:07:58,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:07:58,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:07:58,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:07:58,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:07:58,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:07:58,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:07:58,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 392 transitions, 6224 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:07:58,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:07:58,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:07:58,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:01,203 INFO L124 PetriNetUnfolderBase]: 7846/12878 cut-off events. [2024-06-27 22:08:01,203 INFO L125 PetriNetUnfolderBase]: For 250386/250386 co-relation queries the response was YES. [2024-06-27 22:08:01,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74595 conditions, 12878 events. 7846/12878 cut-off events. For 250386/250386 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 91080 event pairs, 3063 based on Foata normal form. 4/12565 useless extension candidates. Maximal degree in co-relation 74503. Up to 11037 conditions per place. [2024-06-27 22:08:01,360 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 406 selfloop transitions, 30 changer transitions 0/446 dead transitions. [2024-06-27 22:08:01,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 446 transitions, 7388 flow [2024-06-27 22:08:01,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:08:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:08:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 234 transitions. [2024-06-27 22:08:01,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-06-27 22:08:01,362 INFO L175 Difference]: Start difference. First operand has 205 places, 392 transitions, 6224 flow. Second operand 10 states and 234 transitions. [2024-06-27 22:08:01,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 446 transitions, 7388 flow [2024-06-27 22:08:02,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 446 transitions, 7301 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 22:08:02,051 INFO L231 Difference]: Finished difference. Result has 211 places, 398 transitions, 6301 flow [2024-06-27 22:08:02,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6139, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6301, PETRI_PLACES=211, PETRI_TRANSITIONS=398} [2024-06-27 22:08:02,052 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 156 predicate places. [2024-06-27 22:08:02,052 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 398 transitions, 6301 flow [2024-06-27 22:08:02,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:02,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:02,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:02,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:08:02,052 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:08:02,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:02,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1647057270, now seen corresponding path program 1 times [2024-06-27 22:08:02,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:02,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013300807] [2024-06-27 22:08:02,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:02,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:03,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013300807] [2024-06-27 22:08:03,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013300807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:03,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:03,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:08:03,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693162106] [2024-06-27 22:08:03,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:03,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:08:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:03,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:08:03,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:08:03,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:08:03,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 398 transitions, 6301 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:03,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:03,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:08:03,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:05,131 INFO L124 PetriNetUnfolderBase]: 7387/12349 cut-off events. [2024-06-27 22:08:05,132 INFO L125 PetriNetUnfolderBase]: For 261799/261870 co-relation queries the response was YES. [2024-06-27 22:08:05,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73014 conditions, 12349 events. 7387/12349 cut-off events. For 261799/261870 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 89076 event pairs, 2045 based on Foata normal form. 67/12051 useless extension candidates. Maximal degree in co-relation 72920. Up to 9924 conditions per place. [2024-06-27 22:08:05,283 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 384 selfloop transitions, 163 changer transitions 0/569 dead transitions. [2024-06-27 22:08:05,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 569 transitions, 10735 flow [2024-06-27 22:08:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:08:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:08:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-06-27 22:08:05,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280612244897959 [2024-06-27 22:08:05,285 INFO L175 Difference]: Start difference. First operand has 211 places, 398 transitions, 6301 flow. Second operand 8 states and 207 transitions. [2024-06-27 22:08:05,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 569 transitions, 10735 flow [2024-06-27 22:08:05,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 569 transitions, 10618 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-27 22:08:05,923 INFO L231 Difference]: Finished difference. Result has 216 places, 537 transitions, 10155 flow [2024-06-27 22:08:05,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6184, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10155, PETRI_PLACES=216, PETRI_TRANSITIONS=537} [2024-06-27 22:08:05,924 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 161 predicate places. [2024-06-27 22:08:05,924 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 537 transitions, 10155 flow [2024-06-27 22:08:05,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:05,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:05,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:05,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:08:05,925 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:08:05,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1168620602, now seen corresponding path program 2 times [2024-06-27 22:08:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:05,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946102170] [2024-06-27 22:08:05,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:05,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946102170] [2024-06-27 22:08:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946102170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:06,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:06,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:08:06,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233197270] [2024-06-27 22:08:06,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:06,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:08:06,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:08:06,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:08:06,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:08:06,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 537 transitions, 10155 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:06,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:06,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:08:06,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:09,084 INFO L124 PetriNetUnfolderBase]: 7450/12426 cut-off events. [2024-06-27 22:08:09,084 INFO L125 PetriNetUnfolderBase]: For 286434/286515 co-relation queries the response was YES. [2024-06-27 22:08:09,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77407 conditions, 12426 events. 7450/12426 cut-off events. For 286434/286515 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 89413 event pairs, 1987 based on Foata normal form. 67/12127 useless extension candidates. Maximal degree in co-relation 77311. Up to 9986 conditions per place. [2024-06-27 22:08:09,238 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 394 selfloop transitions, 166 changer transitions 0/582 dead transitions. [2024-06-27 22:08:09,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 582 transitions, 11663 flow [2024-06-27 22:08:09,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:08:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:08:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-06-27 22:08:09,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2024-06-27 22:08:09,239 INFO L175 Difference]: Start difference. First operand has 216 places, 537 transitions, 10155 flow. Second operand 8 states and 206 transitions. [2024-06-27 22:08:09,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 582 transitions, 11663 flow [2024-06-27 22:08:10,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 582 transitions, 11448 flow, removed 101 selfloop flow, removed 2 redundant places. [2024-06-27 22:08:10,053 INFO L231 Difference]: Finished difference. Result has 222 places, 552 transitions, 10584 flow [2024-06-27 22:08:10,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10038, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10584, PETRI_PLACES=222, PETRI_TRANSITIONS=552} [2024-06-27 22:08:10,054 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 167 predicate places. [2024-06-27 22:08:10,054 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 552 transitions, 10584 flow [2024-06-27 22:08:10,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:10,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:10,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:10,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:08:10,055 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:08:10,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:10,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1436762770, now seen corresponding path program 3 times [2024-06-27 22:08:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:10,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218078646] [2024-06-27 22:08:10,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:10,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:11,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:11,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218078646] [2024-06-27 22:08:11,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218078646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:11,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:11,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:08:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544030011] [2024-06-27 22:08:11,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:11,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:08:11,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:11,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:08:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:08:11,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:08:11,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 552 transitions, 10584 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:11,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:11,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:08:11,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:13,378 INFO L124 PetriNetUnfolderBase]: 7546/12557 cut-off events. [2024-06-27 22:08:13,378 INFO L125 PetriNetUnfolderBase]: For 312366/312439 co-relation queries the response was YES. [2024-06-27 22:08:13,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80501 conditions, 12557 events. 7546/12557 cut-off events. For 312366/312439 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 90016 event pairs, 1996 based on Foata normal form. 59/12245 useless extension candidates. Maximal degree in co-relation 80403. Up to 9915 conditions per place. [2024-06-27 22:08:13,540 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 401 selfloop transitions, 167 changer transitions 0/590 dead transitions. [2024-06-27 22:08:13,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 590 transitions, 12076 flow [2024-06-27 22:08:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:08:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:08:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-06-27 22:08:13,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2024-06-27 22:08:13,541 INFO L175 Difference]: Start difference. First operand has 222 places, 552 transitions, 10584 flow. Second operand 8 states and 204 transitions. [2024-06-27 22:08:13,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 590 transitions, 12076 flow [2024-06-27 22:08:14,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 590 transitions, 11883 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-06-27 22:08:14,266 INFO L231 Difference]: Finished difference. Result has 228 places, 562 transitions, 10974 flow [2024-06-27 22:08:14,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10391, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10974, PETRI_PLACES=228, PETRI_TRANSITIONS=562} [2024-06-27 22:08:14,267 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 173 predicate places. [2024-06-27 22:08:14,267 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 562 transitions, 10974 flow [2024-06-27 22:08:14,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:14,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:14,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:14,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:08:14,268 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:08:14,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:14,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1436763235, now seen corresponding path program 1 times [2024-06-27 22:08:14,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:14,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219206365] [2024-06-27 22:08:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:14,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:15,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:15,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219206365] [2024-06-27 22:08:15,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219206365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:15,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:15,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:08:15,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085544260] [2024-06-27 22:08:15,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:15,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:08:15,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:15,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:08:15,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:08:15,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:08:15,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 562 transitions, 10974 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:15,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:15,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:08:15,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:18,024 INFO L124 PetriNetUnfolderBase]: 7560/12522 cut-off events. [2024-06-27 22:08:18,024 INFO L125 PetriNetUnfolderBase]: For 340322/340401 co-relation queries the response was YES. [2024-06-27 22:08:18,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82849 conditions, 12522 events. 7560/12522 cut-off events. For 340322/340401 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 89581 event pairs, 2461 based on Foata normal form. 63/12241 useless extension candidates. Maximal degree in co-relation 82749. Up to 10584 conditions per place. [2024-06-27 22:08:18,184 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 538 selfloop transitions, 34 changer transitions 0/594 dead transitions. [2024-06-27 22:08:18,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 594 transitions, 12302 flow [2024-06-27 22:08:18,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:08:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:08:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-06-27 22:08:18,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:08:18,186 INFO L175 Difference]: Start difference. First operand has 228 places, 562 transitions, 10974 flow. Second operand 8 states and 196 transitions. [2024-06-27 22:08:18,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 594 transitions, 12302 flow [2024-06-27 22:08:18,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 594 transitions, 12058 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-27 22:08:18,997 INFO L231 Difference]: Finished difference. Result has 232 places, 565 transitions, 10857 flow [2024-06-27 22:08:18,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10730, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10857, PETRI_PLACES=232, PETRI_TRANSITIONS=565} [2024-06-27 22:08:18,999 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 177 predicate places. [2024-06-27 22:08:18,999 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 565 transitions, 10857 flow [2024-06-27 22:08:18,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:18,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:18,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:18,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:08:19,000 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:08:19,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:19,000 INFO L85 PathProgramCache]: Analyzing trace with hash 761508038, now seen corresponding path program 4 times [2024-06-27 22:08:19,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:19,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488326079] [2024-06-27 22:08:19,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:19,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:20,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:20,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488326079] [2024-06-27 22:08:20,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488326079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:20,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:20,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:08:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215307303] [2024-06-27 22:08:20,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:20,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:08:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:20,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:08:20,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:08:20,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:08:20,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 565 transitions, 10857 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:20,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:20,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:08:20,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:22,242 INFO L124 PetriNetUnfolderBase]: 7670/12648 cut-off events. [2024-06-27 22:08:22,242 INFO L125 PetriNetUnfolderBase]: For 344003/344070 co-relation queries the response was YES. [2024-06-27 22:08:22,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84450 conditions, 12648 events. 7670/12648 cut-off events. For 344003/344070 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 89922 event pairs, 1782 based on Foata normal form. 59/12355 useless extension candidates. Maximal degree in co-relation 84348. Up to 10233 conditions per place. [2024-06-27 22:08:22,410 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 413 selfloop transitions, 177 changer transitions 0/612 dead transitions. [2024-06-27 22:08:22,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 612 transitions, 12403 flow [2024-06-27 22:08:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:08:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:08:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-06-27 22:08:22,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-06-27 22:08:22,412 INFO L175 Difference]: Start difference. First operand has 232 places, 565 transitions, 10857 flow. Second operand 7 states and 182 transitions. [2024-06-27 22:08:22,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 612 transitions, 12403 flow [2024-06-27 22:08:23,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 612 transitions, 12310 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-27 22:08:23,596 INFO L231 Difference]: Finished difference. Result has 233 places, 588 transitions, 11453 flow [2024-06-27 22:08:23,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10764, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11453, PETRI_PLACES=233, PETRI_TRANSITIONS=588} [2024-06-27 22:08:23,597 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 178 predicate places. [2024-06-27 22:08:23,597 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 588 transitions, 11453 flow [2024-06-27 22:08:23,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:23,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:23,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:23,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:08:23,598 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:08:23,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:23,599 INFO L85 PathProgramCache]: Analyzing trace with hash 761867018, now seen corresponding path program 5 times [2024-06-27 22:08:23,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:23,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19988893] [2024-06-27 22:08:23,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:23,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:24,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:24,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19988893] [2024-06-27 22:08:24,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19988893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:24,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:24,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:08:24,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123733606] [2024-06-27 22:08:24,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:24,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:08:24,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:24,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:08:24,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:08:24,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:08:24,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 588 transitions, 11453 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:24,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:24,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:08:24,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:27,241 INFO L124 PetriNetUnfolderBase]: 7836/12907 cut-off events. [2024-06-27 22:08:27,241 INFO L125 PetriNetUnfolderBase]: For 379140/379207 co-relation queries the response was YES. [2024-06-27 22:08:27,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89191 conditions, 12907 events. 7836/12907 cut-off events. For 379140/379207 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 91893 event pairs, 1789 based on Foata normal form. 59/12613 useless extension candidates. Maximal degree in co-relation 89088. Up to 10248 conditions per place. [2024-06-27 22:08:27,381 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 429 selfloop transitions, 179 changer transitions 0/630 dead transitions. [2024-06-27 22:08:27,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 630 transitions, 13167 flow [2024-06-27 22:08:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:08:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:08:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-06-27 22:08:27,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49489795918367346 [2024-06-27 22:08:27,383 INFO L175 Difference]: Start difference. First operand has 233 places, 588 transitions, 11453 flow. Second operand 8 states and 194 transitions. [2024-06-27 22:08:27,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 630 transitions, 13167 flow [2024-06-27 22:08:28,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 630 transitions, 12969 flow, removed 31 selfloop flow, removed 2 redundant places. [2024-06-27 22:08:28,407 INFO L231 Difference]: Finished difference. Result has 240 places, 608 transitions, 12048 flow [2024-06-27 22:08:28,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=11255, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12048, PETRI_PLACES=240, PETRI_TRANSITIONS=608} [2024-06-27 22:08:28,408 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 185 predicate places. [2024-06-27 22:08:28,408 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 608 transitions, 12048 flow [2024-06-27 22:08:28,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:28,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:28,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:28,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:08:28,409 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:08:28,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:28,409 INFO L85 PathProgramCache]: Analyzing trace with hash -514459489, now seen corresponding path program 2 times [2024-06-27 22:08:28,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:28,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602214387] [2024-06-27 22:08:28,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:28,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:29,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:29,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602214387] [2024-06-27 22:08:29,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602214387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:29,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:29,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:08:29,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586717936] [2024-06-27 22:08:29,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:29,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:08:29,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:29,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:08:29,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:08:29,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:08:29,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 608 transitions, 12048 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:29,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:29,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:08:29,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:32,422 INFO L124 PetriNetUnfolderBase]: 7859/13178 cut-off events. [2024-06-27 22:08:32,422 INFO L125 PetriNetUnfolderBase]: For 413912/413991 co-relation queries the response was YES. [2024-06-27 22:08:32,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92122 conditions, 13178 events. 7859/13178 cut-off events. For 413912/413991 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 95344 event pairs, 2426 based on Foata normal form. 63/12849 useless extension candidates. Maximal degree in co-relation 92016. Up to 10972 conditions per place. [2024-06-27 22:08:32,595 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 577 selfloop transitions, 36 changer transitions 0/635 dead transitions. [2024-06-27 22:08:32,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 635 transitions, 13468 flow [2024-06-27 22:08:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:08:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:08:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-06-27 22:08:32,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4719387755102041 [2024-06-27 22:08:32,596 INFO L175 Difference]: Start difference. First operand has 240 places, 608 transitions, 12048 flow. Second operand 8 states and 185 transitions. [2024-06-27 22:08:32,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 635 transitions, 13468 flow [2024-06-27 22:08:33,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 635 transitions, 13316 flow, removed 52 selfloop flow, removed 3 redundant places. [2024-06-27 22:08:33,742 INFO L231 Difference]: Finished difference. Result has 245 places, 615 transitions, 12099 flow [2024-06-27 22:08:33,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=11896, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12099, PETRI_PLACES=245, PETRI_TRANSITIONS=615} [2024-06-27 22:08:33,743 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 190 predicate places. [2024-06-27 22:08:33,743 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 615 transitions, 12099 flow [2024-06-27 22:08:33,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:33,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:33,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:33,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:08:33,744 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:08:33,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 939875087, now seen corresponding path program 3 times [2024-06-27 22:08:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097378752] [2024-06-27 22:08:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:35,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:35,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097378752] [2024-06-27 22:08:35,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097378752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:35,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:35,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:08:35,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809342081] [2024-06-27 22:08:35,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:35,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:08:35,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:35,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:08:35,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:08:35,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:08:35,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 615 transitions, 12099 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:35,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:35,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:08:35,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:37,846 INFO L124 PetriNetUnfolderBase]: 7881/13013 cut-off events. [2024-06-27 22:08:37,846 INFO L125 PetriNetUnfolderBase]: For 427394/427479 co-relation queries the response was YES. [2024-06-27 22:08:37,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93399 conditions, 13013 events. 7881/13013 cut-off events. For 427394/427479 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 93113 event pairs, 2424 based on Foata normal form. 69/12735 useless extension candidates. Maximal degree in co-relation 93291. Up to 10940 conditions per place. [2024-06-27 22:08:38,027 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 567 selfloop transitions, 56 changer transitions 0/645 dead transitions. [2024-06-27 22:08:38,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 645 transitions, 13703 flow [2024-06-27 22:08:38,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:08:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:08:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-06-27 22:08:38,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2024-06-27 22:08:38,029 INFO L175 Difference]: Start difference. First operand has 245 places, 615 transitions, 12099 flow. Second operand 8 states and 186 transitions. [2024-06-27 22:08:38,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 645 transitions, 13703 flow [2024-06-27 22:08:39,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 645 transitions, 13570 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-27 22:08:39,396 INFO L231 Difference]: Finished difference. Result has 249 places, 623 transitions, 12249 flow [2024-06-27 22:08:39,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=11966, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12249, PETRI_PLACES=249, PETRI_TRANSITIONS=623} [2024-06-27 22:08:39,397 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 194 predicate places. [2024-06-27 22:08:39,397 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 623 transitions, 12249 flow [2024-06-27 22:08:39,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:39,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:39,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:39,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:08:39,398 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:08:39,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:39,399 INFO L85 PathProgramCache]: Analyzing trace with hash -775406198, now seen corresponding path program 6 times [2024-06-27 22:08:39,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:39,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872006541] [2024-06-27 22:08:39,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:39,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:40,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:40,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872006541] [2024-06-27 22:08:40,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872006541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:40,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:40,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:08:40,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437779559] [2024-06-27 22:08:40,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:40,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:08:40,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:40,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:08:40,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:08:40,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:08:40,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 623 transitions, 12249 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:40,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:40,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:08:40,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:43,107 INFO L124 PetriNetUnfolderBase]: 7892/13093 cut-off events. [2024-06-27 22:08:43,107 INFO L125 PetriNetUnfolderBase]: For 443551/443626 co-relation queries the response was YES. [2024-06-27 22:08:43,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94530 conditions, 13093 events. 7892/13093 cut-off events. For 443551/443626 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 94184 event pairs, 1838 based on Foata normal form. 59/12776 useless extension candidates. Maximal degree in co-relation 94420. Up to 10095 conditions per place. [2024-06-27 22:08:43,264 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 415 selfloop transitions, 215 changer transitions 0/652 dead transitions. [2024-06-27 22:08:43,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 652 transitions, 14001 flow [2024-06-27 22:08:43,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:08:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:08:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-27 22:08:43,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-27 22:08:43,266 INFO L175 Difference]: Start difference. First operand has 249 places, 623 transitions, 12249 flow. Second operand 8 states and 192 transitions. [2024-06-27 22:08:43,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 652 transitions, 14001 flow [2024-06-27 22:08:44,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 652 transitions, 13909 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-27 22:08:44,484 INFO L231 Difference]: Finished difference. Result has 254 places, 633 transitions, 12862 flow [2024-06-27 22:08:44,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12157, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12862, PETRI_PLACES=254, PETRI_TRANSITIONS=633} [2024-06-27 22:08:44,485 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 199 predicate places. [2024-06-27 22:08:44,485 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 633 transitions, 12862 flow [2024-06-27 22:08:44,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:44,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:44,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:44,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:08:44,486 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:08:44,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash -775405733, now seen corresponding path program 4 times [2024-06-27 22:08:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:44,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551457952] [2024-06-27 22:08:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:46,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:46,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551457952] [2024-06-27 22:08:46,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551457952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:46,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:46,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:08:46,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259878498] [2024-06-27 22:08:46,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:46,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:08:46,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:46,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:08:46,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:08:46,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:08:46,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 633 transitions, 12862 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:46,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:46,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:08:46,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:48,985 INFO L124 PetriNetUnfolderBase]: 7893/13340 cut-off events. [2024-06-27 22:08:48,985 INFO L125 PetriNetUnfolderBase]: For 473855/473940 co-relation queries the response was YES. [2024-06-27 22:08:49,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97829 conditions, 13340 events. 7893/13340 cut-off events. For 473855/473940 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 97544 event pairs, 2446 based on Foata normal form. 69/12996 useless extension candidates. Maximal degree in co-relation 97716. Up to 11003 conditions per place. [2024-06-27 22:08:49,166 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 590 selfloop transitions, 43 changer transitions 0/655 dead transitions. [2024-06-27 22:08:49,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 655 transitions, 14305 flow [2024-06-27 22:08:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:08:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:08:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2024-06-27 22:08:49,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46683673469387754 [2024-06-27 22:08:49,167 INFO L175 Difference]: Start difference. First operand has 254 places, 633 transitions, 12862 flow. Second operand 8 states and 183 transitions. [2024-06-27 22:08:49,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 655 transitions, 14305 flow [2024-06-27 22:08:50,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 655 transitions, 13660 flow, removed 119 selfloop flow, removed 7 redundant places. [2024-06-27 22:08:50,643 INFO L231 Difference]: Finished difference. Result has 255 places, 636 transitions, 12392 flow [2024-06-27 22:08:50,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12253, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12392, PETRI_PLACES=255, PETRI_TRANSITIONS=636} [2024-06-27 22:08:50,643 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 200 predicate places. [2024-06-27 22:08:50,643 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 636 transitions, 12392 flow [2024-06-27 22:08:50,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:50,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:50,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:50,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:08:50,644 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:08:50,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:50,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1012319141, now seen corresponding path program 1 times [2024-06-27 22:08:50,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:50,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017324898] [2024-06-27 22:08:50,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:50,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:51,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:51,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017324898] [2024-06-27 22:08:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017324898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:51,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:51,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:08:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217772246] [2024-06-27 22:08:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:51,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:08:51,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:51,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:08:51,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:08:52,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 22:08:52,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 636 transitions, 12392 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:52,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:52,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 22:08:52,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:08:54,457 INFO L124 PetriNetUnfolderBase]: 7577/12861 cut-off events. [2024-06-27 22:08:54,457 INFO L125 PetriNetUnfolderBase]: For 444725/444798 co-relation queries the response was YES. [2024-06-27 22:08:54,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91309 conditions, 12861 events. 7577/12861 cut-off events. For 444725/444798 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 95189 event pairs, 2469 based on Foata normal form. 62/12553 useless extension candidates. Maximal degree in co-relation 91197. Up to 10471 conditions per place. [2024-06-27 22:08:54,640 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 612 selfloop transitions, 21 changer transitions 0/662 dead transitions. [2024-06-27 22:08:54,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 662 transitions, 13818 flow [2024-06-27 22:08:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:08:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:08:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-06-27 22:08:54,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131195335276968 [2024-06-27 22:08:54,642 INFO L175 Difference]: Start difference. First operand has 255 places, 636 transitions, 12392 flow. Second operand 7 states and 176 transitions. [2024-06-27 22:08:54,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 662 transitions, 13818 flow [2024-06-27 22:08:56,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 662 transitions, 13728 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 22:08:56,323 INFO L231 Difference]: Finished difference. Result has 256 places, 639 transitions, 12398 flow [2024-06-27 22:08:56,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12302, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12398, PETRI_PLACES=256, PETRI_TRANSITIONS=639} [2024-06-27 22:08:56,324 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 201 predicate places. [2024-06-27 22:08:56,324 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 639 transitions, 12398 flow [2024-06-27 22:08:56,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:08:56,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:08:56,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:08:56,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:08:56,325 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:08:56,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:08:56,325 INFO L85 PathProgramCache]: Analyzing trace with hash -774894791, now seen corresponding path program 2 times [2024-06-27 22:08:56,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:08:56,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521777264] [2024-06-27 22:08:56,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:08:56,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:08:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:08:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:08:57,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:08:57,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521777264] [2024-06-27 22:08:57,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521777264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:08:57,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:08:57,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:08:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413047730] [2024-06-27 22:08:57,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:08:57,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:08:57,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:08:57,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:08:57,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:08:57,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:08:57,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 639 transitions, 12398 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:08:57,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:08:57,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:08:57,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:00,377 INFO L124 PetriNetUnfolderBase]: 7974/13243 cut-off events. [2024-06-27 22:09:00,377 INFO L125 PetriNetUnfolderBase]: For 454755/454828 co-relation queries the response was YES. [2024-06-27 22:09:00,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94629 conditions, 13243 events. 7974/13243 cut-off events. For 454755/454828 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 95871 event pairs, 2691 based on Foata normal form. 57/12931 useless extension candidates. Maximal degree in co-relation 94516. Up to 11108 conditions per place. [2024-06-27 22:09:00,551 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 613 selfloop transitions, 35 changer transitions 0/670 dead transitions. [2024-06-27 22:09:00,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 670 transitions, 14063 flow [2024-06-27 22:09:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:09:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:09:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-27 22:09:00,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49854227405247814 [2024-06-27 22:09:00,552 INFO L175 Difference]: Start difference. First operand has 256 places, 639 transitions, 12398 flow. Second operand 7 states and 171 transitions. [2024-06-27 22:09:00,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 670 transitions, 14063 flow [2024-06-27 22:09:01,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 670 transitions, 13982 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-27 22:09:01,748 INFO L231 Difference]: Finished difference. Result has 260 places, 648 transitions, 12571 flow [2024-06-27 22:09:01,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12341, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12571, PETRI_PLACES=260, PETRI_TRANSITIONS=648} [2024-06-27 22:09:01,749 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 205 predicate places. [2024-06-27 22:09:01,749 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 648 transitions, 12571 flow [2024-06-27 22:09:01,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 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-27 22:09:01,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:01,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:01,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:09:01,750 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:09:01,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:01,750 INFO L85 PathProgramCache]: Analyzing trace with hash -775221221, now seen corresponding path program 3 times [2024-06-27 22:09:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:01,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660669683] [2024-06-27 22:09:01,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:03,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-27 22:09:03,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660669683] [2024-06-27 22:09:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660669683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:03,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:03,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006807539] [2024-06-27 22:09:03,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:03,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:03,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:03,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:03,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:03,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 22:09:03,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 648 transitions, 12571 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:03,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:03,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 22:09:03,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:05,791 INFO L124 PetriNetUnfolderBase]: 7674/12977 cut-off events. [2024-06-27 22:09:05,791 INFO L125 PetriNetUnfolderBase]: For 469762/469835 co-relation queries the response was YES. [2024-06-27 22:09:05,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94122 conditions, 12977 events. 7674/12977 cut-off events. For 469762/469835 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 95825 event pairs, 2479 based on Foata normal form. 58/12661 useless extension candidates. Maximal degree in co-relation 94007. Up to 10597 conditions per place. [2024-06-27 22:09:05,963 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 608 selfloop transitions, 31 changer transitions 0/671 dead transitions. [2024-06-27 22:09:05,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 671 transitions, 14043 flow [2024-06-27 22:09:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:09:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:09:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-06-27 22:09:05,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47959183673469385 [2024-06-27 22:09:05,965 INFO L175 Difference]: Start difference. First operand has 260 places, 648 transitions, 12571 flow. Second operand 8 states and 188 transitions. [2024-06-27 22:09:05,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 671 transitions, 14043 flow [2024-06-27 22:09:07,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 671 transitions, 13938 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-06-27 22:09:07,358 INFO L231 Difference]: Finished difference. Result has 265 places, 654 transitions, 12665 flow [2024-06-27 22:09:07,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12486, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12665, PETRI_PLACES=265, PETRI_TRANSITIONS=654} [2024-06-27 22:09:07,359 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 210 predicate places. [2024-06-27 22:09:07,359 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 654 transitions, 12665 flow [2024-06-27 22:09:07,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:07,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:07,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:07,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:09:07,360 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:09:07,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:07,360 INFO L85 PathProgramCache]: Analyzing trace with hash -521057441, now seen corresponding path program 1 times [2024-06-27 22:09:07,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:07,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509344059] [2024-06-27 22:09:07,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:07,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:08,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:08,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509344059] [2024-06-27 22:09:08,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509344059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:08,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:08,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:09:08,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080642434] [2024-06-27 22:09:08,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:08,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:09:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:08,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:09:08,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:09:09,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:09:09,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 654 transitions, 12665 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:09,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:09,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:09:09,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:12,123 INFO L124 PetriNetUnfolderBase]: 9080/15083 cut-off events. [2024-06-27 22:09:12,123 INFO L125 PetriNetUnfolderBase]: For 523550/523552 co-relation queries the response was YES. [2024-06-27 22:09:12,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106717 conditions, 15083 events. 9080/15083 cut-off events. For 523550/523552 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 108649 event pairs, 2118 based on Foata normal form. 16/14691 useless extension candidates. Maximal degree in co-relation 106600. Up to 8909 conditions per place. [2024-06-27 22:09:12,325 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 434 selfloop transitions, 292 changer transitions 0/736 dead transitions. [2024-06-27 22:09:12,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 736 transitions, 14811 flow [2024-06-27 22:09:12,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:09:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:09:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 274 transitions. [2024-06-27 22:09:12,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2024-06-27 22:09:12,326 INFO L175 Difference]: Start difference. First operand has 265 places, 654 transitions, 12665 flow. Second operand 10 states and 274 transitions. [2024-06-27 22:09:12,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 736 transitions, 14811 flow [2024-06-27 22:09:13,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 736 transitions, 14684 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-27 22:09:13,926 INFO L231 Difference]: Finished difference. Result has 270 places, 659 transitions, 13206 flow [2024-06-27 22:09:13,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12538, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=288, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13206, PETRI_PLACES=270, PETRI_TRANSITIONS=659} [2024-06-27 22:09:13,927 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 215 predicate places. [2024-06-27 22:09:13,927 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 659 transitions, 13206 flow [2024-06-27 22:09:13,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:13,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:13,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:13,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:09:13,928 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:09:13,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1719243105, now seen corresponding path program 2 times [2024-06-27 22:09:13,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:13,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730038961] [2024-06-27 22:09:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:15,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:15,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730038961] [2024-06-27 22:09:15,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730038961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:15,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:15,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:09:15,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346777596] [2024-06-27 22:09:15,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:15,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:09:15,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:15,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:09:15,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:09:15,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:09:15,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 659 transitions, 13206 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:15,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:15,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:09:15,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:19,244 INFO L124 PetriNetUnfolderBase]: 9275/15221 cut-off events. [2024-06-27 22:09:19,245 INFO L125 PetriNetUnfolderBase]: For 558984/558986 co-relation queries the response was YES. [2024-06-27 22:09:19,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111389 conditions, 15221 events. 9275/15221 cut-off events. For 558984/558986 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 109258 event pairs, 2324 based on Foata normal form. 24/14871 useless extension candidates. Maximal degree in co-relation 111270. Up to 10731 conditions per place. [2024-06-27 22:09:19,460 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 411 selfloop transitions, 308 changer transitions 0/729 dead transitions. [2024-06-27 22:09:19,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 729 transitions, 15097 flow [2024-06-27 22:09:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:09:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:09:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 270 transitions. [2024-06-27 22:09:19,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-06-27 22:09:19,462 INFO L175 Difference]: Start difference. First operand has 270 places, 659 transitions, 13206 flow. Second operand 10 states and 270 transitions. [2024-06-27 22:09:19,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 729 transitions, 15097 flow [2024-06-27 22:09:21,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 729 transitions, 14771 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-27 22:09:21,382 INFO L231 Difference]: Finished difference. Result has 275 places, 661 transitions, 13558 flow [2024-06-27 22:09:21,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12880, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=306, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13558, PETRI_PLACES=275, PETRI_TRANSITIONS=661} [2024-06-27 22:09:21,383 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 220 predicate places. [2024-06-27 22:09:21,383 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 661 transitions, 13558 flow [2024-06-27 22:09:21,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:21,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:21,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:21,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:09:21,384 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:09:21,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1530308447, now seen corresponding path program 3 times [2024-06-27 22:09:21,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:21,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729660199] [2024-06-27 22:09:21,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:21,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:23,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:23,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729660199] [2024-06-27 22:09:23,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729660199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:23,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:23,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:09:23,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256804464] [2024-06-27 22:09:23,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:23,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:09:23,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:23,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:09:23,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:09:23,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:09:23,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 661 transitions, 13558 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:23,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:23,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:09:23,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:28,228 INFO L124 PetriNetUnfolderBase]: 9473/15545 cut-off events. [2024-06-27 22:09:28,228 INFO L125 PetriNetUnfolderBase]: For 572169/572171 co-relation queries the response was YES. [2024-06-27 22:09:28,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115575 conditions, 15545 events. 9473/15545 cut-off events. For 572169/572171 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 112018 event pairs, 2350 based on Foata normal form. 16/15187 useless extension candidates. Maximal degree in co-relation 115454. Up to 10787 conditions per place. [2024-06-27 22:09:28,423 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 420 selfloop transitions, 309 changer transitions 0/739 dead transitions. [2024-06-27 22:09:28,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 739 transitions, 15531 flow [2024-06-27 22:09:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:09:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:09:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 273 transitions. [2024-06-27 22:09:28,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-06-27 22:09:28,424 INFO L175 Difference]: Start difference. First operand has 275 places, 661 transitions, 13558 flow. Second operand 10 states and 273 transitions. [2024-06-27 22:09:28,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 739 transitions, 15531 flow [2024-06-27 22:09:30,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 739 transitions, 14893 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-27 22:09:30,345 INFO L231 Difference]: Finished difference. Result has 278 places, 666 transitions, 13643 flow [2024-06-27 22:09:30,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12920, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=304, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13643, PETRI_PLACES=278, PETRI_TRANSITIONS=666} [2024-06-27 22:09:30,346 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 223 predicate places. [2024-06-27 22:09:30,346 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 666 transitions, 13643 flow [2024-06-27 22:09:30,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:30,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:30,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:30,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:09:30,347 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:09:30,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:30,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1682605155, now seen corresponding path program 4 times [2024-06-27 22:09:30,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:30,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40046251] [2024-06-27 22:09:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:30,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:32,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:32,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40046251] [2024-06-27 22:09:32,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40046251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:32,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:32,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:09:32,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201674748] [2024-06-27 22:09:32,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:32,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:09:32,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:32,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:09:32,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:09:32,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:09:32,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 666 transitions, 13643 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:32,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:32,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:09:32,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:36,217 INFO L124 PetriNetUnfolderBase]: 9603/15805 cut-off events. [2024-06-27 22:09:36,218 INFO L125 PetriNetUnfolderBase]: For 589563/589565 co-relation queries the response was YES. [2024-06-27 22:09:36,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117064 conditions, 15805 events. 9603/15805 cut-off events. For 589563/589565 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 114689 event pairs, 2380 based on Foata normal form. 16/15435 useless extension candidates. Maximal degree in co-relation 116941. Up to 10667 conditions per place. [2024-06-27 22:09:36,580 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 420 selfloop transitions, 313 changer transitions 0/743 dead transitions. [2024-06-27 22:09:36,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 743 transitions, 15623 flow [2024-06-27 22:09:36,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:09:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:09:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 274 transitions. [2024-06-27 22:09:36,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2024-06-27 22:09:36,582 INFO L175 Difference]: Start difference. First operand has 278 places, 666 transitions, 13643 flow. Second operand 10 states and 274 transitions. [2024-06-27 22:09:36,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 743 transitions, 15623 flow [2024-06-27 22:09:38,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 743 transitions, 15010 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-27 22:09:38,220 INFO L231 Difference]: Finished difference. Result has 282 places, 670 transitions, 13759 flow [2024-06-27 22:09:38,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=13030, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13759, PETRI_PLACES=282, PETRI_TRANSITIONS=670} [2024-06-27 22:09:38,221 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 227 predicate places. [2024-06-27 22:09:38,222 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 670 transitions, 13759 flow [2024-06-27 22:09:38,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:38,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:38,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:38,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:09:38,222 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:09:38,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1104078851, now seen corresponding path program 5 times [2024-06-27 22:09:38,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:38,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499958622] [2024-06-27 22:09:38,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:38,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:39,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:39,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499958622] [2024-06-27 22:09:39,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499958622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:39,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:39,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973763101] [2024-06-27 22:09:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:39,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:39,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:39,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:39,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:39,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-27 22:09:39,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 670 transitions, 13759 flow. Second operand has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:39,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:39,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-27 22:09:39,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:43,842 INFO L124 PetriNetUnfolderBase]: 8616/15037 cut-off events. [2024-06-27 22:09:43,842 INFO L125 PetriNetUnfolderBase]: For 608005/608253 co-relation queries the response was YES. [2024-06-27 22:09:43,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111005 conditions, 15037 events. 8616/15037 cut-off events. For 608005/608253 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 116534 event pairs, 1317 based on Foata normal form. 129/14622 useless extension candidates. Maximal degree in co-relation 110880. Up to 6767 conditions per place. [2024-06-27 22:09:44,072 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 354 selfloop transitions, 234 changer transitions 0/747 dead transitions. [2024-06-27 22:09:44,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 747 transitions, 15810 flow [2024-06-27 22:09:44,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:09:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:09:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 262 transitions. [2024-06-27 22:09:44,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5941043083900227 [2024-06-27 22:09:44,074 INFO L175 Difference]: Start difference. First operand has 282 places, 670 transitions, 13759 flow. Second operand 9 states and 262 transitions. [2024-06-27 22:09:44,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 747 transitions, 15810 flow [2024-06-27 22:09:46,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 747 transitions, 15176 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-27 22:09:46,257 INFO L231 Difference]: Finished difference. Result has 288 places, 679 transitions, 13890 flow [2024-06-27 22:09:46,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=13125, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13890, PETRI_PLACES=288, PETRI_TRANSITIONS=679} [2024-06-27 22:09:46,258 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 233 predicate places. [2024-06-27 22:09:46,258 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 679 transitions, 13890 flow [2024-06-27 22:09:46,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:46,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:46,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:46,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 22:09:46,259 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:09:46,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash 479997647, now seen corresponding path program 1 times [2024-06-27 22:09:46,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:46,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873008128] [2024-06-27 22:09:46,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:47,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:47,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873008128] [2024-06-27 22:09:47,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873008128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:47,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:47,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:09:47,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734846191] [2024-06-27 22:09:47,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:47,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:09:47,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:47,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:09:47,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:09:47,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:09:47,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 679 transitions, 13890 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:47,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:47,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:09:47,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:09:51,953 INFO L124 PetriNetUnfolderBase]: 9218/15501 cut-off events. [2024-06-27 22:09:51,953 INFO L125 PetriNetUnfolderBase]: For 625420/625499 co-relation queries the response was YES. [2024-06-27 22:09:52,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117079 conditions, 15501 events. 9218/15501 cut-off events. For 625420/625499 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 116874 event pairs, 2556 based on Foata normal form. 75/15113 useless extension candidates. Maximal degree in co-relation 116950. Up to 12515 conditions per place. [2024-06-27 22:09:52,195 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 505 selfloop transitions, 190 changer transitions 0/720 dead transitions. [2024-06-27 22:09:52,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 720 transitions, 15558 flow [2024-06-27 22:09:52,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:09:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:09:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-06-27 22:09:52,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215419501133787 [2024-06-27 22:09:52,197 INFO L175 Difference]: Start difference. First operand has 288 places, 679 transitions, 13890 flow. Second operand 9 states and 230 transitions. [2024-06-27 22:09:52,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 720 transitions, 15558 flow [2024-06-27 22:09:54,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 720 transitions, 15280 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-27 22:09:54,242 INFO L231 Difference]: Finished difference. Result has 292 places, 683 transitions, 14098 flow [2024-06-27 22:09:54,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=13612, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14098, PETRI_PLACES=292, PETRI_TRANSITIONS=683} [2024-06-27 22:09:54,243 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 237 predicate places. [2024-06-27 22:09:54,243 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 683 transitions, 14098 flow [2024-06-27 22:09:54,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:54,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:09:54,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:09:54,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 22:09:54,244 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:09:54,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:09:54,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1922661219, now seen corresponding path program 6 times [2024-06-27 22:09:54,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:09:54,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390873217] [2024-06-27 22:09:54,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:09:54,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:09:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:09:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:09:55,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:09:55,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390873217] [2024-06-27 22:09:55,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390873217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:09:55,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:09:55,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:09:55,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775579670] [2024-06-27 22:09:55,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:09:55,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:09:55,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:09:55,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:09:55,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:09:56,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:09:56,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 683 transitions, 14098 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:09:56,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:09:56,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:09:56,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand