./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix001.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/mix001.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/mix001.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix001.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:00:36,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:00:36,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:00:36,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:00:36,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:00:36,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:00:36,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:00:36,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:00:36,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:00:36,803 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:00:36,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:00:36,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:00:36,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:00:36,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:00:36,806 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:00:36,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:00:36,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:00:36,807 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:00:36,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:00:36,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:00:36,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:00:36,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:00:36,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:00:36,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:00:36,808 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:00:36,808 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:00:36,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:00:36,809 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:00:36,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:00:36,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:00:36,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:00:36,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:00:36,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:00:36,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:00:36,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:00:36,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:00:36,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:00:36,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:00:36,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:00:36,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:00:36,817 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:00:36,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:00:36,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:00:36,818 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:00:37,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:00:37,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:00:37,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:00:37,102 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:00:37,102 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:00:37,103 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/mix001.opt.yml/witness.yml [2024-06-27 22:00:37,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:00:37,179 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:00:37,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.opt.i [2024-06-27 22:00:38,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:00:38,559 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:00:38,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.opt.i [2024-06-27 22:00:38,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a8293d44/e746795a219e4db1a14cea4c0771cd5e/FLAG1aa9e9bb7 [2024-06-27 22:00:38,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a8293d44/e746795a219e4db1a14cea4c0771cd5e [2024-06-27 22:00:38,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:00:38,591 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:00:38,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:00:38,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:00:38,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:00:38,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:00:37" (1/2) ... [2024-06-27 22:00:38,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c103eef and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:00:38, skipping insertion in model container [2024-06-27 22:00:38,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:00:37" (1/2) ... [2024-06-27 22:00:38,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1e7325f1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:00:38, skipping insertion in model container [2024-06-27 22:00:38,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:00:38" (2/2) ... [2024-06-27 22:00:38,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c103eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:38, skipping insertion in model container [2024-06-27 22:00:38,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:00:38" (2/2) ... [2024-06-27 22:00:38,601 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:00:38,634 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:00:38,635 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$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_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:00:38,635 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$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_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:00:38,635 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$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_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:00:38,635 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:00:38,635 INFO L106 edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1; [2024-06-27 22:00:38,670 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:00:38,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/mix001.opt.i[944,957] [2024-06-27 22:00:38,987 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:00:39,002 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:00:39,032 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/mix001.opt.i[944,957] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:00:39,123 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:00:39,183 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:00:39,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39 WrapperNode [2024-06-27 22:00:39,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:00:39,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:00:39,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:00:39,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:00:39,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (1/1) ... [2024-06-27 22:00:39,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (1/1) ... [2024-06-27 22:00:39,310 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2024-06-27 22:00:39,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:00:39,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:00:39,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:00:39,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:00:39,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (1/1) ... [2024-06-27 22:00:39,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (1/1) ... [2024-06-27 22:00:39,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (1/1) ... [2024-06-27 22:00:39,344 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:00:39,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (1/1) ... [2024-06-27 22:00:39,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (1/1) ... [2024-06-27 22:00:39,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (1/1) ... [2024-06-27 22:00:39,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (1/1) ... [2024-06-27 22:00:39,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (1/1) ... [2024-06-27 22:00:39,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (1/1) ... [2024-06-27 22:00:39,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:00:39,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:00:39,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:00:39,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:00:39,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (1/1) ... [2024-06-27 22:00:39,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:00:39,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:00:39,384 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:00:39,395 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:00:39,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:00:39,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:00:39,412 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:00:39,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:00:39,412 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:00:39,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:00:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:00:39,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:00:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:00:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:00:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:00:39,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:00:39,414 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:00:39,504 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:00:39,506 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:00:39,906 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:00:39,907 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:00:40,051 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:00:40,051 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:00:40,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:00:40 BoogieIcfgContainer [2024-06-27 22:00:40,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:00:40,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:00:40,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:00:40,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:00:40,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:00:37" (1/4) ... [2024-06-27 22:00:40,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41435c63 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:00:40, skipping insertion in model container [2024-06-27 22:00:40,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:00:38" (2/4) ... [2024-06-27 22:00:40,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41435c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:00:40, skipping insertion in model container [2024-06-27 22:00:40,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:00:39" (3/4) ... [2024-06-27 22:00:40,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41435c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:00:40, skipping insertion in model container [2024-06-27 22:00:40,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:00:40" (4/4) ... [2024-06-27 22:00:40,062 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.opt.i [2024-06-27 22:00:40,076 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:00:40,076 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:00:40,077 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:00:40,119 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:00:40,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 110 flow [2024-06-27 22:00:40,178 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-06-27 22:00:40,179 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:00:40,182 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 6. Compared 87 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:00:40,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 49 transitions, 110 flow [2024-06-27 22:00:40,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 46 transitions, 101 flow [2024-06-27 22:00:40,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:00:40,202 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;@7af61fce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:00:40,202 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:00:40,206 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:00:40,207 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:00:40,207 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:00:40,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:40,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:00:40,208 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:00:40,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash 365488671, now seen corresponding path program 1 times [2024-06-27 22:00:40,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:40,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877335149] [2024-06-27 22:00:40,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:40,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:41,305 INFO 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:00:41,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:41,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877335149] [2024-06-27 22:00:41,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877335149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:00:41,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:00:41,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:00:41,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373722941] [2024-06-27 22:00:41,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:00:41,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:00:41,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:00:41,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:00:41,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-06-27 22:00:41,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:00:41,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:41,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-06-27 22:00:41,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:41,928 INFO L124 PetriNetUnfolderBase]: 2330/3973 cut-off events. [2024-06-27 22:00:41,929 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-06-27 22:00:41,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7425 conditions, 3973 events. 2330/3973 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 26420 event pairs, 1832 based on Foata normal form. 120/3759 useless extension candidates. Maximal degree in co-relation 7413. Up to 3385 conditions per place. [2024-06-27 22:00:41,953 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 39 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-06-27 22:00:41,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 59 transitions, 219 flow [2024-06-27 22:00:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:00:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:00:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-06-27 22:00:41,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7210884353741497 [2024-06-27 22:00:41,966 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 101 flow. Second operand 3 states and 106 transitions. [2024-06-27 22:00:41,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 59 transitions, 219 flow [2024-06-27 22:00:41,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:00:41,974 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 128 flow [2024-06-27 22:00:41,975 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=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-06-27 22:00:41,978 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2024-06-27 22:00:41,978 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 128 flow [2024-06-27 22:00:41,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:00:41,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:41,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:41,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:00:41,979 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:00:41,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash -951392060, now seen corresponding path program 1 times [2024-06-27 22:00:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:41,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483788118] [2024-06-27 22:00:41,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:41,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:00:42,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:42,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483788118] [2024-06-27 22:00:42,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483788118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:00:42,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:00:42,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:00:42,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347831340] [2024-06-27 22:00:42,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:00:42,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:00:42,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:42,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:00:42,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:00:43,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-06-27 22:00:43,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:00:43,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:43,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-06-27 22:00:43,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:43,538 INFO L124 PetriNetUnfolderBase]: 3390/5641 cut-off events. [2024-06-27 22:00:43,538 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2024-06-27 22:00:43,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11758 conditions, 5641 events. 3390/5641 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 37610 event pairs, 2437 based on Foata normal form. 3/5271 useless extension candidates. Maximal degree in co-relation 11746. Up to 4856 conditions per place. [2024-06-27 22:00:43,565 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 52 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2024-06-27 22:00:43,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 308 flow [2024-06-27 22:00:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:00:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:00:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-06-27 22:00:43,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6683673469387755 [2024-06-27 22:00:43,570 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 128 flow. Second operand 4 states and 131 transitions. [2024-06-27 22:00:43,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 308 flow [2024-06-27 22:00:43,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:00:43,573 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 166 flow [2024-06-27 22:00:43,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-27 22:00:43,574 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2024-06-27 22:00:43,575 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 166 flow [2024-06-27 22:00:43,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:00:43,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:43,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:43,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:00:43,578 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:00:43,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash 571617774, now seen corresponding path program 1 times [2024-06-27 22:00:43,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:43,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961070008] [2024-06-27 22:00:43,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:43,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:44,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:00:44,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961070008] [2024-06-27 22:00:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961070008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:00:44,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:00:44,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:00:44,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281670662] [2024-06-27 22:00:44,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:00:44,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:00:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:44,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:00:44,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:00:44,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-06-27 22:00:44,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:00:44,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:44,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-06-27 22:00:44,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:45,235 INFO L124 PetriNetUnfolderBase]: 3364/5055 cut-off events. [2024-06-27 22:00:45,235 INFO L125 PetriNetUnfolderBase]: For 1994/1994 co-relation queries the response was YES. [2024-06-27 22:00:45,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12240 conditions, 5055 events. 3364/5055 cut-off events. For 1994/1994 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 30177 event pairs, 1328 based on Foata normal form. 3/4897 useless extension candidates. Maximal degree in co-relation 12226. Up to 4797 conditions per place. [2024-06-27 22:00:45,258 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 63 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2024-06-27 22:00:45,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 404 flow [2024-06-27 22:00:45,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:00:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:00:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-06-27 22:00:45,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6612244897959184 [2024-06-27 22:00:45,260 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 166 flow. Second operand 5 states and 162 transitions. [2024-06-27 22:00:45,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 404 flow [2024-06-27 22:00:45,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 390 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 22:00:45,262 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 204 flow [2024-06-27 22:00:45,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2024-06-27 22:00:45,263 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2024-06-27 22:00:45,263 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 204 flow [2024-06-27 22:00:45,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:00:45,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:45,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:45,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:00:45,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:00:45,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:45,265 INFO L85 PathProgramCache]: Analyzing trace with hash -491834762, now seen corresponding path program 1 times [2024-06-27 22:00:45,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:45,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363346553] [2024-06-27 22:00:45,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:45,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:46,224 INFO 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:00:46,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:46,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363346553] [2024-06-27 22:00:46,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363346553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:00:46,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:00:46,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:00:46,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558885834] [2024-06-27 22:00:46,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:00:46,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:00:46,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:46,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:00:46,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:00:46,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 22:00:46,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 204 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:00:46,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:46,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 22:00:46,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:47,225 INFO L124 PetriNetUnfolderBase]: 4658/7758 cut-off events. [2024-06-27 22:00:47,226 INFO L125 PetriNetUnfolderBase]: For 5180/5199 co-relation queries the response was YES. [2024-06-27 22:00:47,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18777 conditions, 7758 events. 4658/7758 cut-off events. For 5180/5199 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 53477 event pairs, 3467 based on Foata normal form. 22/7249 useless extension candidates. Maximal degree in co-relation 18761. Up to 6701 conditions per place. [2024-06-27 22:00:47,256 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 62 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2024-06-27 22:00:47,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 450 flow [2024-06-27 22:00:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:00:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:00:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2024-06-27 22:00:47,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5544217687074829 [2024-06-27 22:00:47,258 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 204 flow. Second operand 6 states and 163 transitions. [2024-06-27 22:00:47,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 450 flow [2024-06-27 22:00:47,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 88 transitions, 424 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 22:00:47,261 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 271 flow [2024-06-27 22:00:47,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2024-06-27 22:00:47,262 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places. [2024-06-27 22:00:47,262 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 271 flow [2024-06-27 22:00:47,262 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:00:47,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:47,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:47,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:00:47,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:00:47,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:47,263 INFO L85 PathProgramCache]: Analyzing trace with hash -479633534, now seen corresponding path program 1 times [2024-06-27 22:00:47,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:47,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478864742] [2024-06-27 22:00:47,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:47,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:48,710 INFO 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:00:48,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:48,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478864742] [2024-06-27 22:00:48,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478864742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:00:48,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:00:48,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:00:48,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932396203] [2024-06-27 22:00:48,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:00:48,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:00:48,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:48,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:00:48,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:00:48,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-27 22:00:48,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 271 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:00:48,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:48,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-27 22:00:48,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:49,547 INFO L124 PetriNetUnfolderBase]: 4812/7672 cut-off events. [2024-06-27 22:00:49,548 INFO L125 PetriNetUnfolderBase]: For 8548/8556 co-relation queries the response was YES. [2024-06-27 22:00:49,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20124 conditions, 7672 events. 4812/7672 cut-off events. For 8548/8556 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 50173 event pairs, 2123 based on Foata normal form. 14/7291 useless extension candidates. Maximal degree in co-relation 20104. Up to 6757 conditions per place. [2024-06-27 22:00:49,583 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 87 selfloop transitions, 16 changer transitions 0/118 dead transitions. [2024-06-27 22:00:49,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 118 transitions, 625 flow [2024-06-27 22:00:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:00:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:00:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2024-06-27 22:00:49,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6239067055393586 [2024-06-27 22:00:49,585 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 271 flow. Second operand 7 states and 214 transitions. [2024-06-27 22:00:49,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 118 transitions, 625 flow [2024-06-27 22:00:49,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 118 transitions, 610 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-27 22:00:49,598 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 327 flow [2024-06-27 22:00:49,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=327, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2024-06-27 22:00:49,601 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2024-06-27 22:00:49,601 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 327 flow [2024-06-27 22:00:49,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:00:49,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:49,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:49,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:00:49,601 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:00:49,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:49,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1932993511, now seen corresponding path program 1 times [2024-06-27 22:00:49,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:49,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849814343] [2024-06-27 22:00:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:50,742 INFO 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:00:50,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:50,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849814343] [2024-06-27 22:00:50,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849814343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:00:50,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:00:50,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:00:50,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208922733] [2024-06-27 22:00:50,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:00:50,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:00:50,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:50,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:00:50,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:00:50,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 22:00:50,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:00:50,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:50,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 22:00:50,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:51,862 INFO L124 PetriNetUnfolderBase]: 4589/7672 cut-off events. [2024-06-27 22:00:51,862 INFO L125 PetriNetUnfolderBase]: For 12668/12698 co-relation queries the response was YES. [2024-06-27 22:00:51,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21496 conditions, 7672 events. 4589/7672 cut-off events. For 12668/12698 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 52871 event pairs, 2896 based on Foata normal form. 36/7216 useless extension candidates. Maximal degree in co-relation 21472. Up to 6532 conditions per place. [2024-06-27 22:00:51,899 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 78 selfloop transitions, 18 changer transitions 0/109 dead transitions. [2024-06-27 22:00:51,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 109 transitions, 641 flow [2024-06-27 22:00:51,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:00:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:00:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions. [2024-06-27 22:00:51,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5626822157434402 [2024-06-27 22:00:51,900 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 327 flow. Second operand 7 states and 193 transitions. [2024-06-27 22:00:51,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 109 transitions, 641 flow [2024-06-27 22:00:51,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 109 transitions, 600 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 22:00:51,908 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 388 flow [2024-06-27 22:00:51,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2024-06-27 22:00:51,909 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 21 predicate places. [2024-06-27 22:00:51,909 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 388 flow [2024-06-27 22:00:51,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:00:51,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:51,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:51,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:00:51,909 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:00:51,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:51,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2108320749, now seen corresponding path program 1 times [2024-06-27 22:00:51,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:51,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148212954] [2024-06-27 22:00:51,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:52,782 INFO 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:00:52,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:52,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148212954] [2024-06-27 22:00:52,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148212954] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:00:52,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:00:52,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:00:52,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304046182] [2024-06-27 22:00:52,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:00:52,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:00:52,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:52,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:00:52,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:00:52,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:00:52,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 388 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:00:52,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:52,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:00:52,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:53,958 INFO L124 PetriNetUnfolderBase]: 5749/9154 cut-off events. [2024-06-27 22:00:53,958 INFO L125 PetriNetUnfolderBase]: For 21080/21089 co-relation queries the response was YES. [2024-06-27 22:00:53,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27552 conditions, 9154 events. 5749/9154 cut-off events. For 21080/21089 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 59779 event pairs, 3221 based on Foata normal form. 9/8691 useless extension candidates. Maximal degree in co-relation 27524. Up to 8039 conditions per place. [2024-06-27 22:00:54,023 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 99 selfloop transitions, 31 changer transitions 0/140 dead transitions. [2024-06-27 22:00:54,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 140 transitions, 941 flow [2024-06-27 22:00:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:00:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:00:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 214 transitions. [2024-06-27 22:00:54,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459183673469388 [2024-06-27 22:00:54,025 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 388 flow. Second operand 8 states and 214 transitions. [2024-06-27 22:00:54,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 140 transitions, 941 flow [2024-06-27 22:00:54,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 140 transitions, 898 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-27 22:00:54,047 INFO L231 Difference]: Finished difference. Result has 83 places, 92 transitions, 603 flow [2024-06-27 22:00:54,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=603, PETRI_PLACES=83, PETRI_TRANSITIONS=92} [2024-06-27 22:00:54,049 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 28 predicate places. [2024-06-27 22:00:54,049 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 92 transitions, 603 flow [2024-06-27 22:00:54,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:00:54,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:54,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:54,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:00:54,049 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:00:54,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:54,050 INFO L85 PathProgramCache]: Analyzing trace with hash 402536459, now seen corresponding path program 2 times [2024-06-27 22:00:54,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:54,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859960154] [2024-06-27 22:00:54,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:54,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:55,075 INFO 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:00:55,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:55,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859960154] [2024-06-27 22:00:55,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859960154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:00:55,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:00:55,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:00:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427605360] [2024-06-27 22:00:55,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:00:55,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:00:55,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:55,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:00:55,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:00:55,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:00:55,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 92 transitions, 603 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:00:55,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:55,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:00:55,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:56,372 INFO L124 PetriNetUnfolderBase]: 5861/9170 cut-off events. [2024-06-27 22:00:56,372 INFO L125 PetriNetUnfolderBase]: For 27763/27772 co-relation queries the response was YES. [2024-06-27 22:00:56,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30354 conditions, 9170 events. 5861/9170 cut-off events. For 27763/27772 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 58257 event pairs, 3067 based on Foata normal form. 10/8753 useless extension candidates. Maximal degree in co-relation 30322. Up to 8092 conditions per place. [2024-06-27 22:00:56,419 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 90 selfloop transitions, 48 changer transitions 0/148 dead transitions. [2024-06-27 22:00:56,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 148 transitions, 1208 flow [2024-06-27 22:00:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:00:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:00:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-06-27 22:00:56,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5451895043731778 [2024-06-27 22:00:56,421 INFO L175 Difference]: Start difference. First operand has 83 places, 92 transitions, 603 flow. Second operand 7 states and 187 transitions. [2024-06-27 22:00:56,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 148 transitions, 1208 flow [2024-06-27 22:00:56,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 148 transitions, 1128 flow, removed 35 selfloop flow, removed 2 redundant places. [2024-06-27 22:00:56,451 INFO L231 Difference]: Finished difference. Result has 90 places, 110 transitions, 868 flow [2024-06-27 22:00:56,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=868, PETRI_PLACES=90, PETRI_TRANSITIONS=110} [2024-06-27 22:00:56,453 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 35 predicate places. [2024-06-27 22:00:56,453 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 110 transitions, 868 flow [2024-06-27 22:00:56,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:00:56,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:56,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:56,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:00:56,453 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:00:56,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:56,454 INFO L85 PathProgramCache]: Analyzing trace with hash 423761849, now seen corresponding path program 3 times [2024-06-27 22:00:56,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:56,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089718116] [2024-06-27 22:00:56,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:56,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:57,539 INFO 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:00:57,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:57,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089718116] [2024-06-27 22:00:57,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089718116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:00:57,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:00:57,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:00:57,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295697378] [2024-06-27 22:00:57,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:00:57,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:00:57,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:57,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:00:57,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:00:57,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:00:57,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 110 transitions, 868 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:00:57,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:57,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:00:57,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:58,811 INFO L124 PetriNetUnfolderBase]: 5849/9146 cut-off events. [2024-06-27 22:00:58,811 INFO L125 PetriNetUnfolderBase]: For 35662/35662 co-relation queries the response was YES. [2024-06-27 22:00:58,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31882 conditions, 9146 events. 5849/9146 cut-off events. For 35662/35662 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 58011 event pairs, 3057 based on Foata normal form. 3/8740 useless extension candidates. Maximal degree in co-relation 31845. Up to 8080 conditions per place. [2024-06-27 22:00:58,852 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 89 selfloop transitions, 49 changer transitions 0/148 dead transitions. [2024-06-27 22:00:58,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 148 transitions, 1256 flow [2024-06-27 22:00:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:00:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:00:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-27 22:00:58,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276967930029155 [2024-06-27 22:00:58,854 INFO L175 Difference]: Start difference. First operand has 90 places, 110 transitions, 868 flow. Second operand 7 states and 181 transitions. [2024-06-27 22:00:58,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 148 transitions, 1256 flow [2024-06-27 22:00:58,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 148 transitions, 1120 flow, removed 48 selfloop flow, removed 2 redundant places. [2024-06-27 22:00:58,891 INFO L231 Difference]: Finished difference. Result has 95 places, 110 transitions, 845 flow [2024-06-27 22:00:58,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=845, PETRI_PLACES=95, PETRI_TRANSITIONS=110} [2024-06-27 22:00:58,892 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 40 predicate places. [2024-06-27 22:00:58,892 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 110 transitions, 845 flow [2024-06-27 22:00:58,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:00:58,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:58,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:58,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:00:58,893 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:00:58,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1623894203, now seen corresponding path program 1 times [2024-06-27 22:00:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850164324] [2024-06-27 22:00:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:59,741 INFO 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:00:59,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:59,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850164324] [2024-06-27 22:00:59,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850164324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:00:59,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:00:59,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:00:59,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950849962] [2024-06-27 22:00:59,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:00:59,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:00:59,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:59,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:00:59,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:00:59,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:00:59,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 110 transitions, 845 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:00:59,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:59,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:00:59,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:01,043 INFO L124 PetriNetUnfolderBase]: 5956/9297 cut-off events. [2024-06-27 22:01:01,043 INFO L125 PetriNetUnfolderBase]: For 35361/35374 co-relation queries the response was YES. [2024-06-27 22:01:01,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32422 conditions, 9297 events. 5956/9297 cut-off events. For 35361/35374 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 58806 event pairs, 2956 based on Foata normal form. 13/8888 useless extension candidates. Maximal degree in co-relation 32382. Up to 8122 conditions per place. [2024-06-27 22:01:01,098 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 117 selfloop transitions, 62 changer transitions 0/189 dead transitions. [2024-06-27 22:01:01,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 189 transitions, 1592 flow [2024-06-27 22:01:01,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:01:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:01:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 244 transitions. [2024-06-27 22:01:01,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5532879818594104 [2024-06-27 22:01:01,101 INFO L175 Difference]: Start difference. First operand has 95 places, 110 transitions, 845 flow. Second operand 9 states and 244 transitions. [2024-06-27 22:01:01,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 189 transitions, 1592 flow [2024-06-27 22:01:01,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 189 transitions, 1530 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 22:01:01,147 INFO L231 Difference]: Finished difference. Result has 104 places, 130 transitions, 1140 flow [2024-06-27 22:01:01,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1140, PETRI_PLACES=104, PETRI_TRANSITIONS=130} [2024-06-27 22:01:01,148 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 49 predicate places. [2024-06-27 22:01:01,148 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 130 transitions, 1140 flow [2024-06-27 22:01:01,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:01,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:01,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:01,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:01:01,149 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:01:01,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash -953906927, now seen corresponding path program 2 times [2024-06-27 22:01:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492100632] [2024-06-27 22:01:01,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:01,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:02,195 INFO 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:01:02,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:02,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492100632] [2024-06-27 22:01:02,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492100632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:02,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:02,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:01:02,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171714019] [2024-06-27 22:01:02,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:02,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:01:02,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:02,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:01:02,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:01:02,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:02,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 130 transitions, 1140 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:02,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:02,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:02,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:03,771 INFO L124 PetriNetUnfolderBase]: 6182/9764 cut-off events. [2024-06-27 22:01:03,771 INFO L125 PetriNetUnfolderBase]: For 51003/51016 co-relation queries the response was YES. [2024-06-27 22:01:03,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36888 conditions, 9764 events. 6182/9764 cut-off events. For 51003/51016 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 62912 event pairs, 3047 based on Foata normal form. 14/9308 useless extension candidates. Maximal degree in co-relation 36843. Up to 8261 conditions per place. [2024-06-27 22:01:03,925 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 121 selfloop transitions, 89 changer transitions 0/220 dead transitions. [2024-06-27 22:01:03,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 220 transitions, 2219 flow [2024-06-27 22:01:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:01:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:01:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 247 transitions. [2024-06-27 22:01:03,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5600907029478458 [2024-06-27 22:01:03,933 INFO L175 Difference]: Start difference. First operand has 104 places, 130 transitions, 1140 flow. Second operand 9 states and 247 transitions. [2024-06-27 22:01:03,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 220 transitions, 2219 flow [2024-06-27 22:01:04,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 220 transitions, 2027 flow, removed 74 selfloop flow, removed 3 redundant places. [2024-06-27 22:01:04,015 INFO L231 Difference]: Finished difference. Result has 113 places, 160 transitions, 1583 flow [2024-06-27 22:01:04,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1583, PETRI_PLACES=113, PETRI_TRANSITIONS=160} [2024-06-27 22:01:04,016 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 58 predicate places. [2024-06-27 22:01:04,016 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 160 transitions, 1583 flow [2024-06-27 22:01:04,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:04,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:04,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:04,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:01:04,017 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:01:04,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:04,018 INFO L85 PathProgramCache]: Analyzing trace with hash -933431830, now seen corresponding path program 1 times [2024-06-27 22:01:04,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:04,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832654594] [2024-06-27 22:01:04,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:04,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:05,027 INFO 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:01:05,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:05,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832654594] [2024-06-27 22:01:05,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832654594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:05,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:05,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:01:05,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466843024] [2024-06-27 22:01:05,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:05,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:01:05,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:05,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:01:05,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:01:05,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:05,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 160 transitions, 1583 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:05,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:05,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:05,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:06,564 INFO L124 PetriNetUnfolderBase]: 6342/10031 cut-off events. [2024-06-27 22:01:06,565 INFO L125 PetriNetUnfolderBase]: For 63037/63052 co-relation queries the response was YES. [2024-06-27 22:01:06,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39560 conditions, 10031 events. 6342/10031 cut-off events. For 63037/63052 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 64900 event pairs, 2991 based on Foata normal form. 13/9554 useless extension candidates. Maximal degree in co-relation 39510. Up to 8523 conditions per place. [2024-06-27 22:01:06,622 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 167 selfloop transitions, 61 changer transitions 0/238 dead transitions. [2024-06-27 22:01:06,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 238 transitions, 2465 flow [2024-06-27 22:01:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:01:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:01:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 249 transitions. [2024-06-27 22:01:06,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.564625850340136 [2024-06-27 22:01:06,624 INFO L175 Difference]: Start difference. First operand has 113 places, 160 transitions, 1583 flow. Second operand 9 states and 249 transitions. [2024-06-27 22:01:06,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 238 transitions, 2465 flow [2024-06-27 22:01:06,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 238 transitions, 2324 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-06-27 22:01:06,697 INFO L231 Difference]: Finished difference. Result has 120 places, 176 transitions, 1791 flow [2024-06-27 22:01:06,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1791, PETRI_PLACES=120, PETRI_TRANSITIONS=176} [2024-06-27 22:01:06,698 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 65 predicate places. [2024-06-27 22:01:06,698 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 176 transitions, 1791 flow [2024-06-27 22:01:06,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:06,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:06,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:06,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:01:06,699 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:01:06,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:06,699 INFO L85 PathProgramCache]: Analyzing trace with hash -934095137, now seen corresponding path program 3 times [2024-06-27 22:01:06,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:06,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979712864] [2024-06-27 22:01:06,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:06,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:07,687 INFO 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:01:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:07,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979712864] [2024-06-27 22:01:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979712864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:07,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:07,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:01:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935758184] [2024-06-27 22:01:07,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:07,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:01:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:01:07,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:01:07,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:07,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 176 transitions, 1791 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:07,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:07,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:07,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:09,225 INFO L124 PetriNetUnfolderBase]: 6384/10052 cut-off events. [2024-06-27 22:01:09,225 INFO L125 PetriNetUnfolderBase]: For 73089/73095 co-relation queries the response was YES. [2024-06-27 22:01:09,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41700 conditions, 10052 events. 6384/10052 cut-off events. For 73089/73095 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 64680 event pairs, 2991 based on Foata normal form. 7/9601 useless extension candidates. Maximal degree in co-relation 41648. Up to 8508 conditions per place. [2024-06-27 22:01:09,289 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 138 selfloop transitions, 96 changer transitions 0/244 dead transitions. [2024-06-27 22:01:09,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 244 transitions, 2671 flow [2024-06-27 22:01:09,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:01:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:01:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 243 transitions. [2024-06-27 22:01:09,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-06-27 22:01:09,291 INFO L175 Difference]: Start difference. First operand has 120 places, 176 transitions, 1791 flow. Second operand 9 states and 243 transitions. [2024-06-27 22:01:09,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 244 transitions, 2671 flow [2024-06-27 22:01:09,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 244 transitions, 2607 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-06-27 22:01:09,399 INFO L231 Difference]: Finished difference. Result has 127 places, 184 transitions, 2049 flow [2024-06-27 22:01:09,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1727, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2049, PETRI_PLACES=127, PETRI_TRANSITIONS=184} [2024-06-27 22:01:09,399 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 72 predicate places. [2024-06-27 22:01:09,399 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 184 transitions, 2049 flow [2024-06-27 22:01:09,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:09,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:09,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:09,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:01:09,400 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:01:09,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:09,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1973875373, now seen corresponding path program 4 times [2024-06-27 22:01:09,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:09,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735680915] [2024-06-27 22:01:09,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:09,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:10,568 INFO 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:01:10,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:10,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735680915] [2024-06-27 22:01:10,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735680915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:10,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:10,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:01:10,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288769129] [2024-06-27 22:01:10,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:10,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:01:10,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:10,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:01:10,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:01:10,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:10,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 184 transitions, 2049 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:10,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:10,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:10,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:12,445 INFO L124 PetriNetUnfolderBase]: 6714/9729 cut-off events. [2024-06-27 22:01:12,446 INFO L125 PetriNetUnfolderBase]: For 80059/80068 co-relation queries the response was YES. [2024-06-27 22:01:12,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44486 conditions, 9729 events. 6714/9729 cut-off events. For 80059/80068 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 55642 event pairs, 1810 based on Foata normal form. 10/9478 useless extension candidates. Maximal degree in co-relation 44431. Up to 8715 conditions per place. [2024-06-27 22:01:12,518 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 144 selfloop transitions, 154 changer transitions 0/308 dead transitions. [2024-06-27 22:01:12,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 308 transitions, 3639 flow [2024-06-27 22:01:12,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:01:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:01:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 282 transitions. [2024-06-27 22:01:12,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5231910946196661 [2024-06-27 22:01:12,520 INFO L175 Difference]: Start difference. First operand has 127 places, 184 transitions, 2049 flow. Second operand 11 states and 282 transitions. [2024-06-27 22:01:12,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 308 transitions, 3639 flow [2024-06-27 22:01:12,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 308 transitions, 3303 flow, removed 56 selfloop flow, removed 6 redundant places. [2024-06-27 22:01:12,694 INFO L231 Difference]: Finished difference. Result has 136 places, 241 transitions, 2854 flow [2024-06-27 22:01:12,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2854, PETRI_PLACES=136, PETRI_TRANSITIONS=241} [2024-06-27 22:01:12,695 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 81 predicate places. [2024-06-27 22:01:12,695 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 241 transitions, 2854 flow [2024-06-27 22:01:12,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:12,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:12,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:12,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:01:12,696 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:01:12,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:12,696 INFO L85 PathProgramCache]: Analyzing trace with hash -519942476, now seen corresponding path program 2 times [2024-06-27 22:01:12,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:12,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849922936] [2024-06-27 22:01:12,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:13,891 INFO 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:01:13,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:13,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849922936] [2024-06-27 22:01:13,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849922936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:13,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:13,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:01:13,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372177414] [2024-06-27 22:01:13,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:13,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:01:13,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:13,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:01:13,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:01:13,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:13,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 241 transitions, 2854 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:13,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:13,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:13,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:15,762 INFO L124 PetriNetUnfolderBase]: 6894/10695 cut-off events. [2024-06-27 22:01:15,762 INFO L125 PetriNetUnfolderBase]: For 106780/106789 co-relation queries the response was YES. [2024-06-27 22:01:15,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48363 conditions, 10695 events. 6894/10695 cut-off events. For 106780/106789 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 67478 event pairs, 2891 based on Foata normal form. 10/10261 useless extension candidates. Maximal degree in co-relation 48303. Up to 8988 conditions per place. [2024-06-27 22:01:15,827 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 222 selfloop transitions, 75 changer transitions 0/307 dead transitions. [2024-06-27 22:01:15,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 307 transitions, 3850 flow [2024-06-27 22:01:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:01:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:01:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 220 transitions. [2024-06-27 22:01:15,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5612244897959183 [2024-06-27 22:01:15,828 INFO L175 Difference]: Start difference. First operand has 136 places, 241 transitions, 2854 flow. Second operand 8 states and 220 transitions. [2024-06-27 22:01:15,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 307 transitions, 3850 flow [2024-06-27 22:01:16,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 307 transitions, 3714 flow, removed 61 selfloop flow, removed 1 redundant places. [2024-06-27 22:01:16,021 INFO L231 Difference]: Finished difference. Result has 144 places, 255 transitions, 3067 flow [2024-06-27 22:01:16,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3067, PETRI_PLACES=144, PETRI_TRANSITIONS=255} [2024-06-27 22:01:16,022 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 89 predicate places. [2024-06-27 22:01:16,022 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 255 transitions, 3067 flow [2024-06-27 22:01:16,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:16,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:16,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:16,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:01:16,023 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:01:16,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:16,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1974025103, now seen corresponding path program 5 times [2024-06-27 22:01:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:16,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067792507] [2024-06-27 22:01:16,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:16,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:01:17,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:17,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067792507] [2024-06-27 22:01:17,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067792507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:17,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:17,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:01:17,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37486174] [2024-06-27 22:01:17,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:17,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:01:17,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:17,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:01:17,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:01:17,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:17,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 255 transitions, 3067 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:17,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:17,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:17,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:19,135 INFO L124 PetriNetUnfolderBase]: 7069/10236 cut-off events. [2024-06-27 22:01:19,136 INFO L125 PetriNetUnfolderBase]: For 121805/121814 co-relation queries the response was YES. [2024-06-27 22:01:19,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51278 conditions, 10236 events. 7069/10236 cut-off events. For 121805/121814 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 58624 event pairs, 1835 based on Foata normal form. 11/10011 useless extension candidates. Maximal degree in co-relation 51212. Up to 9098 conditions per place. [2024-06-27 22:01:19,226 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 165 selfloop transitions, 177 changer transitions 0/352 dead transitions. [2024-06-27 22:01:19,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 352 transitions, 4483 flow [2024-06-27 22:01:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:01:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:01:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 284 transitions. [2024-06-27 22:01:19,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269016697588126 [2024-06-27 22:01:19,228 INFO L175 Difference]: Start difference. First operand has 144 places, 255 transitions, 3067 flow. Second operand 11 states and 284 transitions. [2024-06-27 22:01:19,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 352 transitions, 4483 flow [2024-06-27 22:01:19,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 352 transitions, 4303 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-27 22:01:19,499 INFO L231 Difference]: Finished difference. Result has 149 places, 281 transitions, 3681 flow [2024-06-27 22:01:19,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2892, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3681, PETRI_PLACES=149, PETRI_TRANSITIONS=281} [2024-06-27 22:01:19,500 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 94 predicate places. [2024-06-27 22:01:19,500 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 281 transitions, 3681 flow [2024-06-27 22:01:19,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:19,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:19,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:19,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:01:19,501 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:01:19,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash -253417840, now seen corresponding path program 1 times [2024-06-27 22:01:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:19,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725370159] [2024-06-27 22:01:19,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:19,577 INFO 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:01:19,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:19,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725370159] [2024-06-27 22:01:19,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725370159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:19,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:19,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:01:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693451631] [2024-06-27 22:01:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:19,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:01:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:19,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:01:19,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:01:19,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 49 [2024-06-27 22:01:19,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 281 transitions, 3681 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:01:19,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:19,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 49 [2024-06-27 22:01:19,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:20,331 INFO L124 PetriNetUnfolderBase]: 2368/4817 cut-off events. [2024-06-27 22:01:20,331 INFO L125 PetriNetUnfolderBase]: For 55399/56610 co-relation queries the response was YES. [2024-06-27 22:01:20,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17592 conditions, 4817 events. 2368/4817 cut-off events. For 55399/56610 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 38763 event pairs, 640 based on Foata normal form. 367/4732 useless extension candidates. Maximal degree in co-relation 17549. Up to 2759 conditions per place. [2024-06-27 22:01:20,375 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 33 selfloop transitions, 51 changer transitions 0/211 dead transitions. [2024-06-27 22:01:20,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 211 transitions, 2711 flow [2024-06-27 22:01:20,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:01:20,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:01:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-06-27 22:01:20,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7482993197278912 [2024-06-27 22:01:20,377 INFO L175 Difference]: Start difference. First operand has 149 places, 281 transitions, 3681 flow. Second operand 3 states and 110 transitions. [2024-06-27 22:01:20,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 211 transitions, 2711 flow [2024-06-27 22:01:20,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 211 transitions, 2364 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-06-27 22:01:20,435 INFO L231 Difference]: Finished difference. Result has 128 places, 203 transitions, 2282 flow [2024-06-27 22:01:20,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2180, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2282, PETRI_PLACES=128, PETRI_TRANSITIONS=203} [2024-06-27 22:01:20,436 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 73 predicate places. [2024-06-27 22:01:20,436 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 203 transitions, 2282 flow [2024-06-27 22:01:20,436 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:01:20,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:20,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:20,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:01:20,437 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:01:20,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash 260027860, now seen corresponding path program 3 times [2024-06-27 22:01:20,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:20,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191106236] [2024-06-27 22:01:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:21,578 INFO 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:01:21,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:21,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191106236] [2024-06-27 22:01:21,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191106236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:21,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:21,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:01:21,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160735619] [2024-06-27 22:01:21,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:21,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:01:21,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:21,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:01:21,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:01:21,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:21,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 203 transitions, 2282 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:21,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:21,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:21,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:23,013 INFO L124 PetriNetUnfolderBase]: 6131/9583 cut-off events. [2024-06-27 22:01:23,013 INFO L125 PetriNetUnfolderBase]: For 96278/96287 co-relation queries the response was YES. [2024-06-27 22:01:23,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41143 conditions, 9583 events. 6131/9583 cut-off events. For 96278/96287 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 59621 event pairs, 2527 based on Foata normal form. 12/9394 useless extension candidates. Maximal degree in co-relation 41103. Up to 8214 conditions per place. [2024-06-27 22:01:23,084 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 176 selfloop transitions, 63 changer transitions 5/254 dead transitions. [2024-06-27 22:01:23,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 254 transitions, 3095 flow [2024-06-27 22:01:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:01:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:01:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2024-06-27 22:01:23,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5422740524781341 [2024-06-27 22:01:23,086 INFO L175 Difference]: Start difference. First operand has 128 places, 203 transitions, 2282 flow. Second operand 7 states and 186 transitions. [2024-06-27 22:01:23,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 254 transitions, 3095 flow [2024-06-27 22:01:23,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 254 transitions, 2989 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:01:23,231 INFO L231 Difference]: Finished difference. Result has 133 places, 208 transitions, 2394 flow [2024-06-27 22:01:23,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2180, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2394, PETRI_PLACES=133, PETRI_TRANSITIONS=208} [2024-06-27 22:01:23,233 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 78 predicate places. [2024-06-27 22:01:23,233 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 208 transitions, 2394 flow [2024-06-27 22:01:23,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:23,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:23,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:23,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:01:23,234 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:01:23,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:23,234 INFO L85 PathProgramCache]: Analyzing trace with hash -398918060, now seen corresponding path program 4 times [2024-06-27 22:01:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:23,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135498661] [2024-06-27 22:01:23,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:23,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:24,453 INFO 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:01:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:24,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135498661] [2024-06-27 22:01:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135498661] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:24,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:01:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814531227] [2024-06-27 22:01:24,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:24,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:01:24,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:01:24,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:01:24,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:24,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 208 transitions, 2394 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:24,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:24,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:24,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:25,847 INFO L124 PetriNetUnfolderBase]: 5335/8481 cut-off events. [2024-06-27 22:01:25,847 INFO L125 PetriNetUnfolderBase]: For 93725/93734 co-relation queries the response was YES. [2024-06-27 22:01:25,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37118 conditions, 8481 events. 5335/8481 cut-off events. For 93725/93734 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 53014 event pairs, 2207 based on Foata normal form. 12/8315 useless extension candidates. Maximal degree in co-relation 37077. Up to 7174 conditions per place. [2024-06-27 22:01:25,922 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 182 selfloop transitions, 59 changer transitions 0/251 dead transitions. [2024-06-27 22:01:25,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 251 transitions, 3072 flow [2024-06-27 22:01:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:01:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:01:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-27 22:01:25,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276967930029155 [2024-06-27 22:01:25,923 INFO L175 Difference]: Start difference. First operand has 133 places, 208 transitions, 2394 flow. Second operand 7 states and 181 transitions. [2024-06-27 22:01:25,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 251 transitions, 3072 flow [2024-06-27 22:01:26,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 251 transitions, 2899 flow, removed 54 selfloop flow, removed 3 redundant places. [2024-06-27 22:01:26,053 INFO L231 Difference]: Finished difference. Result has 136 places, 208 transitions, 2353 flow [2024-06-27 22:01:26,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2353, PETRI_PLACES=136, PETRI_TRANSITIONS=208} [2024-06-27 22:01:26,053 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 81 predicate places. [2024-06-27 22:01:26,054 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 208 transitions, 2353 flow [2024-06-27 22:01:26,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:26,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:26,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:26,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:01:26,054 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:01:26,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:26,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1807151929, now seen corresponding path program 6 times [2024-06-27 22:01:26,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:26,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406239778] [2024-06-27 22:01:26,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:26,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:01:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:27,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406239778] [2024-06-27 22:01:27,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406239778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:27,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:27,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:01:27,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801874345] [2024-06-27 22:01:27,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:27,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:01:27,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:27,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:01:27,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:01:27,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:27,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 208 transitions, 2353 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:27,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:27,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:27,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:28,463 INFO L124 PetriNetUnfolderBase]: 5324/7859 cut-off events. [2024-06-27 22:01:28,464 INFO L125 PetriNetUnfolderBase]: For 93943/93946 co-relation queries the response was YES. [2024-06-27 22:01:28,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36043 conditions, 7859 events. 5324/7859 cut-off events. For 93943/93946 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 44433 event pairs, 1421 based on Foata normal form. 6/7822 useless extension candidates. Maximal degree in co-relation 36001. Up to 7127 conditions per place. [2024-06-27 22:01:28,518 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 123 selfloop transitions, 118 changer transitions 0/251 dead transitions. [2024-06-27 22:01:28,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 251 transitions, 3061 flow [2024-06-27 22:01:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:01:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:01:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-06-27 22:01:28,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521865889212828 [2024-06-27 22:01:28,519 INFO L175 Difference]: Start difference. First operand has 136 places, 208 transitions, 2353 flow. Second operand 7 states and 179 transitions. [2024-06-27 22:01:28,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 251 transitions, 3061 flow [2024-06-27 22:01:28,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 251 transitions, 2948 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-27 22:01:28,605 INFO L231 Difference]: Finished difference. Result has 140 places, 208 transitions, 2494 flow [2024-06-27 22:01:28,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2494, PETRI_PLACES=140, PETRI_TRANSITIONS=208} [2024-06-27 22:01:28,605 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 85 predicate places. [2024-06-27 22:01:28,605 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 208 transitions, 2494 flow [2024-06-27 22:01:28,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:01:28,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:28,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:28,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:01:28,606 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:01:28,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash 794814180, now seen corresponding path program 1 times [2024-06-27 22:01:28,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:28,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897694701] [2024-06-27 22:01:28,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:28,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:29,523 INFO 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:01:29,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:29,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897694701] [2024-06-27 22:01:29,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897694701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:29,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:29,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:01:29,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051222802] [2024-06-27 22:01:29,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:29,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:01:29,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:29,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:01:29,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:01:29,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-06-27 22:01:29,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 208 transitions, 2494 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:01:29,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:29,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-06-27 22:01:29,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:29,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L773-->L789: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse5 (= (mod v_~y$r_buff0_thd2~0_46 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~y$w_buff1_used~0_61 256) 0) .cse5)) (.cse11 (= (mod v_~y$w_buff0_used~0_66 256) 0)) (.cse2 (and .cse8 .cse5))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_60 256) 0)) (.cse3 (= 0 (mod v_~y$w_buff0_used~0_65 256))) (.cse0 (not (= (mod v_~weak$$choice2~0_42 256) 0))) (.cse9 (or .cse1 .cse11 .cse2)) (.cse10 (and (not .cse11) .cse6))) (and (= 0 v_~y$flush_delayed~0_42) (= v_~y$w_buff1_used~0_60 (ite .cse0 v_~y$w_buff1_used~0_61 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_61 0))) (= (ite .cse0 v_~y$mem_tmp~0_28 v_~__unbuffered_p1_EBX~0_24) v_~y~0_58) (= v_~y$w_buff0~0_37 v_~y$w_buff0~0_36) (or (= v_~weak$$choice0~0_20 0) (= v_~weak$$choice0~0_20 1)) (= v_~y~0_59 v_~y$mem_tmp~0_28) (or (= v_~weak$$choice2~0_42 1) (= v_~weak$$choice2~0_42 0)) (= v_~y$r_buff0_thd2~0_45 (ite .cse0 v_~y$r_buff0_thd2~0_46 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~y$r_buff0_thd2~0_46 (ite (and .cse6 (not .cse3)) 0 v_~y$r_buff0_thd2~0_46)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_45 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse4) .cse3)) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1~0_36 v_~y$w_buff1~0_35) (= v_~y$w_buff0_used~0_65 (ite .cse0 v_~y$w_buff0_used~0_66 (ite .cse9 v_~y$w_buff0_used~0_66 (ite .cse10 0 v_~y$w_buff0_used~0_66)))) (= v_~__unbuffered_p1_EBX~0_24 (ite .cse9 v_~y~0_59 (ite .cse10 v_~y$w_buff0~0_37 v_~y$w_buff1~0_36))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_66, ~y$w_buff1~0=v_~y$w_buff1~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_61} OutVars{P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_65, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_20, ~y$mem_tmp~0=v_~y$mem_tmp~0_28, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_45, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~y~0=v_~y~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_42, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_60} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet4, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][41], [30#L755true, Black: 255#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0))), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 132#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 138#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 134#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), 155#true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), 48#$Ultimate##0true, Black: 280#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 9#L789true, Black: 165#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 97#true, Black: 296#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), P2Thread1of1ForFork2InUse, 76#true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 175#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 184#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 178#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 63#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 111#true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 334#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 194#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 92#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 94#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 336#true, 320#true, 191#true, 36#L859true, Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 229#(and (= ~z~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0)), Black: 239#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (= |#ghost~multithreaded| 0) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 237#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 122#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))))]) [2024-06-27 22:01:29,971 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-06-27 22:01:29,972 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 22:01:29,972 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 22:01:29,972 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 22:01:30,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L799-->L810: Formula: (and (= v_~y$w_buff1~0_101 v_~y$w_buff0~0_117) (not (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_171 256) 0)) (not (= (mod v_~y$w_buff1_used~0_154 256) 0)))) 1 0) 0)) (= v_~y$r_buff0_thd3~0_103 v_~y$r_buff1_thd3~0_97) (= v_~y$r_buff0_thd3~0_102 1) (= v_~y$w_buff0_used~0_172 v_~y$w_buff1_used~0_154) (= v_~y$w_buff0_used~0_171 1) (= v_~y$r_buff0_thd0~0_65 v_~y$r_buff1_thd0~0_53) (= v_~y$r_buff0_thd1~0_43 v_~y$r_buff1_thd1~0_35) (= v_~y$r_buff0_thd2~0_83 v_~y$r_buff1_thd2~0_89) (= v_~y$w_buff0~0_116 1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_172, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_103, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_117, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_43} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_171, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_89, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_101, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_102, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_43, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_154} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][191], [30#L755true, Black: 255#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0))), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 132#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 138#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 134#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), 155#true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), 45#L810true, Black: 280#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 26#L773true, Black: 165#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 97#true, Black: 296#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), P2Thread1of1ForFork2InUse, 76#true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 175#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 184#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 178#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 63#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 111#true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 334#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 194#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 92#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 94#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 336#true, 320#true, 191#true, 36#L859true, Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 229#(and (= ~z~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0)), Black: 239#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (= |#ghost~multithreaded| 0) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 237#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 122#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))))]) [2024-06-27 22:01:30,003 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-27 22:01:30,003 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 22:01:30,004 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 22:01:30,004 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 22:01:30,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L859-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (and (not (= |v_#ghost~multithreaded_6| 0)) (let ((.cse2 (mod v_~y$w_buff0_used~0_30 256)) (.cse4 (mod v_~y$r_buff0_thd0~0_6 256)) (.cse1 (mod v_~y$r_buff0_thd3~0_21 256)) (.cse7 (mod v_~y$r_buff1_thd0~0_6 256)) (.cse5 (mod v_~y$r_buff1_thd3~0_18 256)) (.cse9 (mod v_~y$r_buff0_thd1~0_6 256)) (.cse8 (mod v_~y$read_delayed~0_5 256)) (.cse0 (mod v_~y$r_buff1_thd1~0_6 256)) (.cse10 (mod v_~y$flush_delayed~0_11 256)) (.cse3 (mod v_~y$w_buff1_used~0_27 256)) (.cse11 (mod v_~y$r_buff1_thd2~0_14 256)) (.cse6 (mod v_~y$r_buff0_thd2~0_14 256))) (or (< (+ v_~y$w_buff1~0_13 1) v_~__unbuffered_p2_EBX~0_6) (< (+ .cse0 1) v_~__unbuffered_p2_EBX~0_6) (< (+ .cse1 1) v_~__unbuffered_p2_EBX~0_6) (< (+ .cse2 1) v_~__unbuffered_p2_EBX~0_6) (< v_~z~0_8 v_~__unbuffered_p0_EAX~0_6) (< v_~y$w_buff1~0_13 .cse3) (< (+ .cse4 1) v_~__unbuffered_p2_EBX~0_6) (< (+ v_~__unbuffered_p1_EBX~0_6 1) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff1~0_13 .cse5) (< v_~y$w_buff0~0_14 .cse2) (< (+ .cse6 1) v_~__unbuffered_p2_EBX~0_6) (< (+ v_~y~0_19 1) v_~__unbuffered_p2_EBX~0_6) (< v_~x~0_8 v_~__unbuffered_p0_EBX~0_6) (< (+ .cse7 1) v_~__unbuffered_p2_EBX~0_6) (< (+ v_~__unbuffered_p2_EAX~0_6 1) v_~__unbuffered_p2_EBX~0_6) (< (+ (mod v_~weak$$choice0~0_7 256) 1) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff0~0_14 v_~y~0_19) (< v_~z~0_8 v_~__unbuffered_p2_EBX~0_6) (< (+ (mod v_~weak$$choice2~0_21 256) 1) v_~__unbuffered_p2_EBX~0_6) (< (+ 1 v_~y$mem_tmp~0_9) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff0~0_14 .cse3) (< 1 (+ .cse4 v_~__unbuffered_p2_EBX~0_6)) (< (+ v_~__unbuffered_p1_EAX~0_6 1) v_~__unbuffered_p2_EBX~0_6) (< (+ v_~x~0_8 1) v_~__unbuffered_p2_EBX~0_6) (< (+ .cse8 1) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff0~0_14 .cse1) (< 1 (+ v_~__unbuffered_p2_EBX~0_6 .cse7)) (< v_~y$w_buff0~0_14 .cse5) (< (+ .cse5 1) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff0~0_14 v_~y$w_buff1~0_13) (< (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_p2_EBX~0_6) (< 1 (+ v_~__unbuffered_p2_EBX~0_6 .cse9)) (< (+ (mod v_~main$tmp_guard1~0_5 256) 1) v_~__unbuffered_p2_EBX~0_6) (< (+ .cse9 1) v_~__unbuffered_p2_EBX~0_6) (< (+ v_~__unbuffered_p0_EBX~0_6 1) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff0~0_14 v_~__unbuffered_p1_EBX~0_6) (< 1 (+ v_~__unbuffered_p2_EBX~0_6 .cse10)) (< (+ .cse11 1) v_~__unbuffered_p2_EBX~0_6) (< 1 (+ v_~__unbuffered_p2_EBX~0_6 .cse8)) (< 1 (+ .cse0 v_~__unbuffered_p2_EBX~0_6)) (< v_~y$w_buff0~0_14 v_~__unbuffered_p2_EAX~0_6) (< 2 (+ v_~__unbuffered_p2_EBX~0_6 v_~z~0_8)) (< (+ v_~y$w_buff0~0_14 1) v_~__unbuffered_p2_EBX~0_6) (< (+ .cse10 1) v_~__unbuffered_p2_EBX~0_6) (< 2 (+ v_~__unbuffered_p0_EAX~0_6 v_~__unbuffered_p2_EBX~0_6)) (< (+ .cse3 1) v_~__unbuffered_p2_EBX~0_6) (< v_~x~0_8 v_~__unbuffered_p1_EAX~0_6) (< 1 (+ .cse11 v_~__unbuffered_p2_EBX~0_6)) (< 1 (+ v_~__unbuffered_p2_EBX~0_6 .cse6)) (< (+ v_~__unbuffered_p0_EAX~0_6 1) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff0~0_14 v_~y$mem_tmp~0_9)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_5, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~y$w_buff0~0=v_~y$w_buff0~0_14, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_6, #ghost~multithreaded=|v_#ghost~multithreaded_6|, ~y~0=v_~y~0_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_6, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_21, ~x~0=v_~x~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_27} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_5, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~y$w_buff0~0=v_~y$w_buff0~0_14, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_6, #ghost~multithreaded=|v_#ghost~multithreaded_6|, ~y~0=v_~y~0_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_6, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_21, ~x~0=v_~x~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_27} AuxVars[] AssignedVars[][157], [30#L755true, Black: 255#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0))), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 132#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 138#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 155#true, Black: 134#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 149#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), 48#$Ultimate##0true, Black: 280#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 26#L773true, Black: 165#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 97#true, Black: 296#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), P2Thread1of1ForFork2InUse, 76#true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 175#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 184#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 178#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 63#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 111#true, 20#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 194#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 334#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 92#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 94#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 336#true, 320#true, 191#true, Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 229#(and (= ~z~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0)), Black: 239#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (= |#ghost~multithreaded| 0) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 237#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 122#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))))]) [2024-06-27 22:01:30,006 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-06-27 22:01:30,007 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 22:01:30,007 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 22:01:30,007 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 22:01:30,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L859-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (and (not (= |v_#ghost~multithreaded_6| 0)) (let ((.cse2 (mod v_~y$w_buff0_used~0_30 256)) (.cse4 (mod v_~y$r_buff0_thd0~0_6 256)) (.cse1 (mod v_~y$r_buff0_thd3~0_21 256)) (.cse7 (mod v_~y$r_buff1_thd0~0_6 256)) (.cse5 (mod v_~y$r_buff1_thd3~0_18 256)) (.cse9 (mod v_~y$r_buff0_thd1~0_6 256)) (.cse8 (mod v_~y$read_delayed~0_5 256)) (.cse0 (mod v_~y$r_buff1_thd1~0_6 256)) (.cse10 (mod v_~y$flush_delayed~0_11 256)) (.cse3 (mod v_~y$w_buff1_used~0_27 256)) (.cse11 (mod v_~y$r_buff1_thd2~0_14 256)) (.cse6 (mod v_~y$r_buff0_thd2~0_14 256))) (or (< (+ v_~y$w_buff1~0_13 1) v_~__unbuffered_p2_EBX~0_6) (< (+ .cse0 1) v_~__unbuffered_p2_EBX~0_6) (< (+ .cse1 1) v_~__unbuffered_p2_EBX~0_6) (< (+ .cse2 1) v_~__unbuffered_p2_EBX~0_6) (< v_~z~0_8 v_~__unbuffered_p0_EAX~0_6) (< v_~y$w_buff1~0_13 .cse3) (< (+ .cse4 1) v_~__unbuffered_p2_EBX~0_6) (< (+ v_~__unbuffered_p1_EBX~0_6 1) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff1~0_13 .cse5) (< v_~y$w_buff0~0_14 .cse2) (< (+ .cse6 1) v_~__unbuffered_p2_EBX~0_6) (< (+ v_~y~0_19 1) v_~__unbuffered_p2_EBX~0_6) (< v_~x~0_8 v_~__unbuffered_p0_EBX~0_6) (< (+ .cse7 1) v_~__unbuffered_p2_EBX~0_6) (< (+ v_~__unbuffered_p2_EAX~0_6 1) v_~__unbuffered_p2_EBX~0_6) (< (+ (mod v_~weak$$choice0~0_7 256) 1) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff0~0_14 v_~y~0_19) (< v_~z~0_8 v_~__unbuffered_p2_EBX~0_6) (< (+ (mod v_~weak$$choice2~0_21 256) 1) v_~__unbuffered_p2_EBX~0_6) (< (+ 1 v_~y$mem_tmp~0_9) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff0~0_14 .cse3) (< 1 (+ .cse4 v_~__unbuffered_p2_EBX~0_6)) (< (+ v_~__unbuffered_p1_EAX~0_6 1) v_~__unbuffered_p2_EBX~0_6) (< (+ v_~x~0_8 1) v_~__unbuffered_p2_EBX~0_6) (< (+ .cse8 1) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff0~0_14 .cse1) (< 1 (+ v_~__unbuffered_p2_EBX~0_6 .cse7)) (< v_~y$w_buff0~0_14 .cse5) (< (+ .cse5 1) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff0~0_14 v_~y$w_buff1~0_13) (< (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_p2_EBX~0_6) (< 1 (+ v_~__unbuffered_p2_EBX~0_6 .cse9)) (< (+ (mod v_~main$tmp_guard1~0_5 256) 1) v_~__unbuffered_p2_EBX~0_6) (< (+ .cse9 1) v_~__unbuffered_p2_EBX~0_6) (< (+ v_~__unbuffered_p0_EBX~0_6 1) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff0~0_14 v_~__unbuffered_p1_EBX~0_6) (< 1 (+ v_~__unbuffered_p2_EBX~0_6 .cse10)) (< (+ .cse11 1) v_~__unbuffered_p2_EBX~0_6) (< 1 (+ v_~__unbuffered_p2_EBX~0_6 .cse8)) (< 1 (+ .cse0 v_~__unbuffered_p2_EBX~0_6)) (< v_~y$w_buff0~0_14 v_~__unbuffered_p2_EAX~0_6) (< 2 (+ v_~__unbuffered_p2_EBX~0_6 v_~z~0_8)) (< (+ v_~y$w_buff0~0_14 1) v_~__unbuffered_p2_EBX~0_6) (< (+ .cse10 1) v_~__unbuffered_p2_EBX~0_6) (< 2 (+ v_~__unbuffered_p0_EAX~0_6 v_~__unbuffered_p2_EBX~0_6)) (< (+ .cse3 1) v_~__unbuffered_p2_EBX~0_6) (< v_~x~0_8 v_~__unbuffered_p1_EAX~0_6) (< 1 (+ .cse11 v_~__unbuffered_p2_EBX~0_6)) (< 1 (+ v_~__unbuffered_p2_EBX~0_6 .cse6)) (< (+ v_~__unbuffered_p0_EAX~0_6 1) v_~__unbuffered_p2_EBX~0_6) (< v_~y$w_buff0~0_14 v_~y$mem_tmp~0_9)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_5, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~y$w_buff0~0=v_~y$w_buff0~0_14, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_6, #ghost~multithreaded=|v_#ghost~multithreaded_6|, ~y~0=v_~y~0_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_6, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_21, ~x~0=v_~x~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_27} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_5, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~y$w_buff0~0=v_~y$w_buff0~0_14, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_6, #ghost~multithreaded=|v_#ghost~multithreaded_6|, ~y~0=v_~y~0_19, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_6, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_21, ~x~0=v_~x~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_27} AuxVars[] AssignedVars[][157], [Black: 255#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0))), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), 47#L758true, Black: 132#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 138#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 134#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), 155#true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), 48#$Ultimate##0true, Black: 280#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 26#L773true, Black: 165#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 97#true, Black: 296#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 76#true, P0Thread1of1ForFork1InUse, Black: 175#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 184#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 178#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 63#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 111#true, 20#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 334#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 194#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 92#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 94#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 336#true, 320#true, 191#true, Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 229#(and (= ~z~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0)), Black: 239#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (= |#ghost~multithreaded| 0) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 237#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 122#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))))]) [2024-06-27 22:01:30,020 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-27 22:01:30,021 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 22:01:30,021 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 22:01:30,021 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 22:01:30,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L799-->L810: Formula: (and (= v_~y$w_buff1~0_101 v_~y$w_buff0~0_117) (not (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_171 256) 0)) (not (= (mod v_~y$w_buff1_used~0_154 256) 0)))) 1 0) 0)) (= v_~y$r_buff0_thd3~0_103 v_~y$r_buff1_thd3~0_97) (= v_~y$r_buff0_thd3~0_102 1) (= v_~y$w_buff0_used~0_172 v_~y$w_buff1_used~0_154) (= v_~y$w_buff0_used~0_171 1) (= v_~y$r_buff0_thd0~0_65 v_~y$r_buff1_thd0~0_53) (= v_~y$r_buff0_thd1~0_43 v_~y$r_buff1_thd1~0_35) (= v_~y$r_buff0_thd2~0_83 v_~y$r_buff1_thd2~0_89) (= v_~y$w_buff0~0_116 1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_172, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_103, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_117, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_43} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_171, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_89, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_101, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_102, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_43, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_154} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][191], [Black: 255#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0))), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), 47#L758true, Black: 132#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 138#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 134#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), 155#true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0))), 45#L810true, Black: 280#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 26#L773true, Black: 165#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 97#true, Black: 296#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), P2Thread1of1ForFork2InUse, 76#true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 175#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 184#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 178#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)), Black: 312#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 63#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 111#true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 334#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 194#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 92#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 94#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 336#true, 191#true, 320#true, 36#L859true, Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 229#(and (= ~z~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0)), Black: 239#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (= |#ghost~multithreaded| 0) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 237#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 122#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))))]) [2024-06-27 22:01:30,084 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-06-27 22:01:30,084 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-27 22:01:30,084 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-27 22:01:30,084 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-27 22:01:30,626 INFO L124 PetriNetUnfolderBase]: 3753/6800 cut-off events. [2024-06-27 22:01:30,640 INFO L125 PetriNetUnfolderBase]: For 87698/87826 co-relation queries the response was YES. [2024-06-27 22:01:30,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27688 conditions, 6800 events. 3753/6800 cut-off events. For 87698/87826 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 49953 event pairs, 2113 based on Foata normal form. 51/6580 useless extension candidates. Maximal degree in co-relation 27645. Up to 5304 conditions per place. [2024-06-27 22:01:30,711 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 124 selfloop transitions, 12 changer transitions 0/227 dead transitions. [2024-06-27 22:01:30,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 227 transitions, 2883 flow [2024-06-27 22:01:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:01:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:01:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-06-27 22:01:30,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2024-06-27 22:01:30,712 INFO L175 Difference]: Start difference. First operand has 140 places, 208 transitions, 2494 flow. Second operand 6 states and 152 transitions. [2024-06-27 22:01:30,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 227 transitions, 2883 flow [2024-06-27 22:01:30,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 227 transitions, 2622 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 22:01:30,809 INFO L231 Difference]: Finished difference. Result has 141 places, 216 transitions, 2356 flow [2024-06-27 22:01:30,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2236, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2356, PETRI_PLACES=141, PETRI_TRANSITIONS=216} [2024-06-27 22:01:30,810 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 86 predicate places. [2024-06-27 22:01:30,810 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 216 transitions, 2356 flow [2024-06-27 22:01:30,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:01:30,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:30,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:30,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:01:30,811 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:01:30,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:30,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1705365096, now seen corresponding path program 1 times [2024-06-27 22:01:30,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:30,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100881077] [2024-06-27 22:01:30,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:30,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:01:32,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:32,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100881077] [2024-06-27 22:01:32,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100881077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:32,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:32,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:01:32,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765243292] [2024-06-27 22:01:32,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:32,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:01:32,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:32,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:01:32,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:01:32,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:32,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 216 transitions, 2356 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:01:32,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:32,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:32,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:33,836 INFO L124 PetriNetUnfolderBase]: 5423/8089 cut-off events. [2024-06-27 22:01:33,836 INFO L125 PetriNetUnfolderBase]: For 106684/106690 co-relation queries the response was YES. [2024-06-27 22:01:33,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37786 conditions, 8089 events. 5423/8089 cut-off events. For 106684/106690 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 46707 event pairs, 1312 based on Foata normal form. 6/8019 useless extension candidates. Maximal degree in co-relation 37742. Up to 6623 conditions per place. [2024-06-27 22:01:33,904 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 138 selfloop transitions, 131 changer transitions 0/279 dead transitions. [2024-06-27 22:01:33,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 279 transitions, 3374 flow [2024-06-27 22:01:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:01:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:01:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-06-27 22:01:33,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2024-06-27 22:01:33,906 INFO L175 Difference]: Start difference. First operand has 141 places, 216 transitions, 2356 flow. Second operand 8 states and 217 transitions. [2024-06-27 22:01:33,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 279 transitions, 3374 flow [2024-06-27 22:01:34,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 279 transitions, 3355 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 22:01:34,042 INFO L231 Difference]: Finished difference. Result has 147 places, 225 transitions, 2720 flow [2024-06-27 22:01:34,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2337, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2720, PETRI_PLACES=147, PETRI_TRANSITIONS=225} [2024-06-27 22:01:34,043 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 92 predicate places. [2024-06-27 22:01:34,043 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 225 transitions, 2720 flow [2024-06-27 22:01:34,043 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:01:34,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:34,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:34,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:01:34,044 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:01:34,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1178443902, now seen corresponding path program 1 times [2024-06-27 22:01:34,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:34,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445875610] [2024-06-27 22:01:34,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:34,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:35,141 INFO 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:01:35,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:35,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445875610] [2024-06-27 22:01:35,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445875610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:35,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:35,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:01:35,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682887843] [2024-06-27 22:01:35,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:35,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:01:35,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:35,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:01:35,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:01:35,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:35,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 225 transitions, 2720 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:01:35,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:35,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:35,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:36,657 INFO L124 PetriNetUnfolderBase]: 5494/8847 cut-off events. [2024-06-27 22:01:36,657 INFO L125 PetriNetUnfolderBase]: For 121081/121085 co-relation queries the response was YES. [2024-06-27 22:01:36,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40864 conditions, 8847 events. 5494/8847 cut-off events. For 121081/121085 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 56600 event pairs, 2300 based on Foata normal form. 6/8637 useless extension candidates. Maximal degree in co-relation 40818. Up to 7584 conditions per place. [2024-06-27 22:01:36,730 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 229 selfloop transitions, 57 changer transitions 0/296 dead transitions. [2024-06-27 22:01:36,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 296 transitions, 3642 flow [2024-06-27 22:01:36,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:01:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:01:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-06-27 22:01:36,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215419501133787 [2024-06-27 22:01:36,731 INFO L175 Difference]: Start difference. First operand has 147 places, 225 transitions, 2720 flow. Second operand 9 states and 230 transitions. [2024-06-27 22:01:36,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 296 transitions, 3642 flow [2024-06-27 22:01:36,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 296 transitions, 3579 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-27 22:01:36,876 INFO L231 Difference]: Finished difference. Result has 155 places, 241 transitions, 2946 flow [2024-06-27 22:01:36,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2946, PETRI_PLACES=155, PETRI_TRANSITIONS=241} [2024-06-27 22:01:36,883 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 100 predicate places. [2024-06-27 22:01:36,883 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 241 transitions, 2946 flow [2024-06-27 22:01:36,884 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:01:36,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:36,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:36,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:01:36,884 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:01:36,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:36,884 INFO L85 PathProgramCache]: Analyzing trace with hash 410513940, now seen corresponding path program 2 times [2024-06-27 22:01:36,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:36,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589115507] [2024-06-27 22:01:36,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:36,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:37,742 INFO 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:01:37,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:37,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589115507] [2024-06-27 22:01:37,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589115507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:37,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:37,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:01:37,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331681625] [2024-06-27 22:01:37,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:37,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:01:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:37,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:01:37,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:01:37,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:37,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 241 transitions, 2946 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:01:37,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:37,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:37,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:39,406 INFO L124 PetriNetUnfolderBase]: 5624/9046 cut-off events. [2024-06-27 22:01:39,406 INFO L125 PetriNetUnfolderBase]: For 135789/135795 co-relation queries the response was YES. [2024-06-27 22:01:39,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43667 conditions, 9046 events. 5624/9046 cut-off events. For 135789/135795 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 57930 event pairs, 2250 based on Foata normal form. 8/8834 useless extension candidates. Maximal degree in co-relation 43618. Up to 7695 conditions per place. [2024-06-27 22:01:39,476 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 246 selfloop transitions, 78 changer transitions 0/334 dead transitions. [2024-06-27 22:01:39,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 334 transitions, 4315 flow [2024-06-27 22:01:39,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:01:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:01:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 279 transitions. [2024-06-27 22:01:39,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5176252319109462 [2024-06-27 22:01:39,477 INFO L175 Difference]: Start difference. First operand has 155 places, 241 transitions, 2946 flow. Second operand 11 states and 279 transitions. [2024-06-27 22:01:39,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 334 transitions, 4315 flow [2024-06-27 22:01:39,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 334 transitions, 4134 flow, removed 57 selfloop flow, removed 4 redundant places. [2024-06-27 22:01:39,661 INFO L231 Difference]: Finished difference. Result has 164 places, 263 transitions, 3263 flow [2024-06-27 22:01:39,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2837, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3263, PETRI_PLACES=164, PETRI_TRANSITIONS=263} [2024-06-27 22:01:39,662 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 109 predicate places. [2024-06-27 22:01:39,662 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 263 transitions, 3263 flow [2024-06-27 22:01:39,663 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:01:39,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:39,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:39,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:01:39,663 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:01:39,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:39,663 INFO L85 PathProgramCache]: Analyzing trace with hash 110048986, now seen corresponding path program 3 times [2024-06-27 22:01:39,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:39,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456966287] [2024-06-27 22:01:39,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:39,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:40,692 INFO 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:01:40,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:40,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456966287] [2024-06-27 22:01:40,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456966287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:40,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:40,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:01:40,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082207800] [2024-06-27 22:01:40,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:40,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:01:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:40,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:01:40,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:01:40,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:40,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 263 transitions, 3263 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:01:40,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:40,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:40,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:42,270 INFO L124 PetriNetUnfolderBase]: 5669/9072 cut-off events. [2024-06-27 22:01:42,271 INFO L125 PetriNetUnfolderBase]: For 150357/150362 co-relation queries the response was YES. [2024-06-27 22:01:42,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45783 conditions, 9072 events. 5669/9072 cut-off events. For 150357/150362 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 57340 event pairs, 2110 based on Foata normal form. 6/8868 useless extension candidates. Maximal degree in co-relation 45731. Up to 7259 conditions per place. [2024-06-27 22:01:42,351 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 174 selfloop transitions, 148 changer transitions 0/332 dead transitions. [2024-06-27 22:01:42,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 332 transitions, 4523 flow [2024-06-27 22:01:42,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:01:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:01:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2024-06-27 22:01:42,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5374149659863946 [2024-06-27 22:01:42,353 INFO L175 Difference]: Start difference. First operand has 164 places, 263 transitions, 3263 flow. Second operand 9 states and 237 transitions. [2024-06-27 22:01:42,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 332 transitions, 4523 flow [2024-06-27 22:01:42,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 332 transitions, 4296 flow, removed 55 selfloop flow, removed 6 redundant places. [2024-06-27 22:01:42,585 INFO L231 Difference]: Finished difference. Result has 168 places, 276 transitions, 3616 flow [2024-06-27 22:01:42,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3052, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3616, PETRI_PLACES=168, PETRI_TRANSITIONS=276} [2024-06-27 22:01:42,586 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 113 predicate places. [2024-06-27 22:01:42,586 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 276 transitions, 3616 flow [2024-06-27 22:01:42,586 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:01:42,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:42,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:42,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:01:42,587 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:01:42,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:42,587 INFO L85 PathProgramCache]: Analyzing trace with hash -885354520, now seen corresponding path program 2 times [2024-06-27 22:01:42,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:42,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633868083] [2024-06-27 22:01:42,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:42,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:43,502 INFO 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:01:43,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:43,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633868083] [2024-06-27 22:01:43,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633868083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:43,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:43,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:01:43,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283214061] [2024-06-27 22:01:43,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:43,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:01:43,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:43,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:01:43,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:01:43,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:43,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 276 transitions, 3616 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:01:43,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:43,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:43,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:45,202 INFO L124 PetriNetUnfolderBase]: 5879/9500 cut-off events. [2024-06-27 22:01:45,202 INFO L125 PetriNetUnfolderBase]: For 173230/173237 co-relation queries the response was YES. [2024-06-27 22:01:45,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49382 conditions, 9500 events. 5879/9500 cut-off events. For 173230/173237 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 61348 event pairs, 2071 based on Foata normal form. 8/9278 useless extension candidates. Maximal degree in co-relation 49328. Up to 7145 conditions per place. [2024-06-27 22:01:45,294 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 187 selfloop transitions, 157 changer transitions 0/354 dead transitions. [2024-06-27 22:01:45,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 354 transitions, 4926 flow [2024-06-27 22:01:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:01:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:01:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 243 transitions. [2024-06-27 22:01:45,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-06-27 22:01:45,295 INFO L175 Difference]: Start difference. First operand has 168 places, 276 transitions, 3616 flow. Second operand 9 states and 243 transitions. [2024-06-27 22:01:45,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 354 transitions, 4926 flow [2024-06-27 22:01:45,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 354 transitions, 4781 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-27 22:01:45,572 INFO L231 Difference]: Finished difference. Result has 174 places, 293 transitions, 4040 flow [2024-06-27 22:01:45,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3471, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4040, PETRI_PLACES=174, PETRI_TRANSITIONS=293} [2024-06-27 22:01:45,572 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 119 predicate places. [2024-06-27 22:01:45,573 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 293 transitions, 4040 flow [2024-06-27 22:01:45,573 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:01:45,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:45,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:45,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:01:45,573 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:01:45,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash -501202474, now seen corresponding path program 4 times [2024-06-27 22:01:45,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:45,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118525189] [2024-06-27 22:01:45,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:45,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:46,749 INFO 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:01:46,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:46,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118525189] [2024-06-27 22:01:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118525189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:46,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:01:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566766747] [2024-06-27 22:01:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:46,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:01:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:01:46,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:01:46,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:46,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 293 transitions, 4040 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:01:46,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:46,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:46,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:48,467 INFO L124 PetriNetUnfolderBase]: 6054/9925 cut-off events. [2024-06-27 22:01:48,468 INFO L125 PetriNetUnfolderBase]: For 183459/183461 co-relation queries the response was YES. [2024-06-27 22:01:48,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52254 conditions, 9925 events. 6054/9925 cut-off events. For 183459/183461 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 65935 event pairs, 2053 based on Foata normal form. 5/9642 useless extension candidates. Maximal degree in co-relation 52197. Up to 8282 conditions per place. [2024-06-27 22:01:48,567 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 285 selfloop transitions, 85 changer transitions 0/380 dead transitions. [2024-06-27 22:01:48,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 380 transitions, 5401 flow [2024-06-27 22:01:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:01:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:01:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-06-27 22:01:48,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2024-06-27 22:01:48,568 INFO L175 Difference]: Start difference. First operand has 174 places, 293 transitions, 4040 flow. Second operand 8 states and 217 transitions. [2024-06-27 22:01:48,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 380 transitions, 5401 flow [2024-06-27 22:01:48,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 380 transitions, 5150 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-27 22:01:48,895 INFO L231 Difference]: Finished difference. Result has 178 places, 327 transitions, 4397 flow [2024-06-27 22:01:48,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3789, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4397, PETRI_PLACES=178, PETRI_TRANSITIONS=327} [2024-06-27 22:01:48,896 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 123 predicate places. [2024-06-27 22:01:48,896 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 327 transitions, 4397 flow [2024-06-27 22:01:48,896 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:01:48,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:48,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:48,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:01:48,897 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:01:48,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:48,897 INFO L85 PathProgramCache]: Analyzing trace with hash -501082504, now seen corresponding path program 5 times [2024-06-27 22:01:48,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:48,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73928417] [2024-06-27 22:01:48,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:48,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:49,988 INFO 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:01:49,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:49,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73928417] [2024-06-27 22:01:49,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73928417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:49,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:49,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:01:49,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925461372] [2024-06-27 22:01:49,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:49,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:01:49,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:49,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:01:49,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:01:50,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:50,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 327 transitions, 4397 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:01:50,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:50,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:50,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:51,789 INFO L124 PetriNetUnfolderBase]: 6165/10116 cut-off events. [2024-06-27 22:01:51,790 INFO L125 PetriNetUnfolderBase]: For 192991/192996 co-relation queries the response was YES. [2024-06-27 22:01:51,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53255 conditions, 10116 events. 6165/10116 cut-off events. For 192991/192996 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 66995 event pairs, 1998 based on Foata normal form. 7/9832 useless extension candidates. Maximal degree in co-relation 53196. Up to 7821 conditions per place. [2024-06-27 22:01:51,895 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 208 selfloop transitions, 188 changer transitions 0/406 dead transitions. [2024-06-27 22:01:51,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 406 transitions, 6040 flow [2024-06-27 22:01:51,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:01:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:01:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 227 transitions. [2024-06-27 22:01:51,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5790816326530612 [2024-06-27 22:01:51,897 INFO L175 Difference]: Start difference. First operand has 178 places, 327 transitions, 4397 flow. Second operand 8 states and 227 transitions. [2024-06-27 22:01:51,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 406 transitions, 6040 flow [2024-06-27 22:01:52,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 406 transitions, 5883 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-06-27 22:01:52,224 INFO L231 Difference]: Finished difference. Result has 184 places, 346 transitions, 4939 flow [2024-06-27 22:01:52,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4240, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4939, PETRI_PLACES=184, PETRI_TRANSITIONS=346} [2024-06-27 22:01:52,225 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 129 predicate places. [2024-06-27 22:01:52,225 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 346 transitions, 4939 flow [2024-06-27 22:01:52,225 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:01:52,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:52,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:52,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:01:52,225 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:01:52,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash 493658284, now seen corresponding path program 3 times [2024-06-27 22:01:52,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:52,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237918452] [2024-06-27 22:01:52,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:52,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:53,305 INFO 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:01:53,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:53,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237918452] [2024-06-27 22:01:53,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237918452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:53,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:53,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:01:53,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255054935] [2024-06-27 22:01:53,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:53,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:01:53,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:53,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:01:53,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:01:53,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:53,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 346 transitions, 4939 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:01:53,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:53,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:53,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:55,231 INFO L124 PetriNetUnfolderBase]: 6435/10632 cut-off events. [2024-06-27 22:01:55,232 INFO L125 PetriNetUnfolderBase]: For 211638/211645 co-relation queries the response was YES. [2024-06-27 22:01:55,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56172 conditions, 10632 events. 6435/10632 cut-off events. For 211638/211645 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 71774 event pairs, 2199 based on Foata normal form. 10/10335 useless extension candidates. Maximal degree in co-relation 56112. Up to 7775 conditions per place. [2024-06-27 22:01:55,343 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 247 selfloop transitions, 178 changer transitions 0/435 dead transitions. [2024-06-27 22:01:55,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 435 transitions, 6633 flow [2024-06-27 22:01:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:01:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:01:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 232 transitions. [2024-06-27 22:01:55,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2024-06-27 22:01:55,345 INFO L175 Difference]: Start difference. First operand has 184 places, 346 transitions, 4939 flow. Second operand 8 states and 232 transitions. [2024-06-27 22:01:55,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 435 transitions, 6633 flow [2024-06-27 22:01:55,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 435 transitions, 6344 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-06-27 22:01:55,731 INFO L231 Difference]: Finished difference. Result has 189 places, 372 transitions, 5327 flow [2024-06-27 22:01:55,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4650, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5327, PETRI_PLACES=189, PETRI_TRANSITIONS=372} [2024-06-27 22:01:55,732 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 134 predicate places. [2024-06-27 22:01:55,732 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 372 transitions, 5327 flow [2024-06-27 22:01:55,732 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:01:55,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:55,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:55,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:01:55,733 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:01:55,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1128379564, now seen corresponding path program 4 times [2024-06-27 22:01:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:55,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236754849] [2024-06-27 22:01:55,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:55,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:56,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:01:56,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:56,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236754849] [2024-06-27 22:01:56,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236754849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:01:56,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:01:56,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:01:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493321003] [2024-06-27 22:01:56,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:01:56,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:01:56,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:56,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:01:56,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:01:56,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:01:56,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 372 transitions, 5327 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:01:56,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:56,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:01:56,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:58,759 INFO L124 PetriNetUnfolderBase]: 6645/10935 cut-off events. [2024-06-27 22:01:58,759 INFO L125 PetriNetUnfolderBase]: For 232389/232396 co-relation queries the response was YES. [2024-06-27 22:01:58,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58837 conditions, 10935 events. 6645/10935 cut-off events. For 232389/232396 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 73732 event pairs, 2132 based on Foata normal form. 12/10642 useless extension candidates. Maximal degree in co-relation 58776. Up to 7958 conditions per place. [2024-06-27 22:01:58,869 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 257 selfloop transitions, 191 changer transitions 0/458 dead transitions. [2024-06-27 22:01:58,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 458 transitions, 7160 flow [2024-06-27 22:01:58,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:01:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:01:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 233 transitions. [2024-06-27 22:01:58,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5943877551020408 [2024-06-27 22:01:58,871 INFO L175 Difference]: Start difference. First operand has 189 places, 372 transitions, 5327 flow. Second operand 8 states and 233 transitions. [2024-06-27 22:01:58,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 458 transitions, 7160 flow [2024-06-27 22:01:59,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 458 transitions, 6931 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-27 22:01:59,259 INFO L231 Difference]: Finished difference. Result has 194 places, 390 transitions, 5755 flow [2024-06-27 22:01:59,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5116, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5755, PETRI_PLACES=194, PETRI_TRANSITIONS=390} [2024-06-27 22:01:59,260 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 139 predicate places. [2024-06-27 22:01:59,260 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 390 transitions, 5755 flow [2024-06-27 22:01:59,260 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:01:59,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:59,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:59,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:01:59,268 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:01:59,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:59,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1107830284, now seen corresponding path program 5 times [2024-06-27 22:01:59,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:59,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440088544] [2024-06-27 22:01:59,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:59,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:02:00,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:00,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440088544] [2024-06-27 22:02:00,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440088544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:00,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:00,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:02:00,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025294555] [2024-06-27 22:02:00,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:00,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:02:00,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:00,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:02:00,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:02:00,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:02:00,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 390 transitions, 5755 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:02:00,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:00,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:02:00,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:02,435 INFO L124 PetriNetUnfolderBase]: 6623/10905 cut-off events. [2024-06-27 22:02:02,435 INFO L125 PetriNetUnfolderBase]: For 243426/243433 co-relation queries the response was YES. [2024-06-27 22:02:02,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58758 conditions, 10905 events. 6623/10905 cut-off events. For 243426/243433 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 73495 event pairs, 2132 based on Foata normal form. 12/10612 useless extension candidates. Maximal degree in co-relation 58696. Up to 7940 conditions per place. [2024-06-27 22:02:02,543 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 243 selfloop transitions, 199 changer transitions 0/452 dead transitions. [2024-06-27 22:02:02,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 452 transitions, 7167 flow [2024-06-27 22:02:02,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:02:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:02:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 229 transitions. [2024-06-27 22:02:02,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5841836734693877 [2024-06-27 22:02:02,545 INFO L175 Difference]: Start difference. First operand has 194 places, 390 transitions, 5755 flow. Second operand 8 states and 229 transitions. [2024-06-27 22:02:02,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 452 transitions, 7167 flow [2024-06-27 22:02:03,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 452 transitions, 6755 flow, removed 72 selfloop flow, removed 4 redundant places. [2024-06-27 22:02:03,062 INFO L231 Difference]: Finished difference. Result has 198 places, 390 transitions, 5759 flow [2024-06-27 22:02:03,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5343, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5759, PETRI_PLACES=198, PETRI_TRANSITIONS=390} [2024-06-27 22:02:03,062 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 143 predicate places. [2024-06-27 22:02:03,063 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 390 transitions, 5759 flow [2024-06-27 22:02:03,063 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:02:03,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:03,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:03,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:02:03,063 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:02:03,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:03,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1107823588, now seen corresponding path program 6 times [2024-06-27 22:02:03,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:03,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393571364] [2024-06-27 22:02:03,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:03,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:02:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393571364] [2024-06-27 22:02:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393571364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:04,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:04,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:02:04,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052211956] [2024-06-27 22:02:04,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:04,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:02:04,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:04,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:02:04,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:02:04,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:02:04,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 390 transitions, 5759 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:02:04,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:04,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:02:04,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:06,188 INFO L124 PetriNetUnfolderBase]: 6648/10905 cut-off events. [2024-06-27 22:02:06,188 INFO L125 PetriNetUnfolderBase]: For 247662/247665 co-relation queries the response was YES. [2024-06-27 22:02:06,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58723 conditions, 10905 events. 6648/10905 cut-off events. For 247662/247665 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 72906 event pairs, 2048 based on Foata normal form. 5/10598 useless extension candidates. Maximal degree in co-relation 58660. Up to 8476 conditions per place. [2024-06-27 22:02:06,302 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 249 selfloop transitions, 195 changer transitions 0/454 dead transitions. [2024-06-27 22:02:06,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 454 transitions, 7294 flow [2024-06-27 22:02:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:02:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:02:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 223 transitions. [2024-06-27 22:02:06,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5688775510204082 [2024-06-27 22:02:06,304 INFO L175 Difference]: Start difference. First operand has 198 places, 390 transitions, 5759 flow. Second operand 8 states and 223 transitions. [2024-06-27 22:02:06,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 454 transitions, 7294 flow [2024-06-27 22:02:06,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 454 transitions, 6936 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 22:02:06,786 INFO L231 Difference]: Finished difference. Result has 200 places, 396 transitions, 5910 flow [2024-06-27 22:02:06,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5401, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5910, PETRI_PLACES=200, PETRI_TRANSITIONS=396} [2024-06-27 22:02:06,787 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 145 predicate places. [2024-06-27 22:02:06,787 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 396 transitions, 5910 flow [2024-06-27 22:02:06,787 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:02:06,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:06,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:06,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:02:06,788 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:02:06,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:06,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1056885864, now seen corresponding path program 7 times [2024-06-27 22:02:06,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:06,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216824581] [2024-06-27 22:02:06,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:06,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:08,019 INFO 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:02:08,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:08,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216824581] [2024-06-27 22:02:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216824581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:08,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:08,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:02:08,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756359587] [2024-06-27 22:02:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:08,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:02:08,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:08,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:02:08,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:02:08,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:02:08,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 396 transitions, 5910 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:02:08,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:08,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:02:08,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:10,088 INFO L124 PetriNetUnfolderBase]: 6842/10458 cut-off events. [2024-06-27 22:02:10,088 INFO L125 PetriNetUnfolderBase]: For 254744/254744 co-relation queries the response was YES. [2024-06-27 22:02:10,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59498 conditions, 10458 events. 6842/10458 cut-off events. For 254744/254744 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 64828 event pairs, 1523 based on Foata normal form. 3/10330 useless extension candidates. Maximal degree in co-relation 59434. Up to 9305 conditions per place. [2024-06-27 22:02:10,194 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 364 selfloop transitions, 111 changer transitions 0/485 dead transitions. [2024-06-27 22:02:10,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 485 transitions, 7691 flow [2024-06-27 22:02:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:02:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:02:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2024-06-27 22:02:10,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965986394557823 [2024-06-27 22:02:10,197 INFO L175 Difference]: Start difference. First operand has 200 places, 396 transitions, 5910 flow. Second operand 9 states and 219 transitions. [2024-06-27 22:02:10,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 485 transitions, 7691 flow [2024-06-27 22:02:10,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 485 transitions, 7219 flow, removed 54 selfloop flow, removed 5 redundant places. [2024-06-27 22:02:10,778 INFO L231 Difference]: Finished difference. Result has 204 places, 439 transitions, 6321 flow [2024-06-27 22:02:10,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5506, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6321, PETRI_PLACES=204, PETRI_TRANSITIONS=439} [2024-06-27 22:02:10,779 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 149 predicate places. [2024-06-27 22:02:10,779 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 439 transitions, 6321 flow [2024-06-27 22:02:10,779 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:02:10,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:10,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:10,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:02:10,779 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:02:10,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1057005834, now seen corresponding path program 8 times [2024-06-27 22:02:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:10,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442655696] [2024-06-27 22:02:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:10,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:12,096 INFO 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:02:12,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:12,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442655696] [2024-06-27 22:02:12,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442655696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:12,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:12,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:02:12,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390039973] [2024-06-27 22:02:12,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:12,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:02:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:12,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:02:12,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:02:12,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:02:12,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 439 transitions, 6321 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:02:12,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:12,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:02:12,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:14,132 INFO L124 PetriNetUnfolderBase]: 6974/10617 cut-off events. [2024-06-27 22:02:14,132 INFO L125 PetriNetUnfolderBase]: For 265348/265351 co-relation queries the response was YES. [2024-06-27 22:02:14,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59996 conditions, 10617 events. 6974/10617 cut-off events. For 265348/265351 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 65826 event pairs, 1524 based on Foata normal form. 5/10492 useless extension candidates. Maximal degree in co-relation 59931. Up to 8791 conditions per place. [2024-06-27 22:02:14,240 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 262 selfloop transitions, 246 changer transitions 0/518 dead transitions. [2024-06-27 22:02:14,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 518 transitions, 8108 flow [2024-06-27 22:02:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:02:14,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:02:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-06-27 22:02:14,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2024-06-27 22:02:14,245 INFO L175 Difference]: Start difference. First operand has 204 places, 439 transitions, 6321 flow. Second operand 8 states and 212 transitions. [2024-06-27 22:02:14,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 518 transitions, 8108 flow [2024-06-27 22:02:14,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 518 transitions, 7844 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-27 22:02:14,857 INFO L231 Difference]: Finished difference. Result has 205 places, 463 transitions, 6813 flow [2024-06-27 22:02:14,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6057, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6813, PETRI_PLACES=205, PETRI_TRANSITIONS=463} [2024-06-27 22:02:14,858 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 150 predicate places. [2024-06-27 22:02:14,858 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 463 transitions, 6813 flow [2024-06-27 22:02:14,858 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:02:14,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:14,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:14,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:02:14,858 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:02:14,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash 288758672, now seen corresponding path program 6 times [2024-06-27 22:02:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:14,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540829268] [2024-06-27 22:02:14,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:14,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:16,178 INFO 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:02:16,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:16,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540829268] [2024-06-27 22:02:16,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540829268] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:16,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:16,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:02:16,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862346854] [2024-06-27 22:02:16,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:16,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:02:16,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:16,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:02:16,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:02:16,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:02:16,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 463 transitions, 6813 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:02:16,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:16,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:02:16,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:18,407 INFO L124 PetriNetUnfolderBase]: 7284/11133 cut-off events. [2024-06-27 22:02:18,407 INFO L125 PetriNetUnfolderBase]: For 296039/296048 co-relation queries the response was YES. [2024-06-27 22:02:18,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63718 conditions, 11133 events. 7284/11133 cut-off events. For 296039/296048 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 69832 event pairs, 1396 based on Foata normal form. 12/11006 useless extension candidates. Maximal degree in co-relation 63654. Up to 8688 conditions per place. [2024-06-27 22:02:18,526 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 328 selfloop transitions, 212 changer transitions 0/550 dead transitions. [2024-06-27 22:02:18,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 550 transitions, 9008 flow [2024-06-27 22:02:18,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:02:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:02:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-06-27 22:02:18,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2024-06-27 22:02:18,543 INFO L175 Difference]: Start difference. First operand has 205 places, 463 transitions, 6813 flow. Second operand 8 states and 217 transitions. [2024-06-27 22:02:18,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 550 transitions, 9008 flow [2024-06-27 22:02:19,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 550 transitions, 8623 flow, removed 42 selfloop flow, removed 4 redundant places. [2024-06-27 22:02:19,343 INFO L231 Difference]: Finished difference. Result has 209 places, 487 transitions, 7235 flow [2024-06-27 22:02:19,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6428, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7235, PETRI_PLACES=209, PETRI_TRANSITIONS=487} [2024-06-27 22:02:19,348 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 154 predicate places. [2024-06-27 22:02:19,348 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 487 transitions, 7235 flow [2024-06-27 22:02:19,348 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:02:19,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:19,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:19,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:02:19,348 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:02:19,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:19,349 INFO L85 PathProgramCache]: Analyzing trace with hash 288752162, now seen corresponding path program 7 times [2024-06-27 22:02:19,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:19,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303870377] [2024-06-27 22:02:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:19,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:20,533 INFO 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:02:20,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:20,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303870377] [2024-06-27 22:02:20,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303870377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:20,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:20,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:02:20,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784498020] [2024-06-27 22:02:20,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:20,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:02:20,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:20,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:02:20,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:02:20,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:02:20,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 487 transitions, 7235 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:02:20,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:20,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:02:20,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:22,796 INFO L124 PetriNetUnfolderBase]: 7262/11108 cut-off events. [2024-06-27 22:02:22,796 INFO L125 PetriNetUnfolderBase]: For 308181/308190 co-relation queries the response was YES. [2024-06-27 22:02:22,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63820 conditions, 11108 events. 7262/11108 cut-off events. For 308181/308190 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 69814 event pairs, 1409 based on Foata normal form. 12/10982 useless extension candidates. Maximal degree in co-relation 63755. Up to 8670 conditions per place. [2024-06-27 22:02:22,920 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 339 selfloop transitions, 206 changer transitions 0/555 dead transitions. [2024-06-27 22:02:22,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 555 transitions, 9060 flow [2024-06-27 22:02:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:02:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:02:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-06-27 22:02:22,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2024-06-27 22:02:22,922 INFO L175 Difference]: Start difference. First operand has 209 places, 487 transitions, 7235 flow. Second operand 8 states and 217 transitions. [2024-06-27 22:02:22,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 555 transitions, 9060 flow [2024-06-27 22:02:23,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 555 transitions, 8607 flow, removed 80 selfloop flow, removed 4 redundant places. [2024-06-27 22:02:23,836 INFO L231 Difference]: Finished difference. Result has 213 places, 487 transitions, 7222 flow [2024-06-27 22:02:23,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6782, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7222, PETRI_PLACES=213, PETRI_TRANSITIONS=487} [2024-06-27 22:02:23,837 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 158 predicate places. [2024-06-27 22:02:23,837 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 487 transitions, 7222 flow [2024-06-27 22:02:23,838 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:02:23,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:23,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:23,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:02:23,838 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:02:23,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:23,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1065237812, now seen corresponding path program 9 times [2024-06-27 22:02:23,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:23,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756271117] [2024-06-27 22:02:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:23,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:25,113 INFO 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:02:25,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:25,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756271117] [2024-06-27 22:02:25,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756271117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:25,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:25,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:02:25,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458484083] [2024-06-27 22:02:25,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:25,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:02:25,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:25,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:02:25,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:02:25,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:02:25,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 487 transitions, 7222 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:02:25,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:25,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:02:25,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:27,282 INFO L124 PetriNetUnfolderBase]: 7334/11222 cut-off events. [2024-06-27 22:02:27,282 INFO L125 PetriNetUnfolderBase]: For 319735/319738 co-relation queries the response was YES. [2024-06-27 22:02:27,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64360 conditions, 11222 events. 7334/11222 cut-off events. For 319735/319738 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 70754 event pairs, 1578 based on Foata normal form. 6/11083 useless extension candidates. Maximal degree in co-relation 64294. Up to 9263 conditions per place. [2024-06-27 22:02:27,406 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 295 selfloop transitions, 256 changer transitions 0/561 dead transitions. [2024-06-27 22:02:27,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 561 transitions, 9265 flow [2024-06-27 22:02:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:02:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:02:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-06-27 22:02:27,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2024-06-27 22:02:27,416 INFO L175 Difference]: Start difference. First operand has 213 places, 487 transitions, 7222 flow. Second operand 8 states and 212 transitions. [2024-06-27 22:02:27,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 561 transitions, 9265 flow [2024-06-27 22:02:28,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 561 transitions, 8978 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:02:28,109 INFO L231 Difference]: Finished difference. Result has 217 places, 499 transitions, 7711 flow [2024-06-27 22:02:28,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6935, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7711, PETRI_PLACES=217, PETRI_TRANSITIONS=499} [2024-06-27 22:02:28,110 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 162 predicate places. [2024-06-27 22:02:28,110 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 499 transitions, 7711 flow [2024-06-27 22:02:28,110 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:02:28,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:28,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:28,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:02:28,111 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:02:28,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash 824366204, now seen corresponding path program 10 times [2024-06-27 22:02:28,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:28,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505745014] [2024-06-27 22:02:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:28,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:29,413 INFO 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:02:29,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:29,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505745014] [2024-06-27 22:02:29,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505745014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:29,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:29,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:02:29,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471936591] [2024-06-27 22:02:29,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:29,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:02:29,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:29,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:02:29,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:02:29,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:02:29,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 499 transitions, 7711 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:02:29,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:29,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:02:29,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:31,548 INFO L124 PetriNetUnfolderBase]: 7323/11254 cut-off events. [2024-06-27 22:02:31,549 INFO L125 PetriNetUnfolderBase]: For 330566/330566 co-relation queries the response was YES. [2024-06-27 22:02:31,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64427 conditions, 11254 events. 7323/11254 cut-off events. For 330566/330566 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 71032 event pairs, 1537 based on Foata normal form. 4/11095 useless extension candidates. Maximal degree in co-relation 64360. Up to 9252 conditions per place. [2024-06-27 22:02:31,681 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 272 selfloop transitions, 264 changer transitions 0/546 dead transitions. [2024-06-27 22:02:31,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 546 transitions, 9157 flow [2024-06-27 22:02:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:02:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:02:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-06-27 22:02:31,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2024-06-27 22:02:31,682 INFO L175 Difference]: Start difference. First operand has 217 places, 499 transitions, 7711 flow. Second operand 8 states and 206 transitions. [2024-06-27 22:02:31,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 546 transitions, 9157 flow [2024-06-27 22:02:32,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 546 transitions, 8529 flow, removed 142 selfloop flow, removed 4 redundant places. [2024-06-27 22:02:32,396 INFO L231 Difference]: Finished difference. Result has 221 places, 499 transitions, 7633 flow [2024-06-27 22:02:32,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7083, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7633, PETRI_PLACES=221, PETRI_TRANSITIONS=499} [2024-06-27 22:02:32,397 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 166 predicate places. [2024-06-27 22:02:32,397 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 499 transitions, 7633 flow [2024-06-27 22:02:32,397 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:02:32,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:32,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:32,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:02:32,398 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:02:32,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1110159234, now seen corresponding path program 8 times [2024-06-27 22:02:32,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:32,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212918958] [2024-06-27 22:02:32,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:33,748 INFO 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:02:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:33,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212918958] [2024-06-27 22:02:33,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212918958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:33,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:33,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:02:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791026870] [2024-06-27 22:02:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:33,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:02:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:33,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:02:33,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:02:33,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:02:33,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 499 transitions, 7633 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:02:33,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:33,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:02:33,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:35,970 INFO L124 PetriNetUnfolderBase]: 7467/11374 cut-off events. [2024-06-27 22:02:35,970 INFO L125 PetriNetUnfolderBase]: For 348970/348979 co-relation queries the response was YES. [2024-06-27 22:02:36,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65178 conditions, 11374 events. 7467/11374 cut-off events. For 348970/348979 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 71228 event pairs, 1439 based on Foata normal form. 14/11272 useless extension candidates. Maximal degree in co-relation 65110. Up to 8879 conditions per place. [2024-06-27 22:02:36,098 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 311 selfloop transitions, 240 changer transitions 0/561 dead transitions. [2024-06-27 22:02:36,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 561 transitions, 9399 flow [2024-06-27 22:02:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:02:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:02:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-06-27 22:02:36,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-06-27 22:02:36,099 INFO L175 Difference]: Start difference. First operand has 221 places, 499 transitions, 7633 flow. Second operand 8 states and 210 transitions. [2024-06-27 22:02:36,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 561 transitions, 9399 flow [2024-06-27 22:02:36,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 561 transitions, 9060 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 22:02:36,966 INFO L231 Difference]: Finished difference. Result has 224 places, 511 transitions, 7995 flow [2024-06-27 22:02:36,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7294, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7995, PETRI_PLACES=224, PETRI_TRANSITIONS=511} [2024-06-27 22:02:36,967 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 169 predicate places. [2024-06-27 22:02:36,967 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 511 transitions, 7995 flow [2024-06-27 22:02:36,967 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:02:36,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:36,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:36,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:02:36,967 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:02:36,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1345459280, now seen corresponding path program 9 times [2024-06-27 22:02:36,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:36,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171610801] [2024-06-27 22:02:36,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:36,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:38,168 INFO 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:02:38,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:38,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171610801] [2024-06-27 22:02:38,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171610801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:38,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:38,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:02:38,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925568190] [2024-06-27 22:02:38,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:38,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:02:38,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:38,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:02:38,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:02:38,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:02:38,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 511 transitions, 7995 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:02:38,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:38,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:02:38,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:40,427 INFO L124 PetriNetUnfolderBase]: 7611/11592 cut-off events. [2024-06-27 22:02:40,427 INFO L125 PetriNetUnfolderBase]: For 372512/372521 co-relation queries the response was YES. [2024-06-27 22:02:40,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67452 conditions, 11592 events. 7611/11592 cut-off events. For 372512/372521 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 72701 event pairs, 1433 based on Foata normal form. 14/11486 useless extension candidates. Maximal degree in co-relation 67383. Up to 9004 conditions per place. [2024-06-27 22:02:40,555 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 339 selfloop transitions, 232 changer transitions 0/581 dead transitions. [2024-06-27 22:02:40,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 581 transitions, 9971 flow [2024-06-27 22:02:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:02:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:02:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-06-27 22:02:40,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2024-06-27 22:02:40,556 INFO L175 Difference]: Start difference. First operand has 224 places, 511 transitions, 7995 flow. Second operand 8 states and 212 transitions. [2024-06-27 22:02:40,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 581 transitions, 9971 flow [2024-06-27 22:02:41,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 581 transitions, 9521 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-27 22:02:41,652 INFO L231 Difference]: Finished difference. Result has 226 places, 523 transitions, 8256 flow [2024-06-27 22:02:41,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7557, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8256, PETRI_PLACES=226, PETRI_TRANSITIONS=523} [2024-06-27 22:02:41,653 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 171 predicate places. [2024-06-27 22:02:41,653 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 523 transitions, 8256 flow [2024-06-27 22:02:41,653 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:02:41,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:41,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:41,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:02:41,654 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:02:41,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 518443760, now seen corresponding path program 10 times [2024-06-27 22:02:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:41,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389700706] [2024-06-27 22:02:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:42,906 INFO 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:02:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:42,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389700706] [2024-06-27 22:02:42,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389700706] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:42,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:42,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:02:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945185834] [2024-06-27 22:02:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:42,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:02:42,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:42,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:02:42,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:02:42,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:02:42,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 523 transitions, 8256 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:02:42,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:42,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:02:42,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:45,344 INFO L124 PetriNetUnfolderBase]: 7589/11574 cut-off events. [2024-06-27 22:02:45,344 INFO L125 PetriNetUnfolderBase]: For 380384/380393 co-relation queries the response was YES. [2024-06-27 22:02:45,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66912 conditions, 11574 events. 7589/11574 cut-off events. For 380384/380393 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 72766 event pairs, 1448 based on Foata normal form. 14/11465 useless extension candidates. Maximal degree in co-relation 66842. Up to 8986 conditions per place. [2024-06-27 22:02:45,456 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 344 selfloop transitions, 230 changer transitions 0/584 dead transitions. [2024-06-27 22:02:45,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 584 transitions, 9920 flow [2024-06-27 22:02:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:02:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:02:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2024-06-27 22:02:45,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382653061224489 [2024-06-27 22:02:45,464 INFO L175 Difference]: Start difference. First operand has 226 places, 523 transitions, 8256 flow. Second operand 8 states and 211 transitions. [2024-06-27 22:02:45,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 584 transitions, 9920 flow [2024-06-27 22:02:46,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 584 transitions, 9096 flow, removed 72 selfloop flow, removed 8 redundant places. [2024-06-27 22:02:46,594 INFO L231 Difference]: Finished difference. Result has 226 places, 523 transitions, 7910 flow [2024-06-27 22:02:46,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7432, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7910, PETRI_PLACES=226, PETRI_TRANSITIONS=523} [2024-06-27 22:02:46,594 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 171 predicate places. [2024-06-27 22:02:46,595 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 523 transitions, 7910 flow [2024-06-27 22:02:46,595 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:02:46,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:46,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:46,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:02:46,595 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:02:46,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:46,595 INFO L85 PathProgramCache]: Analyzing trace with hash 527025800, now seen corresponding path program 1 times [2024-06-27 22:02:46,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:46,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560464847] [2024-06-27 22:02:46,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:46,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:48,295 INFO 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:02:48,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560464847] [2024-06-27 22:02:48,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560464847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:48,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:48,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:02:48,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306342100] [2024-06-27 22:02:48,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:48,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:02:48,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:48,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:02:48,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:02:48,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 22:02:48,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 523 transitions, 7910 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:02:48,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:48,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 22:02:48,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:50,626 INFO L124 PetriNetUnfolderBase]: 7137/11586 cut-off events. [2024-06-27 22:02:50,627 INFO L125 PetriNetUnfolderBase]: For 377605/377649 co-relation queries the response was YES. [2024-06-27 22:02:50,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63249 conditions, 11586 events. 7137/11586 cut-off events. For 377605/377649 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 79741 event pairs, 2756 based on Foata normal form. 46/11280 useless extension candidates. Maximal degree in co-relation 63178. Up to 9900 conditions per place. [2024-06-27 22:02:50,752 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 520 selfloop transitions, 21 changer transitions 0/570 dead transitions. [2024-06-27 22:02:50,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 570 transitions, 9330 flow [2024-06-27 22:02:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:02:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:02:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2024-06-27 22:02:50,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943310657596372 [2024-06-27 22:02:50,753 INFO L175 Difference]: Start difference. First operand has 226 places, 523 transitions, 7910 flow. Second operand 9 states and 218 transitions. [2024-06-27 22:02:50,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 570 transitions, 9330 flow [2024-06-27 22:02:51,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 570 transitions, 8590 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-27 22:02:51,450 INFO L231 Difference]: Finished difference. Result has 228 places, 528 transitions, 7303 flow [2024-06-27 22:02:51,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7176, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7303, PETRI_PLACES=228, PETRI_TRANSITIONS=528} [2024-06-27 22:02:51,451 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 173 predicate places. [2024-06-27 22:02:51,451 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 528 transitions, 7303 flow [2024-06-27 22:02:51,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:02:51,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:51,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:51,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:02:51,452 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:02:51,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:51,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1100176079, now seen corresponding path program 1 times [2024-06-27 22:02:51,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:51,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878929827] [2024-06-27 22:02:51,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:51,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:02:52,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:52,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878929827] [2024-06-27 22:02:52,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878929827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:52,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:52,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:02:52,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638485500] [2024-06-27 22:02:52,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:52,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:02:52,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:52,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:02:52,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:02:52,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-27 22:02:52,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 528 transitions, 7303 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 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:02:52,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:52,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-27 22:02:52,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:54,586 INFO L124 PetriNetUnfolderBase]: 5858/10153 cut-off events. [2024-06-27 22:02:54,586 INFO L125 PetriNetUnfolderBase]: For 350191/350558 co-relation queries the response was YES. [2024-06-27 22:02:54,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53538 conditions, 10153 events. 5858/10153 cut-off events. For 350191/350558 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 75273 event pairs, 2554 based on Foata normal form. 112/9833 useless extension candidates. Maximal degree in co-relation 53465. Up to 8044 conditions per place. [2024-06-27 22:02:54,708 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 362 selfloop transitions, 15 changer transitions 0/547 dead transitions. [2024-06-27 22:02:54,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 547 transitions, 8185 flow [2024-06-27 22:02:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:02:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:02:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-06-27 22:02:54,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272108843537415 [2024-06-27 22:02:54,710 INFO L175 Difference]: Start difference. First operand has 228 places, 528 transitions, 7303 flow. Second operand 6 states and 155 transitions. [2024-06-27 22:02:54,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 547 transitions, 8185 flow [2024-06-27 22:02:55,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 547 transitions, 8101 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 22:02:55,276 INFO L231 Difference]: Finished difference. Result has 227 places, 531 transitions, 7287 flow [2024-06-27 22:02:55,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7219, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7287, PETRI_PLACES=227, PETRI_TRANSITIONS=531} [2024-06-27 22:02:55,277 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 172 predicate places. [2024-06-27 22:02:55,277 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 531 transitions, 7287 flow [2024-06-27 22:02:55,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 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:02:55,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:55,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:55,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:02:55,278 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:02:55,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1484973847, now seen corresponding path program 1 times [2024-06-27 22:02:55,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:55,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473895775] [2024-06-27 22:02:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:55,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:56,800 INFO 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:02:56,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:56,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473895775] [2024-06-27 22:02:56,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473895775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:02:56,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:02:56,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:02:56,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711297657] [2024-06-27 22:02:56,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:02:56,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:02:56,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:56,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:02:56,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:02:56,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:02:56,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 531 transitions, 7287 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:02:56,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:56,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:02:56,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:02:59,198 INFO L124 PetriNetUnfolderBase]: 7629/11821 cut-off events. [2024-06-27 22:02:59,199 INFO L125 PetriNetUnfolderBase]: For 366423/366423 co-relation queries the response was YES. [2024-06-27 22:02:59,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66442 conditions, 11821 events. 7629/11821 cut-off events. For 366423/366423 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 75976 event pairs, 1607 based on Foata normal form. 4/11653 useless extension candidates. Maximal degree in co-relation 66368. Up to 10305 conditions per place. [2024-06-27 22:02:59,329 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 465 selfloop transitions, 114 changer transitions 0/589 dead transitions. [2024-06-27 22:02:59,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 589 transitions, 8806 flow [2024-06-27 22:02:59,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:02:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:02:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 244 transitions. [2024-06-27 22:02:59,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2024-06-27 22:02:59,330 INFO L175 Difference]: Start difference. First operand has 227 places, 531 transitions, 7287 flow. Second operand 10 states and 244 transitions. [2024-06-27 22:02:59,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 589 transitions, 8806 flow [2024-06-27 22:03:00,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 589 transitions, 8760 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 22:03:00,175 INFO L231 Difference]: Finished difference. Result has 233 places, 534 transitions, 7538 flow [2024-06-27 22:03:00,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7241, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7538, PETRI_PLACES=233, PETRI_TRANSITIONS=534} [2024-06-27 22:03:00,176 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 178 predicate places. [2024-06-27 22:03:00,176 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 534 transitions, 7538 flow [2024-06-27 22:03:00,176 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:03:00,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:00,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:00,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:03:00,177 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:03:00,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:00,177 INFO L85 PathProgramCache]: Analyzing trace with hash -784990201, now seen corresponding path program 2 times [2024-06-27 22:03:00,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:00,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277686472] [2024-06-27 22:03:00,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:00,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:03:01,093 INFO 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:03:01,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:03:01,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277686472] [2024-06-27 22:03:01,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277686472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:03:01,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:03:01,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:03:01,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856074857] [2024-06-27 22:03:01,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:03:01,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:03:01,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:03:01,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:03:01,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:03:01,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:03:01,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 534 transitions, 7538 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:03:01,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:03:01,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:03:01,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:03,539 INFO L124 PetriNetUnfolderBase]: 7851/12522 cut-off events. [2024-06-27 22:03:03,540 INFO L125 PetriNetUnfolderBase]: For 400471/400475 co-relation queries the response was YES. [2024-06-27 22:03:03,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70976 conditions, 12522 events. 7851/12522 cut-off events. For 400471/400475 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 83969 event pairs, 2404 based on Foata normal form. 8/12286 useless extension candidates. Maximal degree in co-relation 70901. Up to 10313 conditions per place. [2024-06-27 22:03:03,882 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 457 selfloop transitions, 164 changer transitions 0/631 dead transitions. [2024-06-27 22:03:03,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 631 transitions, 9766 flow [2024-06-27 22:03:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:03:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:03:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 308 transitions. [2024-06-27 22:03:03,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-27 22:03:03,886 INFO L175 Difference]: Start difference. First operand has 233 places, 534 transitions, 7538 flow. Second operand 12 states and 308 transitions. [2024-06-27 22:03:03,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 631 transitions, 9766 flow [2024-06-27 22:03:04,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 631 transitions, 9439 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-06-27 22:03:04,665 INFO L231 Difference]: Finished difference. Result has 239 places, 551 transitions, 7903 flow [2024-06-27 22:03:04,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7297, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7903, PETRI_PLACES=239, PETRI_TRANSITIONS=551} [2024-06-27 22:03:04,667 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 184 predicate places. [2024-06-27 22:03:04,668 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 551 transitions, 7903 flow [2024-06-27 22:03:04,668 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:03:04,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:04,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:04,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:03:04,668 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:03:04,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:04,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1517245501, now seen corresponding path program 3 times [2024-06-27 22:03:04,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:04,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293870775] [2024-06-27 22:03:04,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:03:05,909 INFO 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:03:05,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:03:05,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293870775] [2024-06-27 22:03:05,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293870775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:03:05,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:03:05,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:03:05,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064415934] [2024-06-27 22:03:05,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:03:05,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:03:05,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:03:05,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:03:05,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:03:06,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:03:06,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 551 transitions, 7903 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:03:06,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:03:06,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:03:06,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:08,407 INFO L124 PetriNetUnfolderBase]: 8055/12793 cut-off events. [2024-06-27 22:03:08,407 INFO L125 PetriNetUnfolderBase]: For 425937/425941 co-relation queries the response was YES. [2024-06-27 22:03:08,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74136 conditions, 12793 events. 8055/12793 cut-off events. For 425937/425941 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 85953 event pairs, 2508 based on Foata normal form. 10/12566 useless extension candidates. Maximal degree in co-relation 74059. Up to 10814 conditions per place. [2024-06-27 22:03:08,533 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 482 selfloop transitions, 138 changer transitions 0/630 dead transitions. [2024-06-27 22:03:08,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 630 transitions, 9743 flow [2024-06-27 22:03:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:03:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:03:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 255 transitions. [2024-06-27 22:03:08,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2024-06-27 22:03:08,534 INFO L175 Difference]: Start difference. First operand has 239 places, 551 transitions, 7903 flow. Second operand 10 states and 255 transitions. [2024-06-27 22:03:08,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 630 transitions, 9743 flow [2024-06-27 22:03:09,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 630 transitions, 9417 flow, removed 92 selfloop flow, removed 7 redundant places. [2024-06-27 22:03:09,497 INFO L231 Difference]: Finished difference. Result has 242 places, 569 transitions, 8185 flow [2024-06-27 22:03:09,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7669, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8185, PETRI_PLACES=242, PETRI_TRANSITIONS=569} [2024-06-27 22:03:09,498 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 187 predicate places. [2024-06-27 22:03:09,498 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 569 transitions, 8185 flow [2024-06-27 22:03:09,498 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:03:09,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:09,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:09,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:03:09,499 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:03:09,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash -883441201, now seen corresponding path program 4 times [2024-06-27 22:03:09,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:09,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143059344] [2024-06-27 22:03:09,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:03:10,673 INFO 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:03:10,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:03:10,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143059344] [2024-06-27 22:03:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143059344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:03:10,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:03:10,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:03:10,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124272601] [2024-06-27 22:03:10,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:03:10,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:03:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:03:10,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:03:10,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:03:10,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:03:10,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 569 transitions, 8185 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:03:10,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:03:10,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:03:10,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:13,497 INFO L124 PetriNetUnfolderBase]: 8201/12890 cut-off events. [2024-06-27 22:03:13,497 INFO L125 PetriNetUnfolderBase]: For 441729/441734 co-relation queries the response was YES. [2024-06-27 22:03:13,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76386 conditions, 12890 events. 8201/12890 cut-off events. For 441729/441734 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 85437 event pairs, 1921 based on Foata normal form. 6/12694 useless extension candidates. Maximal degree in co-relation 76307. Up to 8057 conditions per place. [2024-06-27 22:03:13,643 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 252 selfloop transitions, 394 changer transitions 0/656 dead transitions. [2024-06-27 22:03:13,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 656 transitions, 10631 flow [2024-06-27 22:03:13,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:03:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:03:13,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 274 transitions. [2024-06-27 22:03:13,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2024-06-27 22:03:13,645 INFO L175 Difference]: Start difference. First operand has 242 places, 569 transitions, 8185 flow. Second operand 10 states and 274 transitions. [2024-06-27 22:03:13,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 656 transitions, 10631 flow [2024-06-27 22:03:14,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 656 transitions, 10331 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-27 22:03:14,673 INFO L231 Difference]: Finished difference. Result has 245 places, 585 transitions, 9122 flow [2024-06-27 22:03:14,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7885, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=381, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9122, PETRI_PLACES=245, PETRI_TRANSITIONS=585} [2024-06-27 22:03:14,673 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 190 predicate places. [2024-06-27 22:03:14,673 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 585 transitions, 9122 flow [2024-06-27 22:03:14,674 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:03:14,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:14,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:14,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:03:14,674 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:03:14,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2009253275, now seen corresponding path program 5 times [2024-06-27 22:03:14,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:14,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882149743] [2024-06-27 22:03:14,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:14,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:03:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:03:15,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:03:15,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882149743] [2024-06-27 22:03:15,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882149743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:03:15,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:03:15,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:03:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621996841] [2024-06-27 22:03:15,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:03:15,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:03:15,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:03:15,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:03:15,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:03:15,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:03:15,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 585 transitions, 9122 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:03:15,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:03:15,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:03:15,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:18,285 INFO L124 PetriNetUnfolderBase]: 8191/13052 cut-off events. [2024-06-27 22:03:18,286 INFO L125 PetriNetUnfolderBase]: For 472172/472177 co-relation queries the response was YES. [2024-06-27 22:03:18,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80361 conditions, 13052 events. 8191/13052 cut-off events. For 472172/472177 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 88379 event pairs, 1961 based on Foata normal form. 6/12789 useless extension candidates. Maximal degree in co-relation 80280. Up to 8049 conditions per place. [2024-06-27 22:03:18,439 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 265 selfloop transitions, 380 changer transitions 0/655 dead transitions. [2024-06-27 22:03:18,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 655 transitions, 11124 flow [2024-06-27 22:03:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:03:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:03:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 274 transitions. [2024-06-27 22:03:18,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2024-06-27 22:03:18,446 INFO L175 Difference]: Start difference. First operand has 245 places, 585 transitions, 9122 flow. Second operand 10 states and 274 transitions. [2024-06-27 22:03:18,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 655 transitions, 11124 flow [2024-06-27 22:03:19,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 655 transitions, 10837 flow, removed 73 selfloop flow, removed 4 redundant places. [2024-06-27 22:03:19,509 INFO L231 Difference]: Finished difference. Result has 251 places, 585 transitions, 9630 flow [2024-06-27 22:03:19,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8859, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=380, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9630, PETRI_PLACES=251, PETRI_TRANSITIONS=585} [2024-06-27 22:03:19,510 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 196 predicate places. [2024-06-27 22:03:19,510 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 585 transitions, 9630 flow [2024-06-27 22:03:19,510 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:03:19,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:19,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:19,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:03:19,511 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:03:19,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:19,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1880185267, now seen corresponding path program 6 times [2024-06-27 22:03:19,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:19,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804934019] [2024-06-27 22:03:19,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:19,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:03:20,847 INFO 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:03:20,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:03:20,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804934019] [2024-06-27 22:03:20,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804934019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:03:20,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:03:20,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:03:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327899092] [2024-06-27 22:03:20,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:03:20,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:03:20,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:03:20,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:03:20,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:03:21,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:03:21,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 585 transitions, 9630 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:03:21,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:03:21,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:03:21,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:23,630 INFO L124 PetriNetUnfolderBase]: 8399/13531 cut-off events. [2024-06-27 22:03:23,630 INFO L125 PetriNetUnfolderBase]: For 484545/484547 co-relation queries the response was YES. [2024-06-27 22:03:23,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83372 conditions, 13531 events. 8399/13531 cut-off events. For 484545/484547 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 93311 event pairs, 2327 based on Foata normal form. 8/13234 useless extension candidates. Maximal degree in co-relation 83289. Up to 11237 conditions per place. [2024-06-27 22:03:23,801 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 515 selfloop transitions, 146 changer transitions 0/671 dead transitions. [2024-06-27 22:03:23,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 671 transitions, 11613 flow [2024-06-27 22:03:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:03:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:03:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 242 transitions. [2024-06-27 22:03:23,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5487528344671202 [2024-06-27 22:03:23,803 INFO L175 Difference]: Start difference. First operand has 251 places, 585 transitions, 9630 flow. Second operand 9 states and 242 transitions. [2024-06-27 22:03:23,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 671 transitions, 11613 flow [2024-06-27 22:03:24,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 671 transitions, 10816 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-27 22:03:24,976 INFO L231 Difference]: Finished difference. Result has 252 places, 609 transitions, 9528 flow [2024-06-27 22:03:24,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8898, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9528, PETRI_PLACES=252, PETRI_TRANSITIONS=609} [2024-06-27 22:03:24,977 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 197 predicate places. [2024-06-27 22:03:24,977 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 609 transitions, 9528 flow [2024-06-27 22:03:24,977 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:03:24,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:24,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:24,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:03:24,977 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:03:24,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1876460617, now seen corresponding path program 7 times [2024-06-27 22:03:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:24,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727650103] [2024-06-27 22:03:24,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:24,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:03:26,339 INFO 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:03:26,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:03:26,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727650103] [2024-06-27 22:03:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727650103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:03:26,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:03:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:03:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161926746] [2024-06-27 22:03:26,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:03:26,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:03:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:03:26,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:03:26,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:03:26,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:03:26,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 609 transitions, 9528 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:03:26,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:03:26,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:03:26,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:29,245 INFO L124 PetriNetUnfolderBase]: 8759/14088 cut-off events. [2024-06-27 22:03:29,245 INFO L125 PetriNetUnfolderBase]: For 511749/511754 co-relation queries the response was YES. [2024-06-27 22:03:29,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86054 conditions, 14088 events. 8759/14088 cut-off events. For 511749/511754 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 97625 event pairs, 2065 based on Foata normal form. 8/13795 useless extension candidates. Maximal degree in co-relation 85970. Up to 8543 conditions per place. [2024-06-27 22:03:29,432 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 281 selfloop transitions, 427 changer transitions 0/718 dead transitions. [2024-06-27 22:03:29,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 718 transitions, 12622 flow [2024-06-27 22:03:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:03:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:03:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 264 transitions. [2024-06-27 22:03:29,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5986394557823129 [2024-06-27 22:03:29,434 INFO L175 Difference]: Start difference. First operand has 252 places, 609 transitions, 9528 flow. Second operand 9 states and 264 transitions. [2024-06-27 22:03:29,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 718 transitions, 12622 flow [2024-06-27 22:03:30,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 718 transitions, 12354 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-27 22:03:30,810 INFO L231 Difference]: Finished difference. Result has 255 places, 637 transitions, 10664 flow [2024-06-27 22:03:30,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9260, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=399, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10664, PETRI_PLACES=255, PETRI_TRANSITIONS=637} [2024-06-27 22:03:30,811 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 200 predicate places. [2024-06-27 22:03:30,811 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 637 transitions, 10664 flow [2024-06-27 22:03:30,811 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:03:30,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:30,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:30,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:03:30,811 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:03:30,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:30,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1876466197, now seen corresponding path program 8 times [2024-06-27 22:03:30,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:30,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403348845] [2024-06-27 22:03:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:30,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:03:32,177 INFO 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:03:32,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:03:32,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403348845] [2024-06-27 22:03:32,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403348845] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:03:32,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:03:32,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:03:32,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970811188] [2024-06-27 22:03:32,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:03:32,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:03:32,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:03:32,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:03:32,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:03:32,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:03:32,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 637 transitions, 10664 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:03:32,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:03:32,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:03:32,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:35,208 INFO L124 PetriNetUnfolderBase]: 8743/14066 cut-off events. [2024-06-27 22:03:35,209 INFO L125 PetriNetUnfolderBase]: For 533275/533280 co-relation queries the response was YES. [2024-06-27 22:03:35,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88799 conditions, 14066 events. 8743/14066 cut-off events. For 533275/533280 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 97393 event pairs, 2062 based on Foata normal form. 8/13773 useless extension candidates. Maximal degree in co-relation 88713. Up to 8530 conditions per place. [2024-06-27 22:03:35,400 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 290 selfloop transitions, 417 changer transitions 0/717 dead transitions. [2024-06-27 22:03:35,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 717 transitions, 13130 flow [2024-06-27 22:03:35,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:03:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:03:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 264 transitions. [2024-06-27 22:03:35,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5986394557823129 [2024-06-27 22:03:35,402 INFO L175 Difference]: Start difference. First operand has 255 places, 637 transitions, 10664 flow. Second operand 9 states and 264 transitions. [2024-06-27 22:03:35,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 717 transitions, 13130 flow [2024-06-27 22:03:37,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 717 transitions, 12556 flow, removed 72 selfloop flow, removed 3 redundant places. [2024-06-27 22:03:37,096 INFO L231 Difference]: Finished difference. Result has 261 places, 637 transitions, 10943 flow [2024-06-27 22:03:37,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10090, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=417, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10943, PETRI_PLACES=261, PETRI_TRANSITIONS=637} [2024-06-27 22:03:37,097 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 206 predicate places. [2024-06-27 22:03:37,097 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 637 transitions, 10943 flow [2024-06-27 22:03:37,097 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:03:37,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:37,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:37,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:03:37,097 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:03:37,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:37,098 INFO L85 PathProgramCache]: Analyzing trace with hash 620231689, now seen corresponding path program 9 times [2024-06-27 22:03:37,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:37,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808124788] [2024-06-27 22:03:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:37,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:03:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:03:38,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:03:38,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808124788] [2024-06-27 22:03:38,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808124788] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:03:38,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:03:38,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:03:38,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919924103] [2024-06-27 22:03:38,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:03:38,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:03:38,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:03:38,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:03:38,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:03:38,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:03:38,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 637 transitions, 10943 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:03:38,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:03:38,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:03:38,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:41,657 INFO L124 PetriNetUnfolderBase]: 8893/14255 cut-off events. [2024-06-27 22:03:41,657 INFO L125 PetriNetUnfolderBase]: For 572145/572148 co-relation queries the response was YES. [2024-06-27 22:03:41,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90612 conditions, 14255 events. 8893/14255 cut-off events. For 572145/572148 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 98306 event pairs, 1922 based on Foata normal form. 6/13978 useless extension candidates. Maximal degree in co-relation 90525. Up to 8660 conditions per place. [2024-06-27 22:03:41,825 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 254 selfloop transitions, 460 changer transitions 0/724 dead transitions. [2024-06-27 22:03:41,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 724 transitions, 13666 flow [2024-06-27 22:03:41,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:03:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:03:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 260 transitions. [2024-06-27 22:03:41,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5895691609977324 [2024-06-27 22:03:41,827 INFO L175 Difference]: Start difference. First operand has 261 places, 637 transitions, 10943 flow. Second operand 9 states and 260 transitions. [2024-06-27 22:03:41,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 724 transitions, 13666 flow [2024-06-27 22:03:42,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 724 transitions, 12712 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-27 22:03:42,926 INFO L231 Difference]: Finished difference. Result has 262 places, 649 transitions, 11195 flow [2024-06-27 22:03:42,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10013, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=448, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11195, PETRI_PLACES=262, PETRI_TRANSITIONS=649} [2024-06-27 22:03:42,927 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 207 predicate places. [2024-06-27 22:03:42,927 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 649 transitions, 11195 flow [2024-06-27 22:03:42,927 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:03:42,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:42,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:42,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:03:42,927 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:03:42,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:42,928 INFO L85 PathProgramCache]: Analyzing trace with hash -17199611, now seen corresponding path program 10 times [2024-06-27 22:03:42,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:42,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104791791] [2024-06-27 22:03:42,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:42,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:03:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:03:44,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:03:44,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104791791] [2024-06-27 22:03:44,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104791791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:03:44,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:03:44,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:03:44,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846630575] [2024-06-27 22:03:44,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:03:44,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:03:44,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:03:44,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:03:44,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:03:44,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:03:44,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 649 transitions, 11195 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:03:44,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:03:44,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:03:44,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:47,271 INFO L124 PetriNetUnfolderBase]: 8977/14392 cut-off events. [2024-06-27 22:03:47,271 INFO L125 PetriNetUnfolderBase]: For 587464/587467 co-relation queries the response was YES. [2024-06-27 22:03:47,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91901 conditions, 14392 events. 8977/14392 cut-off events. For 587464/587467 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 99438 event pairs, 1913 based on Foata normal form. 6/14113 useless extension candidates. Maximal degree in co-relation 91813. Up to 8732 conditions per place. [2024-06-27 22:03:47,477 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 298 selfloop transitions, 432 changer transitions 0/740 dead transitions. [2024-06-27 22:03:47,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 740 transitions, 14006 flow [2024-06-27 22:03:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:03:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:03:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 263 transitions. [2024-06-27 22:03:47,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5963718820861678 [2024-06-27 22:03:47,478 INFO L175 Difference]: Start difference. First operand has 262 places, 649 transitions, 11195 flow. Second operand 9 states and 263 transitions. [2024-06-27 22:03:47,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 740 transitions, 14006 flow [2024-06-27 22:03:49,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 740 transitions, 13364 flow, removed 56 selfloop flow, removed 4 redundant places. [2024-06-27 22:03:49,371 INFO L231 Difference]: Finished difference. Result has 267 places, 655 transitions, 11567 flow [2024-06-27 22:03:49,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10571, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=426, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11567, PETRI_PLACES=267, PETRI_TRANSITIONS=655} [2024-06-27 22:03:49,372 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 212 predicate places. [2024-06-27 22:03:49,372 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 655 transitions, 11567 flow [2024-06-27 22:03:49,372 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:03:49,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:49,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:49,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:03:49,373 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:03:49,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash -17205191, now seen corresponding path program 11 times [2024-06-27 22:03:49,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:49,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214674541] [2024-06-27 22:03:49,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:49,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:03:50,666 INFO 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:03:50,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:03:50,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214674541] [2024-06-27 22:03:50,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214674541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:03:50,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:03:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:03:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611875027] [2024-06-27 22:03:50,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:03:50,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:03:50,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:03:50,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:03:50,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:03:50,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:03:50,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 655 transitions, 11567 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:03:50,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:03:50,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:03:50,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:53,836 INFO L124 PetriNetUnfolderBase]: 8961/14377 cut-off events. [2024-06-27 22:03:53,837 INFO L125 PetriNetUnfolderBase]: For 608633/608636 co-relation queries the response was YES. [2024-06-27 22:03:53,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91284 conditions, 14377 events. 8961/14377 cut-off events. For 608633/608636 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 99438 event pairs, 1921 based on Foata normal form. 6/14098 useless extension candidates. Maximal degree in co-relation 91195. Up to 8719 conditions per place. [2024-06-27 22:03:54,028 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 288 selfloop transitions, 436 changer transitions 0/734 dead transitions. [2024-06-27 22:03:54,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 734 transitions, 13948 flow [2024-06-27 22:03:54,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:03:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:03:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 260 transitions. [2024-06-27 22:03:54,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5895691609977324 [2024-06-27 22:03:54,030 INFO L175 Difference]: Start difference. First operand has 267 places, 655 transitions, 11567 flow. Second operand 9 states and 260 transitions. [2024-06-27 22:03:54,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 734 transitions, 13948 flow [2024-06-27 22:03:55,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 734 transitions, 12812 flow, removed 72 selfloop flow, removed 7 redundant places. [2024-06-27 22:03:55,913 INFO L231 Difference]: Finished difference. Result has 269 places, 655 transitions, 11317 flow [2024-06-27 22:03:55,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10431, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=436, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11317, PETRI_PLACES=269, PETRI_TRANSITIONS=655} [2024-06-27 22:03:55,914 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 214 predicate places. [2024-06-27 22:03:55,914 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 655 transitions, 11317 flow [2024-06-27 22:03:55,914 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:03:55,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:55,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:55,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:03:55,915 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:03:55,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:55,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1176465545, now seen corresponding path program 1 times [2024-06-27 22:03:55,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:55,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341354054] [2024-06-27 22:03:55,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:55,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:03:56,883 INFO 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:03:56,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:03:56,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341354054] [2024-06-27 22:03:56,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341354054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:03:56,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:03:56,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:03:56,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625020480] [2024-06-27 22:03:56,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:03:56,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:03:56,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:03:56,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:03:56,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:03:56,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 22:03:56,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 655 transitions, 11317 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:03:56,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:03:56,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 22:03:56,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:59,356 INFO L124 PetriNetUnfolderBase]: 7733/13050 cut-off events. [2024-06-27 22:03:59,357 INFO L125 PetriNetUnfolderBase]: For 602152/602380 co-relation queries the response was YES. [2024-06-27 22:03:59,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81763 conditions, 13050 events. 7733/13050 cut-off events. For 602152/602380 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 95834 event pairs, 2654 based on Foata normal form. 72/12599 useless extension candidates. Maximal degree in co-relation 81673. Up to 10435 conditions per place. [2024-06-27 22:03:59,536 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 517 selfloop transitions, 26 changer transitions 0/694 dead transitions. [2024-06-27 22:03:59,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 694 transitions, 12859 flow [2024-06-27 22:03:59,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:03:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:03:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-06-27 22:03:59,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247813411078717 [2024-06-27 22:03:59,538 INFO L175 Difference]: Start difference. First operand has 269 places, 655 transitions, 11317 flow. Second operand 7 states and 180 transitions. [2024-06-27 22:03:59,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 694 transitions, 12859 flow [2024-06-27 22:04:01,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 694 transitions, 12112 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-27 22:04:01,256 INFO L231 Difference]: Finished difference. Result has 271 places, 670 transitions, 10982 flow [2024-06-27 22:04:01,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10576, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10982, PETRI_PLACES=271, PETRI_TRANSITIONS=670} [2024-06-27 22:04:01,257 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 216 predicate places. [2024-06-27 22:04:01,257 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 670 transitions, 10982 flow [2024-06-27 22:04:01,257 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:04:01,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:04:01,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:04:01,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 22:04:01,258 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:04:01,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:04:01,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1481254777, now seen corresponding path program 12 times [2024-06-27 22:04:01,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:04:01,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338179439] [2024-06-27 22:04:01,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:04:01,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:04:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:04:02,711 INFO 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:04:02,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:04:02,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338179439] [2024-06-27 22:04:02,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338179439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:04:02,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:04:02,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:04:02,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655890492] [2024-06-27 22:04:02,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:04:02,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:04:02,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:04:02,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:04:02,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:04:02,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:04:02,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 670 transitions, 10982 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:04:02,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:04:02,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:04:02,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:04:06,306 INFO L124 PetriNetUnfolderBase]: 9577/15198 cut-off events. [2024-06-27 22:04:06,306 INFO L125 PetriNetUnfolderBase]: For 635643/635646 co-relation queries the response was YES. [2024-06-27 22:04:06,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93827 conditions, 15198 events. 9577/15198 cut-off events. For 635643/635646 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 105367 event pairs, 1750 based on Foata normal form. 6/14903 useless extension candidates. Maximal degree in co-relation 93734. Up to 9263 conditions per place. [2024-06-27 22:04:06,487 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 322 selfloop transitions, 476 changer transitions 0/808 dead transitions. [2024-06-27 22:04:06,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 808 transitions, 14440 flow [2024-06-27 22:04:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:04:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:04:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 249 transitions. [2024-06-27 22:04:06,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.564625850340136 [2024-06-27 22:04:06,489 INFO L175 Difference]: Start difference. First operand has 271 places, 670 transitions, 10982 flow. Second operand 9 states and 249 transitions. [2024-06-27 22:04:06,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 808 transitions, 14440 flow [2024-06-27 22:04:08,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 808 transitions, 14400 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-27 22:04:08,205 INFO L231 Difference]: Finished difference. Result has 278 places, 724 transitions, 12504 flow [2024-06-27 22:04:08,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10944, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=422, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12504, PETRI_PLACES=278, PETRI_TRANSITIONS=724} [2024-06-27 22:04:08,206 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 223 predicate places. [2024-06-27 22:04:08,206 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 724 transitions, 12504 flow [2024-06-27 22:04:08,206 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:04:08,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:04:08,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:04:08,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 22:04:08,206 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:04:08,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:04:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1481249197, now seen corresponding path program 13 times [2024-06-27 22:04:08,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:04:08,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493709690] [2024-06-27 22:04:08,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:04:08,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:04:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:04:09,584 INFO 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:04:09,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:04:09,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493709690] [2024-06-27 22:04:09,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493709690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:04:09,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:04:09,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:04:09,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678353467] [2024-06-27 22:04:09,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:04:09,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:04:09,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:04:09,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:04:09,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:04:09,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:04:09,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 724 transitions, 12504 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:04:09,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:04:09,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:04:09,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:04:13,069 INFO L124 PetriNetUnfolderBase]: 9561/15176 cut-off events. [2024-06-27 22:04:13,069 INFO L125 PetriNetUnfolderBase]: For 667407/667410 co-relation queries the response was YES. [2024-06-27 22:04:13,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97663 conditions, 15176 events. 9561/15176 cut-off events. For 667407/667410 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 105241 event pairs, 1750 based on Foata normal form. 6/14881 useless extension candidates. Maximal degree in co-relation 97568. Up to 9250 conditions per place. [2024-06-27 22:04:13,285 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 309 selfloop transitions, 486 changer transitions 0/805 dead transitions. [2024-06-27 22:04:13,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 805 transitions, 15156 flow [2024-06-27 22:04:13,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:04:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:04:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 245 transitions. [2024-06-27 22:04:13,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-27 22:04:13,287 INFO L175 Difference]: Start difference. First operand has 278 places, 724 transitions, 12504 flow. Second operand 9 states and 245 transitions. [2024-06-27 22:04:13,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 805 transitions, 15156 flow [2024-06-27 22:04:15,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 805 transitions, 14386 flow, removed 104 selfloop flow, removed 4 redundant places. [2024-06-27 22:04:15,419 INFO L231 Difference]: Finished difference. Result has 283 places, 724 transitions, 12736 flow [2024-06-27 22:04:15,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=11734, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=486, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12736, PETRI_PLACES=283, PETRI_TRANSITIONS=724} [2024-06-27 22:04:15,420 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 228 predicate places. [2024-06-27 22:04:15,420 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 724 transitions, 12736 flow [2024-06-27 22:04:15,420 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:04:15,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:04:15,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:04:15,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 22:04:15,421 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:04:15,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:04:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1337156857, now seen corresponding path program 14 times [2024-06-27 22:04:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:04:15,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797189970] [2024-06-27 22:04:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:04:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:04:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:04:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:04:16,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:04:16,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797189970] [2024-06-27 22:04:16,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797189970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:04:16,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:04:16,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:04:16,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144988111] [2024-06-27 22:04:16,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:04:16,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:04:16,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:04:16,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:04:16,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:04:17,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:04:17,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 724 transitions, 12736 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:04:17,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:04:17,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:04:17,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:04:20,729 INFO L124 PetriNetUnfolderBase]: 9871/15647 cut-off events. [2024-06-27 22:04:20,729 INFO L125 PetriNetUnfolderBase]: For 738159/738162 co-relation queries the response was YES. [2024-06-27 22:04:20,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101783 conditions, 15647 events. 9871/15647 cut-off events. For 738159/738162 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 108968 event pairs, 1913 based on Foata normal form. 8/15369 useless extension candidates. Maximal degree in co-relation 101687. Up to 9518 conditions per place. [2024-06-27 22:04:20,933 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 311 selfloop transitions, 516 changer transitions 0/837 dead transitions. [2024-06-27 22:04:20,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 837 transitions, 16453 flow [2024-06-27 22:04:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:04:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:04:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 247 transitions. [2024-06-27 22:04:20,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5600907029478458 [2024-06-27 22:04:20,935 INFO L175 Difference]: Start difference. First operand has 283 places, 724 transitions, 12736 flow. Second operand 9 states and 247 transitions. [2024-06-27 22:04:20,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 837 transitions, 16453 flow [2024-06-27 22:04:22,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 837 transitions, 15510 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-27 22:04:22,722 INFO L231 Difference]: Finished difference. Result has 286 places, 748 transitions, 13471 flow [2024-06-27 22:04:22,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=11841, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=492, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13471, PETRI_PLACES=286, PETRI_TRANSITIONS=748} [2024-06-27 22:04:22,723 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 231 predicate places. [2024-06-27 22:04:22,723 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 748 transitions, 13471 flow [2024-06-27 22:04:22,723 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:04:22,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:04:22,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:04:22,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 22:04:22,724 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:04:22,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:04:22,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1182818131, now seen corresponding path program 15 times [2024-06-27 22:04:22,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:04:22,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836586151] [2024-06-27 22:04:22,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:04:22,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:04:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:04:24,102 INFO 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:04:24,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:04:24,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836586151] [2024-06-27 22:04:24,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836586151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:04:24,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:04:24,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:04:24,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564760671] [2024-06-27 22:04:24,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:04:24,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:04:24,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:04:24,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:04:24,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:04:24,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:04:24,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 748 transitions, 13471 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:04:24,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:04:24,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:04:24,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:04:28,145 INFO L124 PetriNetUnfolderBase]: 10015/15877 cut-off events. [2024-06-27 22:04:28,145 INFO L125 PetriNetUnfolderBase]: For 767268/767271 co-relation queries the response was YES. [2024-06-27 22:04:28,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104146 conditions, 15877 events. 10015/15877 cut-off events. For 767268/767271 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 110927 event pairs, 1880 based on Foata normal form. 8/15597 useless extension candidates. Maximal degree in co-relation 104049. Up to 9643 conditions per place. [2024-06-27 22:04:28,355 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 349 selfloop transitions, 506 changer transitions 0/865 dead transitions. [2024-06-27 22:04:28,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 865 transitions, 17325 flow [2024-06-27 22:04:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:04:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:04:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 250 transitions. [2024-06-27 22:04:28,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5668934240362812 [2024-06-27 22:04:28,357 INFO L175 Difference]: Start difference. First operand has 286 places, 748 transitions, 13471 flow. Second operand 9 states and 250 transitions. [2024-06-27 22:04:28,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 865 transitions, 17325 flow [2024-06-27 22:04:30,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 865 transitions, 16344 flow, removed 72 selfloop flow, removed 5 redundant places. [2024-06-27 22:04:30,481 INFO L231 Difference]: Finished difference. Result has 290 places, 760 transitions, 13840 flow [2024-06-27 22:04:30,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12526, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=494, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13840, PETRI_PLACES=290, PETRI_TRANSITIONS=760} [2024-06-27 22:04:30,482 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 235 predicate places. [2024-06-27 22:04:30,482 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 760 transitions, 13840 flow [2024-06-27 22:04:30,482 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:04:30,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:04:30,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:04:30,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 22:04:30,483 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:04:30,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:04:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1337364247, now seen corresponding path program 16 times [2024-06-27 22:04:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:04:30,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276904376] [2024-06-27 22:04:30,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:04:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:04:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:04:31,805 INFO 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:04:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:04:31,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276904376] [2024-06-27 22:04:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276904376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:04:31,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:04:31,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:04:31,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484581978] [2024-06-27 22:04:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:04:31,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:04:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:04:31,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:04:31,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:04:31,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:04:31,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 760 transitions, 13840 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:04:31,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:04:31,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:04:31,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:04:35,877 INFO L124 PetriNetUnfolderBase]: 9993/15847 cut-off events. [2024-06-27 22:04:35,877 INFO L125 PetriNetUnfolderBase]: For 775787/775790 co-relation queries the response was YES. [2024-06-27 22:04:35,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103155 conditions, 15847 events. 9993/15847 cut-off events. For 775787/775790 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 110691 event pairs, 1876 based on Foata normal form. 8/15567 useless extension candidates. Maximal degree in co-relation 103057. Up to 9625 conditions per place. [2024-06-27 22:04:36,064 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 335 selfloop transitions, 512 changer transitions 0/857 dead transitions. [2024-06-27 22:04:36,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 857 transitions, 17001 flow [2024-06-27 22:04:36,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:04:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:04:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 247 transitions. [2024-06-27 22:04:36,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5600907029478458 [2024-06-27 22:04:36,065 INFO L175 Difference]: Start difference. First operand has 290 places, 760 transitions, 13840 flow. Second operand 9 states and 247 transitions. [2024-06-27 22:04:36,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 857 transitions, 17001 flow [2024-06-27 22:04:38,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 857 transitions, 15809 flow, removed 160 selfloop flow, removed 5 redundant places. [2024-06-27 22:04:38,189 INFO L231 Difference]: Finished difference. Result has 294 places, 760 transitions, 13702 flow [2024-06-27 22:04:38,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12648, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=512, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13702, PETRI_PLACES=294, PETRI_TRANSITIONS=760} [2024-06-27 22:04:38,190 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 239 predicate places. [2024-06-27 22:04:38,190 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 760 transitions, 13702 flow [2024-06-27 22:04:38,190 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:04:38,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:04:38,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:04:38,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 22:04:38,190 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:04:38,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:04:38,191 INFO L85 PathProgramCache]: Analyzing trace with hash -144070871, now seen corresponding path program 2 times [2024-06-27 22:04:38,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:04:38,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946074726] [2024-06-27 22:04:38,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:04:38,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:04:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:04:39,090 INFO 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:04:39,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:04:39,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946074726] [2024-06-27 22:04:39,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946074726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:04:39,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:04:39,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:04:39,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773561376] [2024-06-27 22:04:39,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:04:39,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:04:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:04:39,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:04:39,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:04:39,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 22:04:39,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 760 transitions, 13702 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:04:39,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:04:39,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 22:04:39,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:04:42,760 INFO L124 PetriNetUnfolderBase]: 8588/14507 cut-off events. [2024-06-27 22:04:42,760 INFO L125 PetriNetUnfolderBase]: For 769920/770181 co-relation queries the response was YES. [2024-06-27 22:04:42,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92330 conditions, 14507 events. 8588/14507 cut-off events. For 769920/770181 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 108316 event pairs, 2719 based on Foata normal form. 38/13866 useless extension candidates. Maximal degree in co-relation 92231. Up to 11562 conditions per place. [2024-06-27 22:04:42,944 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 606 selfloop transitions, 29 changer transitions 0/786 dead transitions. [2024-06-27 22:04:42,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 786 transitions, 15153 flow [2024-06-27 22:04:42,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:04:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:04:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-06-27 22:04:42,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272108843537415 [2024-06-27 22:04:42,946 INFO L175 Difference]: Start difference. First operand has 294 places, 760 transitions, 13702 flow. Second operand 6 states and 155 transitions. [2024-06-27 22:04:42,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 786 transitions, 15153 flow [2024-06-27 22:04:44,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 786 transitions, 14139 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-27 22:04:44,725 INFO L231 Difference]: Finished difference. Result has 294 places, 769 transitions, 12841 flow [2024-06-27 22:04:44,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12688, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12841, PETRI_PLACES=294, PETRI_TRANSITIONS=769} [2024-06-27 22:04:44,727 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 239 predicate places. [2024-06-27 22:04:44,727 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 769 transitions, 12841 flow [2024-06-27 22:04:44,727 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:04:44,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:04:44,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:04:44,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 22:04:44,727 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:04:44,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:04:44,728 INFO L85 PathProgramCache]: Analyzing trace with hash -311696633, now seen corresponding path program 17 times [2024-06-27 22:04:44,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:04:44,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231685659] [2024-06-27 22:04:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:04:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:04:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:04:46,392 INFO 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:04:46,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:04:46,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231685659] [2024-06-27 22:04:46,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231685659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:04:46,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:04:46,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:04:46,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446393060] [2024-06-27 22:04:46,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:04:46,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:04:46,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:04:46,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:04:46,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:04:46,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:04:46,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 769 transitions, 12841 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:04:46,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:04:46,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:04:46,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:04:50,810 INFO L124 PetriNetUnfolderBase]: 10327/16616 cut-off events. [2024-06-27 22:04:50,810 INFO L125 PetriNetUnfolderBase]: For 816117/816117 co-relation queries the response was YES. [2024-06-27 22:04:50,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104108 conditions, 16616 events. 10327/16616 cut-off events. For 816117/816117 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 119206 event pairs, 1901 based on Foata normal form. 8/16286 useless extension candidates. Maximal degree in co-relation 104008. Up to 9925 conditions per place. [2024-06-27 22:04:51,048 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 334 selfloop transitions, 534 changer transitions 0/878 dead transitions. [2024-06-27 22:04:51,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 878 transitions, 16668 flow [2024-06-27 22:04:51,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:04:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:04:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 245 transitions. [2024-06-27 22:04:51,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-27 22:04:51,049 INFO L175 Difference]: Start difference. First operand has 294 places, 769 transitions, 12841 flow. Second operand 9 states and 245 transitions. [2024-06-27 22:04:51,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 878 transitions, 16668 flow [2024-06-27 22:04:53,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 878 transitions, 16615 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-27 22:04:53,361 INFO L231 Difference]: Finished difference. Result has 301 places, 793 transitions, 14470 flow [2024-06-27 22:04:53,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=12788, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=510, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14470, PETRI_PLACES=301, PETRI_TRANSITIONS=793} [2024-06-27 22:04:53,362 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 246 predicate places. [2024-06-27 22:04:53,362 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 793 transitions, 14470 flow [2024-06-27 22:04:53,363 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:04:53,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:04:53,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:04:53,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 22:04:53,363 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:04:53,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:04:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1108312671, now seen corresponding path program 18 times [2024-06-27 22:04:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:04:53,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941275849] [2024-06-27 22:04:53,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:04:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:04:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:04:54,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:04:54,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:04:54,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941275849] [2024-06-27 22:04:54,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941275849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:04:54,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:04:54,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:04:54,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963894575] [2024-06-27 22:04:54,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:04:54,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:04:54,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:04:54,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:04:54,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:04:54,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:04:54,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 793 transitions, 14470 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:04:54,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:04:54,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:04:54,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:04:59,524 INFO L124 PetriNetUnfolderBase]: 10471/16825 cut-off events. [2024-06-27 22:04:59,525 INFO L125 PetriNetUnfolderBase]: For 883193/883193 co-relation queries the response was YES. [2024-06-27 22:04:59,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110768 conditions, 16825 events. 10471/16825 cut-off events. For 883193/883193 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 120695 event pairs, 1797 based on Foata normal form. 8/16497 useless extension candidates. Maximal degree in co-relation 110667. Up to 10050 conditions per place. [2024-06-27 22:04:59,741 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 327 selfloop transitions, 548 changer transitions 0/885 dead transitions. [2024-06-27 22:04:59,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 885 transitions, 17946 flow [2024-06-27 22:04:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:04:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:04:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 244 transitions. [2024-06-27 22:04:59,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5532879818594104 [2024-06-27 22:04:59,743 INFO L175 Difference]: Start difference. First operand has 301 places, 793 transitions, 14470 flow. Second operand 9 states and 244 transitions. [2024-06-27 22:04:59,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 885 transitions, 17946 flow [2024-06-27 22:05:02,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 885 transitions, 16619 flow, removed 116 selfloop flow, removed 6 redundant places. [2024-06-27 22:05:02,456 INFO L231 Difference]: Finished difference. Result has 304 places, 805 transitions, 14581 flow [2024-06-27 22:05:02,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=13203, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=536, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14581, PETRI_PLACES=304, PETRI_TRANSITIONS=805} [2024-06-27 22:05:02,458 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 249 predicate places. [2024-06-27 22:05:02,458 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 805 transitions, 14581 flow [2024-06-27 22:05:02,458 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:05:02,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:05:02,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:05:02,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 22:05:02,459 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:05:02,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:05:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash -285144953, now seen corresponding path program 19 times [2024-06-27 22:05:02,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:05:02,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691076638] [2024-06-27 22:05:02,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:05:02,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:05:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:05:04,126 INFO 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:05:04,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:05:04,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691076638] [2024-06-27 22:05:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691076638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:05:04,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:05:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:05:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819192014] [2024-06-27 22:05:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:05:04,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:05:04,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:05:04,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:05:04,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:05:04,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 22:05:04,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 805 transitions, 14581 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:05:04,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:05:04,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 22:05:04,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:05:08,640 INFO L124 PetriNetUnfolderBase]: 10449/16786 cut-off events. [2024-06-27 22:05:08,640 INFO L125 PetriNetUnfolderBase]: For 875401/875401 co-relation queries the response was YES. [2024-06-27 22:05:08,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108651 conditions, 16786 events. 10449/16786 cut-off events. For 875401/875401 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 120369 event pairs, 1786 based on Foata normal form. 8/16458 useless extension candidates. Maximal degree in co-relation 108550. Up to 10032 conditions per place. [2024-06-27 22:05:08,892 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 311 selfloop transitions, 556 changer transitions 0/877 dead transitions. [2024-06-27 22:05:08,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 877 transitions, 17338 flow [2024-06-27 22:05:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:05:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:05:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2024-06-27 22:05:08,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546485260770975 [2024-06-27 22:05:08,894 INFO L175 Difference]: Start difference. First operand has 304 places, 805 transitions, 14581 flow. Second operand 9 states and 241 transitions. [2024-06-27 22:05:08,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 877 transitions, 17338 flow