./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/mix000.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/mix000.oepc.i ./goblint.2024-05-07_14-17-48.files/protection/mix000.oepc.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-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:58:47,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:58:47,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:58:47,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:58:47,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:58:47,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:58:47,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:58:47,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:58:47,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:58:47,600 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:58:47,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:58:47,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:58:47,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:58:47,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:58:47,603 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:58:47,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:58:47,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:58:47,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:58:47,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:58:47,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:58:47,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:58:47,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:58:47,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:58:47,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:58:47,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:58:47,609 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:58:47,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:58:47,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:58:47,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:58:47,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:58:47,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:58:47,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:58:47,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:58:47,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:58:47,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:58:47,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:58:47,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:58:47,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:58:47,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:58:47,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:58:47,612 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:58:47,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:58:47,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:58:47,612 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-05-12 12:58:47,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:58:47,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:58:47,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:58:47,816 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:58:47,818 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:58:47,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/mix000.oepc.yml/witness.yml [2024-05-12 12:58:47,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:58:47,917 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:58:47,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2024-05-12 12:58:48,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:58:49,056 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:58:49,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2024-05-12 12:58:49,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/640db8a2e/e40921c7cd7647d9b784968b1e0e40ce/FLAGa7126b979 [2024-05-12 12:58:49,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/640db8a2e/e40921c7cd7647d9b784968b1e0e40ce [2024-05-12 12:58:49,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:58:49,089 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:58:49,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:58:49,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:58:49,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:58:49,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:58:47" (1/2) ... [2024-05-12 12:58:49,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140c9dc8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:49, skipping insertion in model container [2024-05-12 12:58:49,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:58:47" (1/2) ... [2024-05-12 12:58:49,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1c472d4f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:58:49, skipping insertion in model container [2024-05-12 12:58:49,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:58:49" (2/2) ... [2024-05-12 12:58:49,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140c9dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49, skipping insertion in model container [2024-05-12 12:58:49,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:58:49" (2/2) ... [2024-05-12 12:58:49,100 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:58:49,169 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:58:49,174 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) [2024-05-12 12:58:49,174 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] ((((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) [2024-05-12 12:58:49,174 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:58:49,175 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-05-12 12:58:49,245 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:58:49,366 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i[988,1001] [2024-05-12 12:58:49,518 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:58:49,525 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 12:58:49,567 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i[988,1001] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:58:49,623 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:58:49,661 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:58:49,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49 WrapperNode [2024-05-12 12:58:49,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:58:49,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:58:49,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:58:49,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:58:49,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (1/1) ... [2024-05-12 12:58:49,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (1/1) ... [2024-05-12 12:58:49,715 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2024-05-12 12:58:49,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:58:49,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:58:49,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:58:49,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:58:49,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (1/1) ... [2024-05-12 12:58:49,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (1/1) ... [2024-05-12 12:58:49,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (1/1) ... [2024-05-12 12:58:49,745 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 12:58:49,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (1/1) ... [2024-05-12 12:58:49,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (1/1) ... [2024-05-12 12:58:49,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (1/1) ... [2024-05-12 12:58:49,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (1/1) ... [2024-05-12 12:58:49,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (1/1) ... [2024-05-12 12:58:49,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (1/1) ... [2024-05-12 12:58:49,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:58:49,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:58:49,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:58:49,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:58:49,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (1/1) ... [2024-05-12 12:58:49,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:58:49,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:58:49,780 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-05-12 12:58:49,804 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-05-12 12:58:49,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:58:49,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:58:49,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:58:49,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:58:49,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:58:49,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:58:49,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:58:49,815 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 12:58:49,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 12:58:49,816 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 12:58:49,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 12:58:49,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:58:49,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:58:49,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:58:49,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:58:49,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:58:49,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:58:49,818 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 12:58:49,950 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:58:49,952 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:58:50,228 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:58:50,229 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:58:50,393 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:58:50,393 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 12:58:50,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:58:50 BoogieIcfgContainer [2024-05-12 12:58:50,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:58:50,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:58:50,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:58:50,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:58:50,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:58:47" (1/4) ... [2024-05-12 12:58:50,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64deeea4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:58:50, skipping insertion in model container [2024-05-12 12:58:50,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:58:49" (2/4) ... [2024-05-12 12:58:50,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64deeea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:58:50, skipping insertion in model container [2024-05-12 12:58:50,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:58:49" (3/4) ... [2024-05-12 12:58:50,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64deeea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:58:50, skipping insertion in model container [2024-05-12 12:58:50,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:58:50" (4/4) ... [2024-05-12 12:58:50,406 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2024-05-12 12:58:50,420 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:58:50,420 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 12:58:50,421 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:58:50,455 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 12:58:50,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 84 flow [2024-05-12 12:58:50,511 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-05-12 12:58:50,511 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:58:50,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-05-12 12:58:50,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 38 transitions, 84 flow [2024-05-12 12:58:50,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 36 transitions, 78 flow [2024-05-12 12:58:50,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:58:50,540 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;@42035580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:58:50,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 12:58:50,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:58:50,546 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 12:58:50,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:58:50,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:50,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:58:50,548 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:58:50,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:50,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1965846389, now seen corresponding path program 1 times [2024-05-12 12:58:50,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:50,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810781844] [2024-05-12 12:58:50,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:50,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:51,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:51,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810781844] [2024-05-12 12:58:51,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810781844] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:51,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:51,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:58:51,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429425798] [2024-05-12 12:58:51,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:51,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:58:51,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:51,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:58:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:58:51,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-05-12 12:58:51,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:51,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:51,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-05-12 12:58:51,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:51,843 INFO L124 PetriNetUnfolderBase]: 475/845 cut-off events. [2024-05-12 12:58:51,843 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-05-12 12:58:51,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 845 events. 475/845 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4340 event pairs, 182 based on Foata normal form. 43/828 useless extension candidates. Maximal degree in co-relation 1649. Up to 787 conditions per place. [2024-05-12 12:58:51,853 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 32 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-05-12 12:58:51,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 173 flow [2024-05-12 12:58:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:58:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:58:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-05-12 12:58:51,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-05-12 12:58:51,866 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 78 flow. Second operand 3 states and 76 transitions. [2024-05-12 12:58:51,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 173 flow [2024-05-12 12:58:51,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:58:51,873 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 102 flow [2024-05-12 12:58:51,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-05-12 12:58:51,878 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2024-05-12 12:58:51,878 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 102 flow [2024-05-12 12:58:51,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:51,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:51,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:58:51,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:58:51,879 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:58:51,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:51,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1965845573, now seen corresponding path program 1 times [2024-05-12 12:58:51,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:51,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462177072] [2024-05-12 12:58:51,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:51,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:51,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:51,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462177072] [2024-05-12 12:58:51,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462177072] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:51,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:51,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:58:51,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84320201] [2024-05-12 12:58:51,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:51,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:58:51,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:51,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:58:51,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:58:51,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-05-12 12:58:51,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:51,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:51,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-05-12 12:58:51,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:52,082 INFO L124 PetriNetUnfolderBase]: 219/527 cut-off events. [2024-05-12 12:58:52,082 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-05-12 12:58:52,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 527 events. 219/527 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2986 event pairs, 130 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 969. Up to 340 conditions per place. [2024-05-12 12:58:52,085 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 26 selfloop transitions, 3 changer transitions 2/47 dead transitions. [2024-05-12 12:58:52,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 179 flow [2024-05-12 12:58:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:58:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:58:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-05-12 12:58:52,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7192982456140351 [2024-05-12 12:58:52,089 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 102 flow. Second operand 3 states and 82 transitions. [2024-05-12 12:58:52,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 179 flow [2024-05-12 12:58:52,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:58:52,092 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 94 flow [2024-05-12 12:58:52,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2024-05-12 12:58:52,095 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2024-05-12 12:58:52,095 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 94 flow [2024-05-12 12:58:52,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:52,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:52,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:52,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:58:52,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:58:52,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash 607250057, now seen corresponding path program 1 times [2024-05-12 12:58:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033898486] [2024-05-12 12:58:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:52,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:52,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033898486] [2024-05-12 12:58:52,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033898486] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:52,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:52,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:58:52,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385476792] [2024-05-12 12:58:52,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:52,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:58:52,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:52,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:58:52,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:58:52,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-05-12 12:58:52,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:52,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:52,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-05-12 12:58:52,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:52,871 INFO L124 PetriNetUnfolderBase]: 342/724 cut-off events. [2024-05-12 12:58:52,871 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-05-12 12:58:52,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 724 events. 342/724 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3855 event pairs, 160 based on Foata normal form. 2/691 useless extension candidates. Maximal degree in co-relation 1461. Up to 562 conditions per place. [2024-05-12 12:58:52,875 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 36 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2024-05-12 12:58:52,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 224 flow [2024-05-12 12:58:52,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:58:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:58:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-05-12 12:58:52,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5921052631578947 [2024-05-12 12:58:52,878 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 94 flow. Second operand 4 states and 90 transitions. [2024-05-12 12:58:52,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 224 flow [2024-05-12 12:58:52,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:58:52,881 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 137 flow [2024-05-12 12:58:52,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-05-12 12:58:52,882 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-05-12 12:58:52,882 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 137 flow [2024-05-12 12:58:52,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:52,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:52,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:52,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:58:52,883 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:58:52,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:52,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1644883288, now seen corresponding path program 1 times [2024-05-12 12:58:52,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:52,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521807236] [2024-05-12 12:58:52,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:52,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:53,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:53,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521807236] [2024-05-12 12:58:53,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521807236] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:53,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:53,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:58:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038019025] [2024-05-12 12:58:53,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:53,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:58:53,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:53,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:58:53,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:58:53,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-05-12 12:58:53,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:53,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:53,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-05-12 12:58:53,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:54,033 INFO L124 PetriNetUnfolderBase]: 342/731 cut-off events. [2024-05-12 12:58:54,034 INFO L125 PetriNetUnfolderBase]: For 289/289 co-relation queries the response was YES. [2024-05-12 12:58:54,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 731 events. 342/731 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3908 event pairs, 180 based on Foata normal form. 2/704 useless extension candidates. Maximal degree in co-relation 1609. Up to 547 conditions per place. [2024-05-12 12:58:54,038 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 43 selfloop transitions, 8 changer transitions 0/61 dead transitions. [2024-05-12 12:58:54,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 295 flow [2024-05-12 12:58:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:58:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:58:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-05-12 12:58:54,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5842105263157895 [2024-05-12 12:58:54,041 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 137 flow. Second operand 5 states and 111 transitions. [2024-05-12 12:58:54,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 295 flow [2024-05-12 12:58:54,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 288 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 12:58:54,044 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 165 flow [2024-05-12 12:58:54,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-05-12 12:58:54,046 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2024-05-12 12:58:54,046 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 165 flow [2024-05-12 12:58:54,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:54,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:54,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:54,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:58:54,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:58:54,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:54,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1040799723, now seen corresponding path program 1 times [2024-05-12 12:58:54,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:54,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574229808] [2024-05-12 12:58:54,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:54,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:55,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:55,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574229808] [2024-05-12 12:58:55,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574229808] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:55,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:55,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:58:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955450650] [2024-05-12 12:58:55,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:55,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:58:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:55,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:58:55,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:58:55,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-05-12 12:58:55,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 165 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:55,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:55,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-05-12 12:58:55,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:55,791 INFO L124 PetriNetUnfolderBase]: 406/839 cut-off events. [2024-05-12 12:58:55,791 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2024-05-12 12:58:55,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 839 events. 406/839 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4472 event pairs, 105 based on Foata normal form. 2/803 useless extension candidates. Maximal degree in co-relation 1984. Up to 621 conditions per place. [2024-05-12 12:58:55,795 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 58 selfloop transitions, 12 changer transitions 0/79 dead transitions. [2024-05-12 12:58:55,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 410 flow [2024-05-12 12:58:55,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:58:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:58:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2024-05-12 12:58:55,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2024-05-12 12:58:55,797 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 165 flow. Second operand 7 states and 147 transitions. [2024-05-12 12:58:55,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 410 flow [2024-05-12 12:58:55,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 388 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 12:58:55,799 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 204 flow [2024-05-12 12:58:55,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=204, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-05-12 12:58:55,800 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-05-12 12:58:55,800 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 204 flow [2024-05-12 12:58:55,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:55,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:55,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:55,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:58:55,801 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:58:55,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:55,802 INFO L85 PathProgramCache]: Analyzing trace with hash -32333587, now seen corresponding path program 1 times [2024-05-12 12:58:55,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:55,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745110383] [2024-05-12 12:58:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:55,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:56,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:56,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745110383] [2024-05-12 12:58:56,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745110383] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:56,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:56,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:58:56,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964465611] [2024-05-12 12:58:56,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:56,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:58:56,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:56,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:58:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:58:56,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:58:56,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:56,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:56,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:58:56,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:56,586 INFO L124 PetriNetUnfolderBase]: 559/1101 cut-off events. [2024-05-12 12:58:56,587 INFO L125 PetriNetUnfolderBase]: For 997/997 co-relation queries the response was YES. [2024-05-12 12:58:56,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 1101 events. 559/1101 cut-off events. For 997/997 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5932 event pairs, 170 based on Foata normal form. 1/1060 useless extension candidates. Maximal degree in co-relation 2773. Up to 908 conditions per place. [2024-05-12 12:58:56,592 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 45 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2024-05-12 12:58:56,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 344 flow [2024-05-12 12:58:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:58:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:58:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-05-12 12:58:56,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46842105263157896 [2024-05-12 12:58:56,593 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 204 flow. Second operand 5 states and 89 transitions. [2024-05-12 12:58:56,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 344 flow [2024-05-12 12:58:56,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 319 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-05-12 12:58:56,596 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 211 flow [2024-05-12 12:58:56,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-05-12 12:58:56,597 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2024-05-12 12:58:56,597 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 211 flow [2024-05-12 12:58:56,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:56,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:56,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:56,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:58:56,597 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:58:56,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:56,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2094946157, now seen corresponding path program 1 times [2024-05-12 12:58:56,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:56,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259859086] [2024-05-12 12:58:56,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:56,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:57,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:57,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259859086] [2024-05-12 12:58:57,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259859086] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:57,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:57,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:58:57,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199351297] [2024-05-12 12:58:57,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:57,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:58:57,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:57,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:58:57,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:58:57,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-05-12 12:58:57,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 211 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:57,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:57,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-05-12 12:58:57,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:58,243 INFO L124 PetriNetUnfolderBase]: 427/868 cut-off events. [2024-05-12 12:58:58,243 INFO L125 PetriNetUnfolderBase]: For 1141/1141 co-relation queries the response was YES. [2024-05-12 12:58:58,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 868 events. 427/868 cut-off events. For 1141/1141 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4627 event pairs, 72 based on Foata normal form. 4/835 useless extension candidates. Maximal degree in co-relation 2296. Up to 618 conditions per place. [2024-05-12 12:58:58,248 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 63 selfloop transitions, 13 changer transitions 0/86 dead transitions. [2024-05-12 12:58:58,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 459 flow [2024-05-12 12:58:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:58:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:58:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-05-12 12:58:58,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5361842105263158 [2024-05-12 12:58:58,249 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 211 flow. Second operand 8 states and 163 transitions. [2024-05-12 12:58:58,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 459 flow [2024-05-12 12:58:58,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 445 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-05-12 12:58:58,252 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 229 flow [2024-05-12 12:58:58,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-05-12 12:58:58,253 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2024-05-12 12:58:58,253 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 229 flow [2024-05-12 12:58:58,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:58,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:58,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:58,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:58:58,254 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:58:58,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:58,254 INFO L85 PathProgramCache]: Analyzing trace with hash -963909705, now seen corresponding path program 1 times [2024-05-12 12:58:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:58,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827513832] [2024-05-12 12:58:58,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:58,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:58,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827513832] [2024-05-12 12:58:58,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827513832] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:58,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:58,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:58:58,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492497442] [2024-05-12 12:58:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:58,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:58:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:58,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:58:58,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:58:58,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:58:58,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 229 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:58,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:58,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:58:58,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:58:59,131 INFO L124 PetriNetUnfolderBase]: 553/1065 cut-off events. [2024-05-12 12:58:59,132 INFO L125 PetriNetUnfolderBase]: For 1535/1535 co-relation queries the response was YES. [2024-05-12 12:58:59,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 1065 events. 553/1065 cut-off events. For 1535/1535 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5655 event pairs, 159 based on Foata normal form. 3/1032 useless extension candidates. Maximal degree in co-relation 2903. Up to 866 conditions per place. [2024-05-12 12:58:59,136 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 52 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2024-05-12 12:58:59,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 69 transitions, 405 flow [2024-05-12 12:58:59,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:58:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:58:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-05-12 12:58:59,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649122807017544 [2024-05-12 12:58:59,137 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 229 flow. Second operand 6 states and 106 transitions. [2024-05-12 12:58:59,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 69 transitions, 405 flow [2024-05-12 12:58:59,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 373 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 12:58:59,140 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 234 flow [2024-05-12 12:58:59,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-05-12 12:58:59,141 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2024-05-12 12:58:59,141 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 234 flow [2024-05-12 12:58:59,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:59,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:59,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:59,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:58:59,141 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:58:59,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:59,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1015369429, now seen corresponding path program 1 times [2024-05-12 12:58:59,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:59,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347506263] [2024-05-12 12:58:59,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:59,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:59,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:59,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347506263] [2024-05-12 12:58:59,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347506263] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:58:59,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:58:59,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:58:59,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760479768] [2024-05-12 12:58:59,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:58:59,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:58:59,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:59,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:58:59,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:58:59,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:58:59,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:59,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:59,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:58:59,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:00,015 INFO L124 PetriNetUnfolderBase]: 589/1144 cut-off events. [2024-05-12 12:59:00,016 INFO L125 PetriNetUnfolderBase]: For 1812/1812 co-relation queries the response was YES. [2024-05-12 12:59:00,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3168 conditions, 1144 events. 589/1144 cut-off events. For 1812/1812 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6159 event pairs, 305 based on Foata normal form. 1/1107 useless extension candidates. Maximal degree in co-relation 3142. Up to 929 conditions per place. [2024-05-12 12:59:00,022 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 56 selfloop transitions, 15 changer transitions 0/78 dead transitions. [2024-05-12 12:59:00,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 488 flow [2024-05-12 12:59:00,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:59:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:59:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-05-12 12:59:00,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4398496240601504 [2024-05-12 12:59:00,023 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 234 flow. Second operand 7 states and 117 transitions. [2024-05-12 12:59:00,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 488 flow [2024-05-12 12:59:00,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 462 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 12:59:00,028 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 330 flow [2024-05-12 12:59:00,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2024-05-12 12:59:00,029 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2024-05-12 12:59:00,029 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 330 flow [2024-05-12 12:59:00,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:00,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:00,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:00,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:59:00,030 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:00,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash -822568059, now seen corresponding path program 2 times [2024-05-12 12:59:00,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:00,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963948348] [2024-05-12 12:59:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:00,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:00,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963948348] [2024-05-12 12:59:00,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963948348] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:00,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:00,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:59:00,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321708284] [2024-05-12 12:59:00,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:00,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:59:00,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:00,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:59:00,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:59:00,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:00,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 330 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:00,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:00,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:00,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:00,873 INFO L124 PetriNetUnfolderBase]: 618/1208 cut-off events. [2024-05-12 12:59:00,874 INFO L125 PetriNetUnfolderBase]: For 2439/2439 co-relation queries the response was YES. [2024-05-12 12:59:00,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3619 conditions, 1208 events. 618/1208 cut-off events. For 2439/2439 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6638 event pairs, 272 based on Foata normal form. 1/1167 useless extension candidates. Maximal degree in co-relation 3589. Up to 946 conditions per place. [2024-05-12 12:59:00,880 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 66 selfloop transitions, 29 changer transitions 0/102 dead transitions. [2024-05-12 12:59:00,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 102 transitions, 731 flow [2024-05-12 12:59:00,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:59:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:59:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-05-12 12:59:00,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-05-12 12:59:00,881 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 330 flow. Second operand 7 states and 126 transitions. [2024-05-12 12:59:00,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 102 transitions, 731 flow [2024-05-12 12:59:00,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 713 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-05-12 12:59:00,886 INFO L231 Difference]: Finished difference. Result has 73 places, 80 transitions, 553 flow [2024-05-12 12:59:00,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=553, PETRI_PLACES=73, PETRI_TRANSITIONS=80} [2024-05-12 12:59:00,886 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2024-05-12 12:59:00,886 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 80 transitions, 553 flow [2024-05-12 12:59:00,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:00,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:00,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:00,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:59:00,887 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:00,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash 222885581, now seen corresponding path program 3 times [2024-05-12 12:59:00,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:00,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678521838] [2024-05-12 12:59:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:00,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:01,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:01,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678521838] [2024-05-12 12:59:01,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678521838] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:01,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:01,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:59:01,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528756570] [2024-05-12 12:59:01,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:01,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:59:01,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:01,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:59:01,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:59:01,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:01,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 80 transitions, 553 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:01,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:01,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:01,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:01,763 INFO L124 PetriNetUnfolderBase]: 616/1209 cut-off events. [2024-05-12 12:59:01,763 INFO L125 PetriNetUnfolderBase]: For 3359/3359 co-relation queries the response was YES. [2024-05-12 12:59:01,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 1209 events. 616/1209 cut-off events. For 3359/3359 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6669 event pairs, 300 based on Foata normal form. 1/1167 useless extension candidates. Maximal degree in co-relation 3970. Up to 992 conditions per place. [2024-05-12 12:59:01,769 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 72 selfloop transitions, 15 changer transitions 0/94 dead transitions. [2024-05-12 12:59:01,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 94 transitions, 778 flow [2024-05-12 12:59:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:59:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:59:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-05-12 12:59:01,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2024-05-12 12:59:01,771 INFO L175 Difference]: Start difference. First operand has 73 places, 80 transitions, 553 flow. Second operand 6 states and 102 transitions. [2024-05-12 12:59:01,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 94 transitions, 778 flow [2024-05-12 12:59:01,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 94 transitions, 749 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-05-12 12:59:01,775 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 567 flow [2024-05-12 12:59:01,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=567, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2024-05-12 12:59:01,776 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2024-05-12 12:59:01,776 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 567 flow [2024-05-12 12:59:01,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:01,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:01,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:01,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:59:01,777 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:01,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:01,777 INFO L85 PathProgramCache]: Analyzing trace with hash 763100590, now seen corresponding path program 1 times [2024-05-12 12:59:01,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:01,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427406465] [2024-05-12 12:59:01,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:01,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:02,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427406465] [2024-05-12 12:59:02,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427406465] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:02,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:02,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:59:02,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311928] [2024-05-12 12:59:02,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:02,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:59:02,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:02,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:59:02,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:59:02,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:02,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 567 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:02,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:02,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:02,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:02,747 INFO L124 PetriNetUnfolderBase]: 652/1333 cut-off events. [2024-05-12 12:59:02,747 INFO L125 PetriNetUnfolderBase]: For 3847/3847 co-relation queries the response was YES. [2024-05-12 12:59:02,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4352 conditions, 1333 events. 652/1333 cut-off events. For 3847/3847 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7697 event pairs, 258 based on Foata normal form. 1/1276 useless extension candidates. Maximal degree in co-relation 4315. Up to 945 conditions per place. [2024-05-12 12:59:02,755 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 90 selfloop transitions, 37 changer transitions 0/134 dead transitions. [2024-05-12 12:59:02,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 134 transitions, 1132 flow [2024-05-12 12:59:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-05-12 12:59:02,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48026315789473684 [2024-05-12 12:59:02,756 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 567 flow. Second operand 8 states and 146 transitions. [2024-05-12 12:59:02,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 134 transitions, 1132 flow [2024-05-12 12:59:02,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 134 transitions, 1101 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 12:59:02,763 INFO L231 Difference]: Finished difference. Result has 85 places, 102 transitions, 855 flow [2024-05-12 12:59:02,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=855, PETRI_PLACES=85, PETRI_TRANSITIONS=102} [2024-05-12 12:59:02,764 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2024-05-12 12:59:02,764 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 102 transitions, 855 flow [2024-05-12 12:59:02,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:02,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:02,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:02,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 12:59:02,765 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:02,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:02,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1295554244, now seen corresponding path program 2 times [2024-05-12 12:59:02,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:02,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42445490] [2024-05-12 12:59:02,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:02,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:03,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-05-12 12:59:03,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:03,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42445490] [2024-05-12 12:59:03,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42445490] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:03,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:03,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:59:03,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128220009] [2024-05-12 12:59:03,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:03,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:59:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:03,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:59:03,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:59:03,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:03,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 102 transitions, 855 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:03,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:03,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:03,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:03,837 INFO L124 PetriNetUnfolderBase]: 725/1425 cut-off events. [2024-05-12 12:59:03,837 INFO L125 PetriNetUnfolderBase]: For 5552/5552 co-relation queries the response was YES. [2024-05-12 12:59:03,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5375 conditions, 1425 events. 725/1425 cut-off events. For 5552/5552 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8317 event pairs, 280 based on Foata normal form. 1/1374 useless extension candidates. Maximal degree in co-relation 5334. Up to 1043 conditions per place. [2024-05-12 12:59:03,847 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 85 selfloop transitions, 56 changer transitions 0/148 dead transitions. [2024-05-12 12:59:03,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 148 transitions, 1426 flow [2024-05-12 12:59:03,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-05-12 12:59:03,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-05-12 12:59:03,848 INFO L175 Difference]: Start difference. First operand has 85 places, 102 transitions, 855 flow. Second operand 8 states and 144 transitions. [2024-05-12 12:59:03,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 148 transitions, 1426 flow [2024-05-12 12:59:03,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 148 transitions, 1371 flow, removed 23 selfloop flow, removed 2 redundant places. [2024-05-12 12:59:03,897 INFO L231 Difference]: Finished difference. Result has 92 places, 121 transitions, 1134 flow [2024-05-12 12:59:03,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1134, PETRI_PLACES=92, PETRI_TRANSITIONS=121} [2024-05-12 12:59:03,898 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2024-05-12 12:59:03,898 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 121 transitions, 1134 flow [2024-05-12 12:59:03,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:03,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:03,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:03,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 12:59:03,898 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:03,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1335402884, now seen corresponding path program 3 times [2024-05-12 12:59:03,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:03,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188970040] [2024-05-12 12:59:03,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:03,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:04,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:04,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188970040] [2024-05-12 12:59:04,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188970040] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:04,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:04,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:59:04,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889470663] [2024-05-12 12:59:04,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:04,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:59:04,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:04,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:59:04,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:59:04,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:04,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 121 transitions, 1134 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:04,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:04,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:04,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:05,102 INFO L124 PetriNetUnfolderBase]: 733/1450 cut-off events. [2024-05-12 12:59:05,102 INFO L125 PetriNetUnfolderBase]: For 6642/6642 co-relation queries the response was YES. [2024-05-12 12:59:05,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5787 conditions, 1450 events. 733/1450 cut-off events. For 6642/6642 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8563 event pairs, 278 based on Foata normal form. 1/1395 useless extension candidates. Maximal degree in co-relation 5743. Up to 1110 conditions per place. [2024-05-12 12:59:05,113 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 98 selfloop transitions, 45 changer transitions 0/150 dead transitions. [2024-05-12 12:59:05,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 150 transitions, 1559 flow [2024-05-12 12:59:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-05-12 12:59:05,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46381578947368424 [2024-05-12 12:59:05,115 INFO L175 Difference]: Start difference. First operand has 92 places, 121 transitions, 1134 flow. Second operand 8 states and 141 transitions. [2024-05-12 12:59:05,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 150 transitions, 1559 flow [2024-05-12 12:59:05,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 150 transitions, 1480 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-05-12 12:59:05,126 INFO L231 Difference]: Finished difference. Result has 96 places, 125 transitions, 1209 flow [2024-05-12 12:59:05,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1209, PETRI_PLACES=96, PETRI_TRANSITIONS=125} [2024-05-12 12:59:05,127 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-05-12 12:59:05,127 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 125 transitions, 1209 flow [2024-05-12 12:59:05,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:05,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:05,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:05,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 12:59:05,128 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:05,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash 268926529, now seen corresponding path program 1 times [2024-05-12 12:59:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:05,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982617280] [2024-05-12 12:59:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:05,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:05,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:05,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982617280] [2024-05-12 12:59:05,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982617280] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:05,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:05,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:59:05,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404551262] [2024-05-12 12:59:05,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:05,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:59:05,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:05,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:59:05,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:59:05,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:05,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 125 transitions, 1209 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:05,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:05,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:05,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:06,227 INFO L124 PetriNetUnfolderBase]: 787/1557 cut-off events. [2024-05-12 12:59:06,228 INFO L125 PetriNetUnfolderBase]: For 7535/7535 co-relation queries the response was YES. [2024-05-12 12:59:06,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6234 conditions, 1557 events. 787/1557 cut-off events. For 7535/7535 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9344 event pairs, 285 based on Foata normal form. 3/1497 useless extension candidates. Maximal degree in co-relation 6188. Up to 1128 conditions per place. [2024-05-12 12:59:06,245 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 117 selfloop transitions, 43 changer transitions 0/167 dead transitions. [2024-05-12 12:59:06,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 167 transitions, 1734 flow [2024-05-12 12:59:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-05-12 12:59:06,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4901315789473684 [2024-05-12 12:59:06,246 INFO L175 Difference]: Start difference. First operand has 96 places, 125 transitions, 1209 flow. Second operand 8 states and 149 transitions. [2024-05-12 12:59:06,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 167 transitions, 1734 flow [2024-05-12 12:59:06,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 167 transitions, 1648 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-05-12 12:59:06,262 INFO L231 Difference]: Finished difference. Result has 100 places, 136 transitions, 1323 flow [2024-05-12 12:59:06,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1323, PETRI_PLACES=100, PETRI_TRANSITIONS=136} [2024-05-12 12:59:06,263 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2024-05-12 12:59:06,263 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 136 transitions, 1323 flow [2024-05-12 12:59:06,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:06,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:06,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:06,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 12:59:06,264 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:06,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1411685922, now seen corresponding path program 4 times [2024-05-12 12:59:06,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:06,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507709901] [2024-05-12 12:59:06,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:07,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:07,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507709901] [2024-05-12 12:59:07,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507709901] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:07,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:07,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:59:07,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090620421] [2024-05-12 12:59:07,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:07,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:59:07,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:07,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:59:07,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:59:07,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:07,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 136 transitions, 1323 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:07,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:07,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:07,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:07,450 INFO L124 PetriNetUnfolderBase]: 811/1617 cut-off events. [2024-05-12 12:59:07,450 INFO L125 PetriNetUnfolderBase]: For 9059/9059 co-relation queries the response was YES. [2024-05-12 12:59:07,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6955 conditions, 1617 events. 811/1617 cut-off events. For 9059/9059 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9712 event pairs, 254 based on Foata normal form. 1/1550 useless extension candidates. Maximal degree in co-relation 6906. Up to 1093 conditions per place. [2024-05-12 12:59:07,465 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 81 selfloop transitions, 81 changer transitions 0/169 dead transitions. [2024-05-12 12:59:07,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 169 transitions, 1861 flow [2024-05-12 12:59:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:59:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:59:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-05-12 12:59:07,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849624060150376 [2024-05-12 12:59:07,467 INFO L175 Difference]: Start difference. First operand has 100 places, 136 transitions, 1323 flow. Second operand 7 states and 129 transitions. [2024-05-12 12:59:07,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 169 transitions, 1861 flow [2024-05-12 12:59:07,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 169 transitions, 1829 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-05-12 12:59:07,489 INFO L231 Difference]: Finished difference. Result has 105 places, 144 transitions, 1555 flow [2024-05-12 12:59:07,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1555, PETRI_PLACES=105, PETRI_TRANSITIONS=144} [2024-05-12 12:59:07,490 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2024-05-12 12:59:07,491 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 144 transitions, 1555 flow [2024-05-12 12:59:07,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:07,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:07,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:07,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 12:59:07,491 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:07,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1938076746, now seen corresponding path program 5 times [2024-05-12 12:59:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:07,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504145556] [2024-05-12 12:59:07,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:08,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:08,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504145556] [2024-05-12 12:59:08,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504145556] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:08,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:08,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:59:08,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29064261] [2024-05-12 12:59:08,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:08,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:59:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:59:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:59:08,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:08,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 144 transitions, 1555 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:08,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:08,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:08,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:08,713 INFO L124 PetriNetUnfolderBase]: 842/1665 cut-off events. [2024-05-12 12:59:08,713 INFO L125 PetriNetUnfolderBase]: For 10884/10884 co-relation queries the response was YES. [2024-05-12 12:59:08,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7642 conditions, 1665 events. 842/1665 cut-off events. For 10884/10884 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10197 event pairs, 283 based on Foata normal form. 1/1598 useless extension candidates. Maximal degree in co-relation 7590. Up to 1250 conditions per place. [2024-05-12 12:59:08,723 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 112 selfloop transitions, 58 changer transitions 0/177 dead transitions. [2024-05-12 12:59:08,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 177 transitions, 2121 flow [2024-05-12 12:59:08,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:59:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:59:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-05-12 12:59:08,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46616541353383456 [2024-05-12 12:59:08,725 INFO L175 Difference]: Start difference. First operand has 105 places, 144 transitions, 1555 flow. Second operand 7 states and 124 transitions. [2024-05-12 12:59:08,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 177 transitions, 2121 flow [2024-05-12 12:59:08,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 177 transitions, 2038 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-05-12 12:59:08,741 INFO L231 Difference]: Finished difference. Result has 108 places, 154 transitions, 1752 flow [2024-05-12 12:59:08,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1752, PETRI_PLACES=108, PETRI_TRANSITIONS=154} [2024-05-12 12:59:08,741 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places. [2024-05-12 12:59:08,741 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 154 transitions, 1752 flow [2024-05-12 12:59:08,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:08,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:08,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:08,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 12:59:08,742 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:08,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:08,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1411680125, now seen corresponding path program 2 times [2024-05-12 12:59:08,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726017174] [2024-05-12 12:59:08,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:08,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:09,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:09,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726017174] [2024-05-12 12:59:09,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726017174] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:09,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:09,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:59:09,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64552029] [2024-05-12 12:59:09,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:09,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:59:09,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:09,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:59:09,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:59:09,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:09,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 154 transitions, 1752 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:09,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:09,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:09,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:09,727 INFO L124 PetriNetUnfolderBase]: 925/1831 cut-off events. [2024-05-12 12:59:09,727 INFO L125 PetriNetUnfolderBase]: For 10959/10959 co-relation queries the response was YES. [2024-05-12 12:59:09,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8245 conditions, 1831 events. 925/1831 cut-off events. For 10959/10959 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11425 event pairs, 304 based on Foata normal form. 3/1755 useless extension candidates. Maximal degree in co-relation 8192. Up to 1260 conditions per place. [2024-05-12 12:59:09,738 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 134 selfloop transitions, 52 changer transitions 0/193 dead transitions. [2024-05-12 12:59:09,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 193 transitions, 2368 flow [2024-05-12 12:59:09,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:59:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:59:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-05-12 12:59:09,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924812030075188 [2024-05-12 12:59:09,739 INFO L175 Difference]: Start difference. First operand has 108 places, 154 transitions, 1752 flow. Second operand 7 states and 131 transitions. [2024-05-12 12:59:09,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 193 transitions, 2368 flow [2024-05-12 12:59:09,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 193 transitions, 2246 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-05-12 12:59:09,756 INFO L231 Difference]: Finished difference. Result has 110 places, 161 transitions, 1812 flow [2024-05-12 12:59:09,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1812, PETRI_PLACES=110, PETRI_TRANSITIONS=161} [2024-05-12 12:59:09,757 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-05-12 12:59:09,757 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 161 transitions, 1812 flow [2024-05-12 12:59:09,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:09,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:09,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:09,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 12:59:09,757 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:09,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:09,758 INFO L85 PathProgramCache]: Analyzing trace with hash -979617040, now seen corresponding path program 6 times [2024-05-12 12:59:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:09,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906704894] [2024-05-12 12:59:09,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:09,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:10,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:10,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906704894] [2024-05-12 12:59:10,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906704894] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:10,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:10,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:59:10,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598195381] [2024-05-12 12:59:10,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:10,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:59:10,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:10,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:59:10,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:59:10,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:10,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 161 transitions, 1812 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:10,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:10,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:10,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:10,935 INFO L124 PetriNetUnfolderBase]: 923/1796 cut-off events. [2024-05-12 12:59:10,935 INFO L125 PetriNetUnfolderBase]: For 10984/10984 co-relation queries the response was YES. [2024-05-12 12:59:10,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8338 conditions, 1796 events. 923/1796 cut-off events. For 10984/10984 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11034 event pairs, 338 based on Foata normal form. 1/1727 useless extension candidates. Maximal degree in co-relation 8284. Up to 1451 conditions per place. [2024-05-12 12:59:10,947 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 146 selfloop transitions, 27 changer transitions 0/180 dead transitions. [2024-05-12 12:59:10,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 180 transitions, 2250 flow [2024-05-12 12:59:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:59:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:59:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-05-12 12:59:10,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44360902255639095 [2024-05-12 12:59:10,949 INFO L175 Difference]: Start difference. First operand has 110 places, 161 transitions, 1812 flow. Second operand 7 states and 118 transitions. [2024-05-12 12:59:10,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 180 transitions, 2250 flow [2024-05-12 12:59:10,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 180 transitions, 2182 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-05-12 12:59:10,970 INFO L231 Difference]: Finished difference. Result has 113 places, 161 transitions, 1814 flow [2024-05-12 12:59:10,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1744, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1814, PETRI_PLACES=113, PETRI_TRANSITIONS=161} [2024-05-12 12:59:10,971 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-05-12 12:59:10,971 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 161 transitions, 1814 flow [2024-05-12 12:59:10,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:10,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:10,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:10,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 12:59:10,972 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:10,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1395439097, now seen corresponding path program 3 times [2024-05-12 12:59:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:10,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417444537] [2024-05-12 12:59:10,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:10,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:11,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:11,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417444537] [2024-05-12 12:59:11,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417444537] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:11,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:11,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:59:11,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792027641] [2024-05-12 12:59:11,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:11,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:59:11,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:11,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:59:11,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:59:11,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:11,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 161 transitions, 1814 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:11,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:11,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:11,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:11,993 INFO L124 PetriNetUnfolderBase]: 977/1919 cut-off events. [2024-05-12 12:59:11,993 INFO L125 PetriNetUnfolderBase]: For 11193/11193 co-relation queries the response was YES. [2024-05-12 12:59:11,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8674 conditions, 1919 events. 977/1919 cut-off events. For 11193/11193 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12074 event pairs, 346 based on Foata normal form. 3/1843 useless extension candidates. Maximal degree in co-relation 8619. Up to 1444 conditions per place. [2024-05-12 12:59:12,005 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 162 selfloop transitions, 29 changer transitions 0/198 dead transitions. [2024-05-12 12:59:12,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 198 transitions, 2447 flow [2024-05-12 12:59:12,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:59:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:59:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-05-12 12:59:12,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699248120300752 [2024-05-12 12:59:12,006 INFO L175 Difference]: Start difference. First operand has 113 places, 161 transitions, 1814 flow. Second operand 7 states and 125 transitions. [2024-05-12 12:59:12,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 198 transitions, 2447 flow [2024-05-12 12:59:12,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 198 transitions, 2305 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-05-12 12:59:12,023 INFO L231 Difference]: Finished difference. Result has 113 places, 166 transitions, 1790 flow [2024-05-12 12:59:12,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1790, PETRI_PLACES=113, PETRI_TRANSITIONS=166} [2024-05-12 12:59:12,023 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-05-12 12:59:12,024 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 166 transitions, 1790 flow [2024-05-12 12:59:12,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:12,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:12,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:12,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 12:59:12,024 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:12,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:12,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1406108495, now seen corresponding path program 4 times [2024-05-12 12:59:12,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:12,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78031861] [2024-05-12 12:59:12,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:12,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:12,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:12,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78031861] [2024-05-12 12:59:12,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78031861] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:12,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:12,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:59:12,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441498475] [2024-05-12 12:59:12,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:12,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:59:12,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:12,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:59:12,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:59:12,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:12,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 166 transitions, 1790 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:12,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:12,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:12,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:13,027 INFO L124 PetriNetUnfolderBase]: 971/1884 cut-off events. [2024-05-12 12:59:13,027 INFO L125 PetriNetUnfolderBase]: For 11072/11072 co-relation queries the response was YES. [2024-05-12 12:59:13,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8540 conditions, 1884 events. 971/1884 cut-off events. For 11072/11072 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11713 event pairs, 347 based on Foata normal form. 3/1814 useless extension candidates. Maximal degree in co-relation 8485. Up to 1506 conditions per place. [2024-05-12 12:59:13,043 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 163 selfloop transitions, 17 changer transitions 0/187 dead transitions. [2024-05-12 12:59:13,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 187 transitions, 2249 flow [2024-05-12 12:59:13,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:59:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:59:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-05-12 12:59:13,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2024-05-12 12:59:13,045 INFO L175 Difference]: Start difference. First operand has 113 places, 166 transitions, 1790 flow. Second operand 7 states and 119 transitions. [2024-05-12 12:59:13,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 187 transitions, 2249 flow [2024-05-12 12:59:13,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 187 transitions, 2152 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-05-12 12:59:13,061 INFO L231 Difference]: Finished difference. Result has 115 places, 166 transitions, 1735 flow [2024-05-12 12:59:13,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1735, PETRI_PLACES=115, PETRI_TRANSITIONS=166} [2024-05-12 12:59:13,062 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2024-05-12 12:59:13,062 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 166 transitions, 1735 flow [2024-05-12 12:59:13,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:13,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:13,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:13,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 12:59:13,063 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:13,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash -733275162, now seen corresponding path program 1 times [2024-05-12 12:59:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:13,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319684323] [2024-05-12 12:59:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319684323] [2024-05-12 12:59:13,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319684323] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:13,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:13,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:13,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371534995] [2024-05-12 12:59:13,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:13,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:13,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:13,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:13,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:13,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:13,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 166 transitions, 1735 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:13,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:13,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:13,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:14,329 INFO L124 PetriNetUnfolderBase]: 1063/2107 cut-off events. [2024-05-12 12:59:14,330 INFO L125 PetriNetUnfolderBase]: For 11163/11163 co-relation queries the response was YES. [2024-05-12 12:59:14,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9118 conditions, 2107 events. 1063/2107 cut-off events. For 11163/11163 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13400 event pairs, 279 based on Foata normal form. 2/2016 useless extension candidates. Maximal degree in co-relation 9063. Up to 1517 conditions per place. [2024-05-12 12:59:14,340 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 192 selfloop transitions, 38 changer transitions 0/237 dead transitions. [2024-05-12 12:59:14,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 237 transitions, 2633 flow [2024-05-12 12:59:14,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:59:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:59:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-05-12 12:59:14,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4688995215311005 [2024-05-12 12:59:14,342 INFO L175 Difference]: Start difference. First operand has 115 places, 166 transitions, 1735 flow. Second operand 11 states and 196 transitions. [2024-05-12 12:59:14,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 237 transitions, 2633 flow [2024-05-12 12:59:14,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 237 transitions, 2580 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 12:59:14,361 INFO L231 Difference]: Finished difference. Result has 124 places, 188 transitions, 2000 flow [2024-05-12 12:59:14,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2000, PETRI_PLACES=124, PETRI_TRANSITIONS=188} [2024-05-12 12:59:14,361 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2024-05-12 12:59:14,362 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 188 transitions, 2000 flow [2024-05-12 12:59:14,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:14,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:14,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:14,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 12:59:14,363 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:14,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2114957740, now seen corresponding path program 2 times [2024-05-12 12:59:14,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:14,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239499528] [2024-05-12 12:59:14,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:15,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:15,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239499528] [2024-05-12 12:59:15,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239499528] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:15,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:15,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:15,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119275678] [2024-05-12 12:59:15,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:15,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:15,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:15,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:15,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:15,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:15,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 188 transitions, 2000 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:15,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:15,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:15,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:15,604 INFO L124 PetriNetUnfolderBase]: 1107/2214 cut-off events. [2024-05-12 12:59:15,604 INFO L125 PetriNetUnfolderBase]: For 13167/13167 co-relation queries the response was YES. [2024-05-12 12:59:15,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9960 conditions, 2214 events. 1107/2214 cut-off events. For 13167/13167 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14396 event pairs, 299 based on Foata normal form. 1/2115 useless extension candidates. Maximal degree in co-relation 9900. Up to 1665 conditions per place. [2024-05-12 12:59:15,615 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 194 selfloop transitions, 37 changer transitions 0/238 dead transitions. [2024-05-12 12:59:15,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 238 transitions, 2811 flow [2024-05-12 12:59:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-05-12 12:59:15,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649122807017544 [2024-05-12 12:59:15,617 INFO L175 Difference]: Start difference. First operand has 124 places, 188 transitions, 2000 flow. Second operand 9 states and 159 transitions. [2024-05-12 12:59:15,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 238 transitions, 2811 flow [2024-05-12 12:59:15,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 238 transitions, 2742 flow, removed 31 selfloop flow, removed 2 redundant places. [2024-05-12 12:59:15,637 INFO L231 Difference]: Finished difference. Result has 132 places, 204 transitions, 2209 flow [2024-05-12 12:59:15,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1961, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2209, PETRI_PLACES=132, PETRI_TRANSITIONS=204} [2024-05-12 12:59:15,637 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 90 predicate places. [2024-05-12 12:59:15,637 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 204 transitions, 2209 flow [2024-05-12 12:59:15,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:15,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:15,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:15,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 12:59:15,638 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:15,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2113684384, now seen corresponding path program 1 times [2024-05-12 12:59:15,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:15,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279090666] [2024-05-12 12:59:15,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:15,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279090666] [2024-05-12 12:59:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279090666] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:16,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:16,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298901633] [2024-05-12 12:59:16,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:16,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:16,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:16,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:16,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:16,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 204 transitions, 2209 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:16,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:16,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:16,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:16,877 INFO L124 PetriNetUnfolderBase]: 1128/2274 cut-off events. [2024-05-12 12:59:16,877 INFO L125 PetriNetUnfolderBase]: For 14705/14705 co-relation queries the response was YES. [2024-05-12 12:59:16,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10380 conditions, 2274 events. 1128/2274 cut-off events. For 14705/14705 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14982 event pairs, 290 based on Foata normal form. 1/2170 useless extension candidates. Maximal degree in co-relation 10317. Up to 1484 conditions per place. [2024-05-12 12:59:16,888 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 177 selfloop transitions, 67 changer transitions 0/251 dead transitions. [2024-05-12 12:59:16,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 251 transitions, 3022 flow [2024-05-12 12:59:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-05-12 12:59:16,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853801169590643 [2024-05-12 12:59:16,889 INFO L175 Difference]: Start difference. First operand has 132 places, 204 transitions, 2209 flow. Second operand 9 states and 166 transitions. [2024-05-12 12:59:16,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 251 transitions, 3022 flow [2024-05-12 12:59:16,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 251 transitions, 2960 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-05-12 12:59:16,911 INFO L231 Difference]: Finished difference. Result has 140 places, 217 transitions, 2468 flow [2024-05-12 12:59:16,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2159, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2468, PETRI_PLACES=140, PETRI_TRANSITIONS=217} [2024-05-12 12:59:16,912 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2024-05-12 12:59:16,912 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 217 transitions, 2468 flow [2024-05-12 12:59:16,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:16,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:16,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:16,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 12:59:16,912 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:16,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash 841725450, now seen corresponding path program 3 times [2024-05-12 12:59:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:16,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852795985] [2024-05-12 12:59:16,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:17,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:17,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852795985] [2024-05-12 12:59:17,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852795985] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:17,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:17,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:17,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677712973] [2024-05-12 12:59:17,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:17,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:17,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:17,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:17,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:17,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 217 transitions, 2468 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:17,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:17,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:17,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:18,326 INFO L124 PetriNetUnfolderBase]: 1202/2390 cut-off events. [2024-05-12 12:59:18,327 INFO L125 PetriNetUnfolderBase]: For 18304/18304 co-relation queries the response was YES. [2024-05-12 12:59:18,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11691 conditions, 2390 events. 1202/2390 cut-off events. For 18304/18304 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15753 event pairs, 227 based on Foata normal form. 2/2286 useless extension candidates. Maximal degree in co-relation 11624. Up to 1419 conditions per place. [2024-05-12 12:59:18,341 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 182 selfloop transitions, 82 changer transitions 0/271 dead transitions. [2024-05-12 12:59:18,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 271 transitions, 3437 flow [2024-05-12 12:59:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-05-12 12:59:18,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49707602339181284 [2024-05-12 12:59:18,373 INFO L175 Difference]: Start difference. First operand has 140 places, 217 transitions, 2468 flow. Second operand 9 states and 170 transitions. [2024-05-12 12:59:18,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 271 transitions, 3437 flow [2024-05-12 12:59:18,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 271 transitions, 3404 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-05-12 12:59:18,404 INFO L231 Difference]: Finished difference. Result has 148 places, 232 transitions, 2808 flow [2024-05-12 12:59:18,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2435, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2808, PETRI_PLACES=148, PETRI_TRANSITIONS=232} [2024-05-12 12:59:18,405 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 106 predicate places. [2024-05-12 12:59:18,405 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 232 transitions, 2808 flow [2024-05-12 12:59:18,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:18,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:18,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:18,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 12:59:18,406 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:18,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1507356846, now seen corresponding path program 4 times [2024-05-12 12:59:18,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:18,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156903574] [2024-05-12 12:59:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:18,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:19,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:19,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156903574] [2024-05-12 12:59:19,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156903574] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:19,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:19,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:19,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373270639] [2024-05-12 12:59:19,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:19,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:19,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:19,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:19,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:19,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:19,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 232 transitions, 2808 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:19,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:19,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:19,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:19,783 INFO L124 PetriNetUnfolderBase]: 1266/2484 cut-off events. [2024-05-12 12:59:19,783 INFO L125 PetriNetUnfolderBase]: For 21713/21713 co-relation queries the response was YES. [2024-05-12 12:59:19,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12944 conditions, 2484 events. 1266/2484 cut-off events. For 21713/21713 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16809 event pairs, 341 based on Foata normal form. 1/2383 useless extension candidates. Maximal degree in co-relation 12873. Up to 1931 conditions per place. [2024-05-12 12:59:19,799 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 232 selfloop transitions, 43 changer transitions 0/282 dead transitions. [2024-05-12 12:59:19,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 282 transitions, 3713 flow [2024-05-12 12:59:19,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-05-12 12:59:19,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2024-05-12 12:59:19,800 INFO L175 Difference]: Start difference. First operand has 148 places, 232 transitions, 2808 flow. Second operand 9 states and 156 transitions. [2024-05-12 12:59:19,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 282 transitions, 3713 flow [2024-05-12 12:59:19,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 282 transitions, 3659 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-05-12 12:59:19,836 INFO L231 Difference]: Finished difference. Result has 156 places, 249 transitions, 3070 flow [2024-05-12 12:59:19,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2754, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3070, PETRI_PLACES=156, PETRI_TRANSITIONS=249} [2024-05-12 12:59:19,837 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-05-12 12:59:19,837 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 249 transitions, 3070 flow [2024-05-12 12:59:19,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:19,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:19,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:19,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 12:59:19,838 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:19,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1449201538, now seen corresponding path program 2 times [2024-05-12 12:59:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:19,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243979699] [2024-05-12 12:59:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:20,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-05-12 12:59:20,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:20,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243979699] [2024-05-12 12:59:20,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243979699] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:20,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:20,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:20,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921787357] [2024-05-12 12:59:20,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:20,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:20,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:20,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:20,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:20,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:20,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 249 transitions, 3070 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:20,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:20,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:20,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:21,257 INFO L124 PetriNetUnfolderBase]: 1343/2650 cut-off events. [2024-05-12 12:59:21,257 INFO L125 PetriNetUnfolderBase]: For 23922/23922 co-relation queries the response was YES. [2024-05-12 12:59:21,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13943 conditions, 2650 events. 1343/2650 cut-off events. For 23922/23922 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18327 event pairs, 349 based on Foata normal form. 1/2537 useless extension candidates. Maximal degree in co-relation 13868. Up to 1745 conditions per place. [2024-05-12 12:59:21,273 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 210 selfloop transitions, 86 changer transitions 0/303 dead transitions. [2024-05-12 12:59:21,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 303 transitions, 4075 flow [2024-05-12 12:59:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-05-12 12:59:21,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2024-05-12 12:59:21,274 INFO L175 Difference]: Start difference. First operand has 156 places, 249 transitions, 3070 flow. Second operand 9 states and 168 transitions. [2024-05-12 12:59:21,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 303 transitions, 4075 flow [2024-05-12 12:59:21,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 303 transitions, 4026 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-05-12 12:59:21,312 INFO L231 Difference]: Finished difference. Result has 163 places, 264 transitions, 3376 flow [2024-05-12 12:59:21,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3021, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3376, PETRI_PLACES=163, PETRI_TRANSITIONS=264} [2024-05-12 12:59:21,312 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places. [2024-05-12 12:59:21,312 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 264 transitions, 3376 flow [2024-05-12 12:59:21,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:21,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:21,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:21,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 12:59:21,313 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:21,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1449201724, now seen corresponding path program 5 times [2024-05-12 12:59:21,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:21,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013016487] [2024-05-12 12:59:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:21,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:22,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:22,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013016487] [2024-05-12 12:59:22,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013016487] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:22,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:22,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:22,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836285622] [2024-05-12 12:59:22,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:22,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:22,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:22,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:22,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:22,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 264 transitions, 3376 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:22,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:22,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:22,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:22,770 INFO L124 PetriNetUnfolderBase]: 1394/2736 cut-off events. [2024-05-12 12:59:22,771 INFO L125 PetriNetUnfolderBase]: For 27569/27569 co-relation queries the response was YES. [2024-05-12 12:59:22,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14996 conditions, 2736 events. 1394/2736 cut-off events. For 27569/27569 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 19012 event pairs, 344 based on Foata normal form. 1/2623 useless extension candidates. Maximal degree in co-relation 14919. Up to 1965 conditions per place. [2024-05-12 12:59:22,789 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 219 selfloop transitions, 83 changer transitions 0/309 dead transitions. [2024-05-12 12:59:22,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 309 transitions, 4377 flow [2024-05-12 12:59:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-05-12 12:59:22,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-05-12 12:59:22,790 INFO L175 Difference]: Start difference. First operand has 163 places, 264 transitions, 3376 flow. Second operand 9 states and 162 transitions. [2024-05-12 12:59:22,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 309 transitions, 4377 flow [2024-05-12 12:59:22,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 309 transitions, 4299 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 12:59:22,840 INFO L231 Difference]: Finished difference. Result has 167 places, 273 transitions, 3582 flow [2024-05-12 12:59:22,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3298, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3582, PETRI_PLACES=167, PETRI_TRANSITIONS=273} [2024-05-12 12:59:22,841 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2024-05-12 12:59:22,841 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 273 transitions, 3582 flow [2024-05-12 12:59:22,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:22,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:22,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:22,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 12:59:22,842 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:22,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash -213893698, now seen corresponding path program 3 times [2024-05-12 12:59:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:22,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261305102] [2024-05-12 12:59:22,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:23,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:23,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261305102] [2024-05-12 12:59:23,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261305102] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:23,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:23,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:23,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386051698] [2024-05-12 12:59:23,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:23,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:23,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:23,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:23,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:23,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:23,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 273 transitions, 3582 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:23,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:23,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:23,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:24,363 INFO L124 PetriNetUnfolderBase]: 1439/2853 cut-off events. [2024-05-12 12:59:24,363 INFO L125 PetriNetUnfolderBase]: For 29863/29863 co-relation queries the response was YES. [2024-05-12 12:59:24,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15900 conditions, 2853 events. 1439/2853 cut-off events. For 29863/29863 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 20158 event pairs, 361 based on Foata normal form. 1/2727 useless extension candidates. Maximal degree in co-relation 15821. Up to 2024 conditions per place. [2024-05-12 12:59:24,382 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 246 selfloop transitions, 72 changer transitions 0/325 dead transitions. [2024-05-12 12:59:24,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 325 transitions, 4661 flow [2024-05-12 12:59:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-05-12 12:59:24,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49415204678362573 [2024-05-12 12:59:24,383 INFO L175 Difference]: Start difference. First operand has 167 places, 273 transitions, 3582 flow. Second operand 9 states and 169 transitions. [2024-05-12 12:59:24,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 325 transitions, 4661 flow [2024-05-12 12:59:24,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 325 transitions, 4559 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-05-12 12:59:24,443 INFO L231 Difference]: Finished difference. Result has 172 places, 284 transitions, 3775 flow [2024-05-12 12:59:24,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3480, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3775, PETRI_PLACES=172, PETRI_TRANSITIONS=284} [2024-05-12 12:59:24,444 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places. [2024-05-12 12:59:24,444 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 284 transitions, 3775 flow [2024-05-12 12:59:24,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:24,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:24,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:24,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 12:59:24,445 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:24,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:24,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1591500064, now seen corresponding path program 4 times [2024-05-12 12:59:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:24,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636343608] [2024-05-12 12:59:24,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:24,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:25,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:25,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636343608] [2024-05-12 12:59:25,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636343608] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:25,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:25,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:25,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046154868] [2024-05-12 12:59:25,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:25,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:25,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:25,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:25,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:25,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:25,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 284 transitions, 3775 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:25,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:25,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:25,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:25,745 INFO L124 PetriNetUnfolderBase]: 1433/2837 cut-off events. [2024-05-12 12:59:25,745 INFO L125 PetriNetUnfolderBase]: For 30952/30952 co-relation queries the response was YES. [2024-05-12 12:59:25,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16078 conditions, 2837 events. 1433/2837 cut-off events. For 30952/30952 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 20066 event pairs, 367 based on Foata normal form. 3/2715 useless extension candidates. Maximal degree in co-relation 15996. Up to 2059 conditions per place. [2024-05-12 12:59:25,769 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 251 selfloop transitions, 64 changer transitions 0/322 dead transitions. [2024-05-12 12:59:25,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 322 transitions, 4659 flow [2024-05-12 12:59:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-05-12 12:59:25,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853801169590643 [2024-05-12 12:59:25,770 INFO L175 Difference]: Start difference. First operand has 172 places, 284 transitions, 3775 flow. Second operand 9 states and 166 transitions. [2024-05-12 12:59:25,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 322 transitions, 4659 flow [2024-05-12 12:59:25,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 322 transitions, 4583 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-05-12 12:59:25,840 INFO L231 Difference]: Finished difference. Result has 176 places, 284 transitions, 3838 flow [2024-05-12 12:59:25,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3699, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3838, PETRI_PLACES=176, PETRI_TRANSITIONS=284} [2024-05-12 12:59:25,841 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 134 predicate places. [2024-05-12 12:59:25,841 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 284 transitions, 3838 flow [2024-05-12 12:59:25,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:25,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:25,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:25,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 12:59:25,841 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:25,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:25,842 INFO L85 PathProgramCache]: Analyzing trace with hash -253218004, now seen corresponding path program 6 times [2024-05-12 12:59:25,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:25,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048370409] [2024-05-12 12:59:25,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:25,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:26,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:26,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048370409] [2024-05-12 12:59:26,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048370409] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:26,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:26,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:26,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674070880] [2024-05-12 12:59:26,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:26,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:26,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:26,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:26,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:26,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:26,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 284 transitions, 3838 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:26,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:26,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:26,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:27,231 INFO L124 PetriNetUnfolderBase]: 1462/2873 cut-off events. [2024-05-12 12:59:27,232 INFO L125 PetriNetUnfolderBase]: For 31844/31844 co-relation queries the response was YES. [2024-05-12 12:59:27,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16612 conditions, 2873 events. 1462/2873 cut-off events. For 31844/31844 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 20246 event pairs, 388 based on Foata normal form. 2/2754 useless extension candidates. Maximal degree in co-relation 16528. Up to 2211 conditions per place. [2024-05-12 12:59:27,253 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 257 selfloop transitions, 58 changer transitions 0/322 dead transitions. [2024-05-12 12:59:27,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 322 transitions, 4759 flow [2024-05-12 12:59:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-05-12 12:59:27,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4619883040935672 [2024-05-12 12:59:27,254 INFO L175 Difference]: Start difference. First operand has 176 places, 284 transitions, 3838 flow. Second operand 9 states and 158 transitions. [2024-05-12 12:59:27,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 322 transitions, 4759 flow [2024-05-12 12:59:27,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 322 transitions, 4599 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-05-12 12:59:27,355 INFO L231 Difference]: Finished difference. Result has 178 places, 292 transitions, 3929 flow [2024-05-12 12:59:27,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3692, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3929, PETRI_PLACES=178, PETRI_TRANSITIONS=292} [2024-05-12 12:59:27,355 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places. [2024-05-12 12:59:27,355 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 292 transitions, 3929 flow [2024-05-12 12:59:27,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:27,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:27,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:27,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 12:59:27,356 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:27,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash -817178326, now seen corresponding path program 7 times [2024-05-12 12:59:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:27,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522149858] [2024-05-12 12:59:27,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:27,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:28,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:28,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522149858] [2024-05-12 12:59:28,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522149858] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:28,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:28,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652728972] [2024-05-12 12:59:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:28,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:28,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:28,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:28,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:28,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 292 transitions, 3929 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:28,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:28,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:28,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:28,923 INFO L124 PetriNetUnfolderBase]: 1592/3107 cut-off events. [2024-05-12 12:59:28,923 INFO L125 PetriNetUnfolderBase]: For 34368/34368 co-relation queries the response was YES. [2024-05-12 12:59:28,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18007 conditions, 3107 events. 1592/3107 cut-off events. For 34368/34368 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 22177 event pairs, 451 based on Foata normal form. 2/2982 useless extension candidates. Maximal degree in co-relation 17922. Up to 2336 conditions per place. [2024-05-12 12:59:28,945 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 301 selfloop transitions, 56 changer transitions 0/364 dead transitions. [2024-05-12 12:59:28,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 364 transitions, 5374 flow [2024-05-12 12:59:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-05-12 12:59:28,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2024-05-12 12:59:28,947 INFO L175 Difference]: Start difference. First operand has 178 places, 292 transitions, 3929 flow. Second operand 9 states and 150 transitions. [2024-05-12 12:59:28,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 364 transitions, 5374 flow [2024-05-12 12:59:29,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 364 transitions, 5222 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-05-12 12:59:29,015 INFO L231 Difference]: Finished difference. Result has 182 places, 326 transitions, 4475 flow [2024-05-12 12:59:29,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3777, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4475, PETRI_PLACES=182, PETRI_TRANSITIONS=326} [2024-05-12 12:59:29,015 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 140 predicate places. [2024-05-12 12:59:29,015 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 326 transitions, 4475 flow [2024-05-12 12:59:29,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:29,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:29,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:29,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 12:59:29,016 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:29,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:29,016 INFO L85 PathProgramCache]: Analyzing trace with hash -817058356, now seen corresponding path program 8 times [2024-05-12 12:59:29,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:29,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271733380] [2024-05-12 12:59:29,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:29,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:29,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271733380] [2024-05-12 12:59:29,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271733380] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:29,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:29,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:29,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428931931] [2024-05-12 12:59:29,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:29,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:29,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:29,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:29,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:30,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:30,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 326 transitions, 4475 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:30,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:30,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:30,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:30,643 INFO L124 PetriNetUnfolderBase]: 1616/3200 cut-off events. [2024-05-12 12:59:30,643 INFO L125 PetriNetUnfolderBase]: For 36276/36276 co-relation queries the response was YES. [2024-05-12 12:59:30,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18702 conditions, 3200 events. 1616/3200 cut-off events. For 36276/36276 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 22864 event pairs, 282 based on Foata normal form. 1/3056 useless extension candidates. Maximal degree in co-relation 18614. Up to 2006 conditions per place. [2024-05-12 12:59:30,669 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 225 selfloop transitions, 144 changer transitions 0/376 dead transitions. [2024-05-12 12:59:30,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 376 transitions, 5763 flow [2024-05-12 12:59:30,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-05-12 12:59:30,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48355263157894735 [2024-05-12 12:59:30,670 INFO L175 Difference]: Start difference. First operand has 182 places, 326 transitions, 4475 flow. Second operand 8 states and 147 transitions. [2024-05-12 12:59:30,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 376 transitions, 5763 flow [2024-05-12 12:59:30,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 376 transitions, 5609 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-05-12 12:59:30,748 INFO L231 Difference]: Finished difference. Result has 183 places, 341 transitions, 4937 flow [2024-05-12 12:59:30,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=4339, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4937, PETRI_PLACES=183, PETRI_TRANSITIONS=341} [2024-05-12 12:59:30,749 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places. [2024-05-12 12:59:30,749 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 341 transitions, 4937 flow [2024-05-12 12:59:30,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:30,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:30,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:30,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 12:59:30,750 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:30,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash -817058170, now seen corresponding path program 5 times [2024-05-12 12:59:30,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:30,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728966860] [2024-05-12 12:59:30,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:30,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:31,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:31,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728966860] [2024-05-12 12:59:31,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728966860] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:31,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:31,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:31,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592864650] [2024-05-12 12:59:31,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:31,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:31,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:31,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:31,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:31,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:31,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 341 transitions, 4937 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:31,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:31,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:31,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:32,279 INFO L124 PetriNetUnfolderBase]: 1666/3342 cut-off events. [2024-05-12 12:59:32,279 INFO L125 PetriNetUnfolderBase]: For 40892/40892 co-relation queries the response was YES. [2024-05-12 12:59:32,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20016 conditions, 3342 events. 1666/3342 cut-off events. For 40892/40892 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 24394 event pairs, 309 based on Foata normal form. 1/3180 useless extension candidates. Maximal degree in co-relation 19927. Up to 1914 conditions per place. [2024-05-12 12:59:32,305 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 237 selfloop transitions, 142 changer transitions 0/386 dead transitions. [2024-05-12 12:59:32,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 386 transitions, 6086 flow [2024-05-12 12:59:32,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-05-12 12:59:32,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 12:59:32,312 INFO L175 Difference]: Start difference. First operand has 183 places, 341 transitions, 4937 flow. Second operand 8 states and 152 transitions. [2024-05-12 12:59:32,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 386 transitions, 6086 flow [2024-05-12 12:59:32,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 386 transitions, 5995 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-05-12 12:59:32,409 INFO L231 Difference]: Finished difference. Result has 189 places, 350 transitions, 5345 flow [2024-05-12 12:59:32,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=4848, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5345, PETRI_PLACES=189, PETRI_TRANSITIONS=350} [2024-05-12 12:59:32,410 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 147 predicate places. [2024-05-12 12:59:32,410 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 350 transitions, 5345 flow [2024-05-12 12:59:32,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:32,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:32,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:32,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:59:32,410 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:32,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:32,411 INFO L85 PathProgramCache]: Analyzing trace with hash -812410030, now seen corresponding path program 6 times [2024-05-12 12:59:32,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:32,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555394851] [2024-05-12 12:59:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:32,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:33,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:33,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555394851] [2024-05-12 12:59:33,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555394851] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:33,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:33,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:33,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831530041] [2024-05-12 12:59:33,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:33,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:33,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:33,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:33,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:33,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:33,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 350 transitions, 5345 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:33,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:33,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:33,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:33,900 INFO L124 PetriNetUnfolderBase]: 1733/3420 cut-off events. [2024-05-12 12:59:33,900 INFO L125 PetriNetUnfolderBase]: For 46360/46360 co-relation queries the response was YES. [2024-05-12 12:59:33,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21650 conditions, 3420 events. 1733/3420 cut-off events. For 46360/46360 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 25149 event pairs, 417 based on Foata normal form. 3/3272 useless extension candidates. Maximal degree in co-relation 21558. Up to 2379 conditions per place. [2024-05-12 12:59:33,922 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 312 selfloop transitions, 83 changer transitions 0/402 dead transitions. [2024-05-12 12:59:33,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 402 transitions, 6611 flow [2024-05-12 12:59:33,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-05-12 12:59:33,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2024-05-12 12:59:33,923 INFO L175 Difference]: Start difference. First operand has 189 places, 350 transitions, 5345 flow. Second operand 8 states and 148 transitions. [2024-05-12 12:59:33,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 402 transitions, 6611 flow [2024-05-12 12:59:34,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 402 transitions, 6506 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-05-12 12:59:34,017 INFO L231 Difference]: Finished difference. Result has 192 places, 362 transitions, 5616 flow [2024-05-12 12:59:34,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=5242, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5616, PETRI_PLACES=192, PETRI_TRANSITIONS=362} [2024-05-12 12:59:34,018 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places. [2024-05-12 12:59:34,018 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 362 transitions, 5616 flow [2024-05-12 12:59:34,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:34,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:34,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:34,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:59:34,018 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:34,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash -812416726, now seen corresponding path program 9 times [2024-05-12 12:59:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:34,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124794994] [2024-05-12 12:59:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:34,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:34,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124794994] [2024-05-12 12:59:34,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124794994] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:34,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:34,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:34,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068591544] [2024-05-12 12:59:34,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:34,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:34,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:34,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:34,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:34,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:34,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 362 transitions, 5616 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:34,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:34,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:34,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:35,462 INFO L124 PetriNetUnfolderBase]: 1785/3508 cut-off events. [2024-05-12 12:59:35,462 INFO L125 PetriNetUnfolderBase]: For 47126/47126 co-relation queries the response was YES. [2024-05-12 12:59:35,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22668 conditions, 3508 events. 1785/3508 cut-off events. For 47126/47126 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 25783 event pairs, 449 based on Foata normal form. 2/3359 useless extension candidates. Maximal degree in co-relation 22575. Up to 2631 conditions per place. [2024-05-12 12:59:35,492 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 315 selfloop transitions, 81 changer transitions 0/403 dead transitions. [2024-05-12 12:59:35,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 403 transitions, 6809 flow [2024-05-12 12:59:35,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-05-12 12:59:35,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46381578947368424 [2024-05-12 12:59:35,493 INFO L175 Difference]: Start difference. First operand has 192 places, 362 transitions, 5616 flow. Second operand 8 states and 141 transitions. [2024-05-12 12:59:35,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 403 transitions, 6809 flow [2024-05-12 12:59:35,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 403 transitions, 6639 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-05-12 12:59:35,600 INFO L231 Difference]: Finished difference. Result has 193 places, 373 transitions, 5837 flow [2024-05-12 12:59:35,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=5446, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5837, PETRI_PLACES=193, PETRI_TRANSITIONS=373} [2024-05-12 12:59:35,600 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 151 predicate places. [2024-05-12 12:59:35,600 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 373 transitions, 5837 flow [2024-05-12 12:59:35,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:35,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:35,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:35,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:59:35,601 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:35,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash -812416540, now seen corresponding path program 7 times [2024-05-12 12:59:35,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:35,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271692459] [2024-05-12 12:59:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:35,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:36,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271692459] [2024-05-12 12:59:36,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271692459] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:36,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:36,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:36,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363753739] [2024-05-12 12:59:36,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:36,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:36,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:36,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:36,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:36,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:36,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 373 transitions, 5837 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:36,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:36,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:36,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:37,203 INFO L124 PetriNetUnfolderBase]: 1881/3732 cut-off events. [2024-05-12 12:59:37,203 INFO L125 PetriNetUnfolderBase]: For 48955/48955 co-relation queries the response was YES. [2024-05-12 12:59:37,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23981 conditions, 3732 events. 1881/3732 cut-off events. For 48955/48955 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 27975 event pairs, 490 based on Foata normal form. 1/3562 useless extension candidates. Maximal degree in co-relation 23888. Up to 2595 conditions per place. [2024-05-12 12:59:37,235 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 342 selfloop transitions, 95 changer transitions 0/444 dead transitions. [2024-05-12 12:59:37,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 444 transitions, 7547 flow [2024-05-12 12:59:37,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-05-12 12:59:37,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4619883040935672 [2024-05-12 12:59:37,236 INFO L175 Difference]: Start difference. First operand has 193 places, 373 transitions, 5837 flow. Second operand 9 states and 158 transitions. [2024-05-12 12:59:37,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 444 transitions, 7547 flow [2024-05-12 12:59:37,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 444 transitions, 7315 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-05-12 12:59:37,354 INFO L231 Difference]: Finished difference. Result has 198 places, 399 transitions, 6381 flow [2024-05-12 12:59:37,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=5611, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6381, PETRI_PLACES=198, PETRI_TRANSITIONS=399} [2024-05-12 12:59:37,354 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 156 predicate places. [2024-05-12 12:59:37,355 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 399 transitions, 6381 flow [2024-05-12 12:59:37,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:37,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:37,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:37,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:59:37,355 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:37,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:37,355 INFO L85 PathProgramCache]: Analyzing trace with hash -555293108, now seen corresponding path program 10 times [2024-05-12 12:59:37,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:37,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699299055] [2024-05-12 12:59:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:37,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:38,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:38,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699299055] [2024-05-12 12:59:38,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699299055] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:38,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:38,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:38,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346364514] [2024-05-12 12:59:38,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:38,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:38,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:38,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:38,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:38,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:38,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 399 transitions, 6381 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:38,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:38,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:38,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:38,886 INFO L124 PetriNetUnfolderBase]: 1879/3673 cut-off events. [2024-05-12 12:59:38,886 INFO L125 PetriNetUnfolderBase]: For 48054/48054 co-relation queries the response was YES. [2024-05-12 12:59:38,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24223 conditions, 3673 events. 1879/3673 cut-off events. For 48054/48054 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 27153 event pairs, 562 based on Foata normal form. 1/3520 useless extension candidates. Maximal degree in co-relation 24127. Up to 2924 conditions per place. [2024-05-12 12:59:38,914 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 384 selfloop transitions, 34 changer transitions 0/425 dead transitions. [2024-05-12 12:59:38,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 425 transitions, 7417 flow [2024-05-12 12:59:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-05-12 12:59:38,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4407894736842105 [2024-05-12 12:59:38,915 INFO L175 Difference]: Start difference. First operand has 198 places, 399 transitions, 6381 flow. Second operand 8 states and 134 transitions. [2024-05-12 12:59:38,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 425 transitions, 7417 flow [2024-05-12 12:59:39,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 425 transitions, 7256 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-05-12 12:59:39,047 INFO L231 Difference]: Finished difference. Result has 201 places, 401 transitions, 6326 flow [2024-05-12 12:59:39,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=6224, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6326, PETRI_PLACES=201, PETRI_TRANSITIONS=401} [2024-05-12 12:59:39,048 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2024-05-12 12:59:39,048 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 401 transitions, 6326 flow [2024-05-12 12:59:39,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:39,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:39,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:39,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:59:39,048 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:39,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash -639920140, now seen corresponding path program 8 times [2024-05-12 12:59:39,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:39,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405190191] [2024-05-12 12:59:39,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:39,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:39,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:39,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405190191] [2024-05-12 12:59:39,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405190191] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:39,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:39,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:39,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590941978] [2024-05-12 12:59:39,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:39,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:39,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:39,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:39,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:39,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:39,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 401 transitions, 6326 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:39,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:39,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:39,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:40,642 INFO L124 PetriNetUnfolderBase]: 1946/3821 cut-off events. [2024-05-12 12:59:40,643 INFO L125 PetriNetUnfolderBase]: For 51159/51159 co-relation queries the response was YES. [2024-05-12 12:59:40,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24869 conditions, 3821 events. 1946/3821 cut-off events. For 51159/51159 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 28510 event pairs, 558 based on Foata normal form. 3/3659 useless extension candidates. Maximal degree in co-relation 24772. Up to 2905 conditions per place. [2024-05-12 12:59:40,675 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 405 selfloop transitions, 43 changer transitions 0/455 dead transitions. [2024-05-12 12:59:40,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 455 transitions, 7777 flow [2024-05-12 12:59:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-05-12 12:59:40,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46710526315789475 [2024-05-12 12:59:40,676 INFO L175 Difference]: Start difference. First operand has 201 places, 401 transitions, 6326 flow. Second operand 8 states and 142 transitions. [2024-05-12 12:59:40,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 455 transitions, 7777 flow [2024-05-12 12:59:40,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 455 transitions, 7685 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-05-12 12:59:40,812 INFO L231 Difference]: Finished difference. Result has 203 places, 413 transitions, 6563 flow [2024-05-12 12:59:40,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=6234, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6563, PETRI_PLACES=203, PETRI_TRANSITIONS=413} [2024-05-12 12:59:40,812 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places. [2024-05-12 12:59:40,813 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 413 transitions, 6563 flow [2024-05-12 12:59:40,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:40,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:40,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:40,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:59:40,813 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:40,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1541611620, now seen corresponding path program 9 times [2024-05-12 12:59:40,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:40,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356107585] [2024-05-12 12:59:40,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:40,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:41,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:41,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356107585] [2024-05-12 12:59:41,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356107585] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:41,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:41,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:41,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749634382] [2024-05-12 12:59:41,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:41,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:41,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:41,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:41,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:41,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:41,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 413 transitions, 6563 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:41,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:41,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:41,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:42,560 INFO L124 PetriNetUnfolderBase]: 1977/3883 cut-off events. [2024-05-12 12:59:42,560 INFO L125 PetriNetUnfolderBase]: For 52722/52722 co-relation queries the response was YES. [2024-05-12 12:59:42,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25560 conditions, 3883 events. 1977/3883 cut-off events. For 52722/52722 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 29069 event pairs, 538 based on Foata normal form. 1/3716 useless extension candidates. Maximal degree in co-relation 25462. Up to 2827 conditions per place. [2024-05-12 12:59:42,595 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 382 selfloop transitions, 71 changer transitions 0/460 dead transitions. [2024-05-12 12:59:42,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 460 transitions, 8030 flow [2024-05-12 12:59:42,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-05-12 12:59:42,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46710526315789475 [2024-05-12 12:59:42,596 INFO L175 Difference]: Start difference. First operand has 203 places, 413 transitions, 6563 flow. Second operand 8 states and 142 transitions. [2024-05-12 12:59:42,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 460 transitions, 8030 flow [2024-05-12 12:59:42,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 460 transitions, 7892 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-05-12 12:59:42,737 INFO L231 Difference]: Finished difference. Result has 205 places, 423 transitions, 6782 flow [2024-05-12 12:59:42,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=6425, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6782, PETRI_PLACES=205, PETRI_TRANSITIONS=423} [2024-05-12 12:59:42,738 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 163 predicate places. [2024-05-12 12:59:42,738 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 423 transitions, 6782 flow [2024-05-12 12:59:42,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:42,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:42,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:42,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:59:42,738 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:42,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:42,739 INFO L85 PathProgramCache]: Analyzing trace with hash 318116490, now seen corresponding path program 1 times [2024-05-12 12:59:42,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:42,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144735876] [2024-05-12 12:59:42,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:42,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:43,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:43,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144735876] [2024-05-12 12:59:43,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144735876] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:43,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:43,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:43,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725963391] [2024-05-12 12:59:43,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:43,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:43,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:43,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:43,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:43,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:43,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 423 transitions, 6782 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:43,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:43,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:43,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:44,204 INFO L124 PetriNetUnfolderBase]: 1979/3865 cut-off events. [2024-05-12 12:59:44,204 INFO L125 PetriNetUnfolderBase]: For 53152/53152 co-relation queries the response was YES. [2024-05-12 12:59:44,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25541 conditions, 3865 events. 1979/3865 cut-off events. For 53152/53152 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 28794 event pairs, 589 based on Foata normal form. 2/3705 useless extension candidates. Maximal degree in co-relation 25442. Up to 3103 conditions per place. [2024-05-12 12:59:44,237 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 425 selfloop transitions, 17 changer transitions 0/449 dead transitions. [2024-05-12 12:59:44,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 449 transitions, 7842 flow [2024-05-12 12:59:44,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-05-12 12:59:44,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4407894736842105 [2024-05-12 12:59:44,238 INFO L175 Difference]: Start difference. First operand has 205 places, 423 transitions, 6782 flow. Second operand 8 states and 134 transitions. [2024-05-12 12:59:44,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 449 transitions, 7842 flow [2024-05-12 12:59:44,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 449 transitions, 7521 flow, removed 45 selfloop flow, removed 6 redundant places. [2024-05-12 12:59:44,385 INFO L231 Difference]: Finished difference. Result has 208 places, 428 transitions, 6560 flow [2024-05-12 12:59:44,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=6461, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6560, PETRI_PLACES=208, PETRI_TRANSITIONS=428} [2024-05-12 12:59:44,385 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 166 predicate places. [2024-05-12 12:59:44,385 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 428 transitions, 6560 flow [2024-05-12 12:59:44,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:44,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:44,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:44,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:59:44,386 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:44,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash -181252104, now seen corresponding path program 10 times [2024-05-12 12:59:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:44,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959506100] [2024-05-12 12:59:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:45,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-05-12 12:59:45,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:45,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959506100] [2024-05-12 12:59:45,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959506100] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:45,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:45,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:45,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233885133] [2024-05-12 12:59:45,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:45,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:45,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:45,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:45,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:45,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:45,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 428 transitions, 6560 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:45,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:45,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:45,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:45,916 INFO L124 PetriNetUnfolderBase]: 1973/3848 cut-off events. [2024-05-12 12:59:45,916 INFO L125 PetriNetUnfolderBase]: For 51817/51817 co-relation queries the response was YES. [2024-05-12 12:59:45,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25175 conditions, 3848 events. 1973/3848 cut-off events. For 51817/51817 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 28667 event pairs, 575 based on Foata normal form. 3/3691 useless extension candidates. Maximal degree in co-relation 25074. Up to 3015 conditions per place. [2024-05-12 12:59:45,952 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 421 selfloop transitions, 30 changer transitions 0/458 dead transitions. [2024-05-12 12:59:45,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 458 transitions, 7690 flow [2024-05-12 12:59:45,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-05-12 12:59:45,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4506578947368421 [2024-05-12 12:59:45,954 INFO L175 Difference]: Start difference. First operand has 208 places, 428 transitions, 6560 flow. Second operand 8 states and 137 transitions. [2024-05-12 12:59:45,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 458 transitions, 7690 flow [2024-05-12 12:59:46,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 458 transitions, 7587 flow, removed 38 selfloop flow, removed 5 redundant places. [2024-05-12 12:59:46,100 INFO L231 Difference]: Finished difference. Result has 211 places, 428 transitions, 6535 flow [2024-05-12 12:59:46,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=6457, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6535, PETRI_PLACES=211, PETRI_TRANSITIONS=428} [2024-05-12 12:59:46,101 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 169 predicate places. [2024-05-12 12:59:46,101 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 428 transitions, 6535 flow [2024-05-12 12:59:46,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:46,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:46,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:46,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:59:46,101 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:46,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:46,102 INFO L85 PathProgramCache]: Analyzing trace with hash 318445493, now seen corresponding path program 1 times [2024-05-12 12:59:46,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:46,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155852492] [2024-05-12 12:59:46,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:46,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:46,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:46,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155852492] [2024-05-12 12:59:46,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155852492] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:46,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:46,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:59:46,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822910501] [2024-05-12 12:59:46,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:46,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:59:46,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:46,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:59:46,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:59:47,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:47,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 428 transitions, 6535 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:47,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:47,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:47,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:47,904 INFO L124 PetriNetUnfolderBase]: 1970/3863 cut-off events. [2024-05-12 12:59:47,904 INFO L125 PetriNetUnfolderBase]: For 51109/51109 co-relation queries the response was YES. [2024-05-12 12:59:47,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25083 conditions, 3863 events. 1970/3863 cut-off events. For 51109/51109 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 28864 event pairs, 579 based on Foata normal form. 2/3699 useless extension candidates. Maximal degree in co-relation 24981. Up to 3073 conditions per place. [2024-05-12 12:59:47,933 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 428 selfloop transitions, 20 changer transitions 0/455 dead transitions. [2024-05-12 12:59:47,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 455 transitions, 7593 flow [2024-05-12 12:59:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:59:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:59:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-05-12 12:59:47,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2024-05-12 12:59:47,935 INFO L175 Difference]: Start difference. First operand has 211 places, 428 transitions, 6535 flow. Second operand 8 states and 136 transitions. [2024-05-12 12:59:47,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 455 transitions, 7593 flow [2024-05-12 12:59:48,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 455 transitions, 7463 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-05-12 12:59:48,067 INFO L231 Difference]: Finished difference. Result has 213 places, 430 transitions, 6480 flow [2024-05-12 12:59:48,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=6407, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6480, PETRI_PLACES=213, PETRI_TRANSITIONS=430} [2024-05-12 12:59:48,068 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 171 predicate places. [2024-05-12 12:59:48,068 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 430 transitions, 6480 flow [2024-05-12 12:59:48,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:48,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:48,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:48,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 12:59:48,069 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:48,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1256692440, now seen corresponding path program 1 times [2024-05-12 12:59:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:48,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082878071] [2024-05-12 12:59:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:48,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:48,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082878071] [2024-05-12 12:59:48,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082878071] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:48,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:48,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:59:48,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860931608] [2024-05-12 12:59:48,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:48,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:59:48,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:48,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:59:48,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:59:48,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:48,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 430 transitions, 6480 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:48,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:48,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:48,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:49,861 INFO L124 PetriNetUnfolderBase]: 1998/4022 cut-off events. [2024-05-12 12:59:49,861 INFO L125 PetriNetUnfolderBase]: For 51051/51051 co-relation queries the response was YES. [2024-05-12 12:59:49,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25337 conditions, 4022 events. 1998/4022 cut-off events. For 51051/51051 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 30425 event pairs, 465 based on Foata normal form. 1/3831 useless extension candidates. Maximal degree in co-relation 25233. Up to 2949 conditions per place. [2024-05-12 12:59:49,893 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 433 selfloop transitions, 76 changer transitions 0/516 dead transitions. [2024-05-12 12:59:49,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 516 transitions, 8546 flow [2024-05-12 12:59:49,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 12:59:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 12:59:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 206 transitions. [2024-05-12 12:59:49,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4517543859649123 [2024-05-12 12:59:49,894 INFO L175 Difference]: Start difference. First operand has 213 places, 430 transitions, 6480 flow. Second operand 12 states and 206 transitions. [2024-05-12 12:59:49,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 516 transitions, 8546 flow [2024-05-12 12:59:50,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 516 transitions, 8499 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 12:59:50,030 INFO L231 Difference]: Finished difference. Result has 223 places, 469 transitions, 7335 flow [2024-05-12 12:59:50,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=6433, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7335, PETRI_PLACES=223, PETRI_TRANSITIONS=469} [2024-05-12 12:59:50,031 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 181 predicate places. [2024-05-12 12:59:50,031 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 469 transitions, 7335 flow [2024-05-12 12:59:50,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:50,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:50,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:50,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 12:59:50,031 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:50,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1217918003, now seen corresponding path program 1 times [2024-05-12 12:59:50,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:50,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292188366] [2024-05-12 12:59:50,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:50,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292188366] [2024-05-12 12:59:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292188366] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:50,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:50,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:59:50,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414242284] [2024-05-12 12:59:50,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:50,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:59:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:50,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:59:50,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:59:51,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:51,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 469 transitions, 7335 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:51,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:51,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:51,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:52,287 INFO L124 PetriNetUnfolderBase]: 2037/4109 cut-off events. [2024-05-12 12:59:52,287 INFO L125 PetriNetUnfolderBase]: For 60270/60270 co-relation queries the response was YES. [2024-05-12 12:59:52,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26808 conditions, 4109 events. 2037/4109 cut-off events. For 60270/60270 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 31304 event pairs, 468 based on Foata normal form. 1/3912 useless extension candidates. Maximal degree in co-relation 26700. Up to 2995 conditions per place. [2024-05-12 12:59:52,330 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 428 selfloop transitions, 90 changer transitions 0/525 dead transitions. [2024-05-12 12:59:52,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 525 transitions, 8876 flow [2024-05-12 12:59:52,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 12:59:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 12:59:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 222 transitions. [2024-05-12 12:59:52,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4493927125506073 [2024-05-12 12:59:52,332 INFO L175 Difference]: Start difference. First operand has 223 places, 469 transitions, 7335 flow. Second operand 13 states and 222 transitions. [2024-05-12 12:59:52,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 525 transitions, 8876 flow [2024-05-12 12:59:52,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 525 transitions, 8734 flow, removed 62 selfloop flow, removed 3 redundant places. [2024-05-12 12:59:52,534 INFO L231 Difference]: Finished difference. Result has 234 places, 479 transitions, 7544 flow [2024-05-12 12:59:52,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=7211, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7544, PETRI_PLACES=234, PETRI_TRANSITIONS=479} [2024-05-12 12:59:52,534 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places. [2024-05-12 12:59:52,534 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 479 transitions, 7544 flow [2024-05-12 12:59:52,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:52,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:52,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:52,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 12:59:52,535 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:52,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:52,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1213836078, now seen corresponding path program 2 times [2024-05-12 12:59:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:52,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730158425] [2024-05-12 12:59:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:53,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:53,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730158425] [2024-05-12 12:59:53,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730158425] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:53,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:53,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:59:53,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980267901] [2024-05-12 12:59:53,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:53,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:59:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:53,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:59:53,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:59:53,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:53,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 479 transitions, 7544 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:53,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:53,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:53,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:54,437 INFO L124 PetriNetUnfolderBase]: 2074/4168 cut-off events. [2024-05-12 12:59:54,437 INFO L125 PetriNetUnfolderBase]: For 63202/63202 co-relation queries the response was YES. [2024-05-12 12:59:54,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27432 conditions, 4168 events. 2074/4168 cut-off events. For 63202/63202 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 31764 event pairs, 459 based on Foata normal form. 2/3971 useless extension candidates. Maximal degree in co-relation 27321. Up to 2892 conditions per place. [2024-05-12 12:59:54,477 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 430 selfloop transitions, 93 changer transitions 0/530 dead transitions. [2024-05-12 12:59:54,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 530 transitions, 9071 flow [2024-05-12 12:59:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:59:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:59:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-05-12 12:59:54,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789473684210526 [2024-05-12 12:59:54,478 INFO L175 Difference]: Start difference. First operand has 234 places, 479 transitions, 7544 flow. Second operand 10 states and 182 transitions. [2024-05-12 12:59:54,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 530 transitions, 9071 flow [2024-05-12 12:59:54,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 530 transitions, 8914 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-05-12 12:59:54,648 INFO L231 Difference]: Finished difference. Result has 237 places, 484 transitions, 7654 flow [2024-05-12 12:59:54,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=7387, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7654, PETRI_PLACES=237, PETRI_TRANSITIONS=484} [2024-05-12 12:59:54,649 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 195 predicate places. [2024-05-12 12:59:54,649 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 484 transitions, 7654 flow [2024-05-12 12:59:54,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:54,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:54,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:54,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 12:59:54,650 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:54,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1960870733, now seen corresponding path program 2 times [2024-05-12 12:59:54,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:54,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901063636] [2024-05-12 12:59:54,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:54,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:55,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:55,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901063636] [2024-05-12 12:59:55,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901063636] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:55,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:55,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:59:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181018180] [2024-05-12 12:59:55,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:55,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:59:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:55,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:59:55,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:59:55,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:55,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 484 transitions, 7654 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:55,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:55,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:55,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:56,501 INFO L124 PetriNetUnfolderBase]: 2071/4176 cut-off events. [2024-05-12 12:59:56,501 INFO L125 PetriNetUnfolderBase]: For 64646/64646 co-relation queries the response was YES. [2024-05-12 12:59:56,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27555 conditions, 4176 events. 2071/4176 cut-off events. For 64646/64646 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 31946 event pairs, 459 based on Foata normal form. 1/3975 useless extension candidates. Maximal degree in co-relation 27443. Up to 2973 conditions per place. [2024-05-12 12:59:56,533 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 423 selfloop transitions, 88 changer transitions 0/518 dead transitions. [2024-05-12 12:59:56,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 518 transitions, 8923 flow [2024-05-12 12:59:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-05-12 12:59:56,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47953216374269003 [2024-05-12 12:59:56,534 INFO L175 Difference]: Start difference. First operand has 237 places, 484 transitions, 7654 flow. Second operand 9 states and 164 transitions. [2024-05-12 12:59:56,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 518 transitions, 8923 flow [2024-05-12 12:59:56,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 518 transitions, 8734 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-05-12 12:59:56,691 INFO L231 Difference]: Finished difference. Result has 240 places, 484 transitions, 7672 flow [2024-05-12 12:59:56,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=7465, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7672, PETRI_PLACES=240, PETRI_TRANSITIONS=484} [2024-05-12 12:59:56,691 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places. [2024-05-12 12:59:56,691 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 484 transitions, 7672 flow [2024-05-12 12:59:56,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:56,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:56,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:56,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 12:59:56,692 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:56,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash 363016193, now seen corresponding path program 1 times [2024-05-12 12:59:56,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:56,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922236667] [2024-05-12 12:59:56,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:56,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922236667] [2024-05-12 12:59:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922236667] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:57,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:59:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302190060] [2024-05-12 12:59:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:57,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:59:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:57,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:59:57,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:59:57,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:57,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 484 transitions, 7672 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:57,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:57,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:57,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:59:58,926 INFO L124 PetriNetUnfolderBase]: 2205/4424 cut-off events. [2024-05-12 12:59:58,926 INFO L125 PetriNetUnfolderBase]: For 69145/69145 co-relation queries the response was YES. [2024-05-12 12:59:58,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28660 conditions, 4424 events. 2205/4424 cut-off events. For 69145/69145 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 34360 event pairs, 388 based on Foata normal form. 2/4218 useless extension candidates. Maximal degree in co-relation 28548. Up to 2187 conditions per place. [2024-05-12 12:59:58,969 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 366 selfloop transitions, 186 changer transitions 0/559 dead transitions. [2024-05-12 12:59:58,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 559 transitions, 9559 flow [2024-05-12 12:59:58,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:59:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:59:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-05-12 12:59:58,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2024-05-12 12:59:58,970 INFO L175 Difference]: Start difference. First operand has 240 places, 484 transitions, 7672 flow. Second operand 9 states and 177 transitions. [2024-05-12 12:59:58,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 559 transitions, 9559 flow [2024-05-12 12:59:59,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 559 transitions, 9348 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:59:59,155 INFO L231 Difference]: Finished difference. Result has 243 places, 508 transitions, 8248 flow [2024-05-12 12:59:59,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=7464, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8248, PETRI_PLACES=243, PETRI_TRANSITIONS=508} [2024-05-12 12:59:59,155 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 201 predicate places. [2024-05-12 12:59:59,155 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 508 transitions, 8248 flow [2024-05-12 12:59:59,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:59,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:59:59,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:59:59,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 12:59:59,156 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:59:59,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:59:59,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1139029668, now seen corresponding path program 3 times [2024-05-12 12:59:59,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:59:59,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063661530] [2024-05-12 12:59:59,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:59:59,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:59:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:59:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:59:59,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:59:59,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063661530] [2024-05-12 12:59:59,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063661530] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:59:59,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:59:59,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:59:59,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945679537] [2024-05-12 12:59:59,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:59:59,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:59:59,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:59:59,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:59:59,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:59:59,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 12:59:59,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 508 transitions, 8248 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:59:59,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:59:59,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 12:59:59,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:01,080 INFO L124 PetriNetUnfolderBase]: 2273/4464 cut-off events. [2024-05-12 13:00:01,080 INFO L125 PetriNetUnfolderBase]: For 76375/76375 co-relation queries the response was YES. [2024-05-12 13:00:01,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30518 conditions, 4464 events. 2273/4464 cut-off events. For 76375/76375 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 34313 event pairs, 375 based on Foata normal form. 2/4269 useless extension candidates. Maximal degree in co-relation 30404. Up to 2062 conditions per place. [2024-05-12 13:00:01,129 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 407 selfloop transitions, 168 changer transitions 0/582 dead transitions. [2024-05-12 13:00:01,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 582 transitions, 10282 flow [2024-05-12 13:00:01,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:00:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:00:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-05-12 13:00:01,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2024-05-12 13:00:01,130 INFO L175 Difference]: Start difference. First operand has 243 places, 508 transitions, 8248 flow. Second operand 10 states and 192 transitions. [2024-05-12 13:00:01,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 582 transitions, 10282 flow [2024-05-12 13:00:01,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 582 transitions, 10170 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-05-12 13:00:01,389 INFO L231 Difference]: Finished difference. Result has 250 places, 518 transitions, 8711 flow [2024-05-12 13:00:01,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=8136, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8711, PETRI_PLACES=250, PETRI_TRANSITIONS=518} [2024-05-12 13:00:01,390 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 208 predicate places. [2024-05-12 13:00:01,390 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 518 transitions, 8711 flow [2024-05-12 13:00:01,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:01,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:01,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:01,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 13:00:01,391 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:01,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:01,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1139035248, now seen corresponding path program 4 times [2024-05-12 13:00:01,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:01,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136982976] [2024-05-12 13:00:01,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:01,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:02,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:02,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136982976] [2024-05-12 13:00:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136982976] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:02,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:02,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:02,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129626666] [2024-05-12 13:00:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:02,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:02,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:02,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:02,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:02,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:02,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 518 transitions, 8711 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:02,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:02,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:02,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:03,564 INFO L124 PetriNetUnfolderBase]: 2282/4478 cut-off events. [2024-05-12 13:00:03,564 INFO L125 PetriNetUnfolderBase]: For 80766/80766 co-relation queries the response was YES. [2024-05-12 13:00:03,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31464 conditions, 4478 events. 2282/4478 cut-off events. For 80766/80766 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 34356 event pairs, 378 based on Foata normal form. 2/4283 useless extension candidates. Maximal degree in co-relation 31348. Up to 2073 conditions per place. [2024-05-12 13:00:03,605 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 424 selfloop transitions, 153 changer transitions 0/584 dead transitions. [2024-05-12 13:00:03,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 584 transitions, 10647 flow [2024-05-12 13:00:03,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:00:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:00:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-05-12 13:00:03,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078947368421053 [2024-05-12 13:00:03,606 INFO L175 Difference]: Start difference. First operand has 250 places, 518 transitions, 8711 flow. Second operand 10 states and 193 transitions. [2024-05-12 13:00:03,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 584 transitions, 10647 flow [2024-05-12 13:00:03,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 584 transitions, 10502 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-05-12 13:00:03,848 INFO L231 Difference]: Finished difference. Result has 256 places, 520 transitions, 8917 flow [2024-05-12 13:00:03,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=8574, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8917, PETRI_PLACES=256, PETRI_TRANSITIONS=520} [2024-05-12 13:00:03,849 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 214 predicate places. [2024-05-12 13:00:03,849 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 520 transitions, 8917 flow [2024-05-12 13:00:03,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:03,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:03,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:03,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 13:00:03,849 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:03,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1979388817, now seen corresponding path program 3 times [2024-05-12 13:00:03,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:03,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977925536] [2024-05-12 13:00:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:04,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:04,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977925536] [2024-05-12 13:00:04,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977925536] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:04,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:04,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:00:04,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102534041] [2024-05-12 13:00:04,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:04,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:00:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:04,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:00:04,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:00:04,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:04,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 520 transitions, 8917 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:04,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:04,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:04,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:05,879 INFO L124 PetriNetUnfolderBase]: 2338/4653 cut-off events. [2024-05-12 13:00:05,879 INFO L125 PetriNetUnfolderBase]: For 84699/84699 co-relation queries the response was YES. [2024-05-12 13:00:05,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32650 conditions, 4653 events. 2338/4653 cut-off events. For 84699/84699 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 36593 event pairs, 610 based on Foata normal form. 1/4442 useless extension candidates. Maximal degree in co-relation 32532. Up to 3483 conditions per place. [2024-05-12 13:00:05,927 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 490 selfloop transitions, 80 changer transitions 0/577 dead transitions. [2024-05-12 13:00:05,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 577 transitions, 10654 flow [2024-05-12 13:00:05,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:00:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:00:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-05-12 13:00:05,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4619883040935672 [2024-05-12 13:00:05,929 INFO L175 Difference]: Start difference. First operand has 256 places, 520 transitions, 8917 flow. Second operand 9 states and 158 transitions. [2024-05-12 13:00:05,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 577 transitions, 10654 flow [2024-05-12 13:00:06,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 577 transitions, 10352 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-05-12 13:00:06,197 INFO L231 Difference]: Finished difference. Result has 259 places, 541 transitions, 9221 flow [2024-05-12 13:00:06,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=8638, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9221, PETRI_PLACES=259, PETRI_TRANSITIONS=541} [2024-05-12 13:00:06,198 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places. [2024-05-12 13:00:06,198 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 541 transitions, 9221 flow [2024-05-12 13:00:06,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:06,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:06,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:06,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 13:00:06,198 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:06,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:06,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1979298452, now seen corresponding path program 5 times [2024-05-12 13:00:06,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:06,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223606362] [2024-05-12 13:00:06,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:06,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:07,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:07,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223606362] [2024-05-12 13:00:07,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223606362] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:07,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:07,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:07,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74990643] [2024-05-12 13:00:07,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:07,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:07,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:07,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:07,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:07,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:07,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 541 transitions, 9221 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:07,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:07,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:07,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:08,421 INFO L124 PetriNetUnfolderBase]: 2373/4735 cut-off events. [2024-05-12 13:00:08,421 INFO L125 PetriNetUnfolderBase]: For 85689/85689 co-relation queries the response was YES. [2024-05-12 13:00:08,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32937 conditions, 4735 events. 2373/4735 cut-off events. For 85689/85689 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 37507 event pairs, 629 based on Foata normal form. 1/4517 useless extension candidates. Maximal degree in co-relation 32817. Up to 3607 conditions per place. [2024-05-12 13:00:08,472 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 511 selfloop transitions, 74 changer transitions 0/592 dead transitions. [2024-05-12 13:00:08,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 592 transitions, 10813 flow [2024-05-12 13:00:08,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:00:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:00:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-05-12 13:00:08,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2024-05-12 13:00:08,473 INFO L175 Difference]: Start difference. First operand has 259 places, 541 transitions, 9221 flow. Second operand 10 states and 172 transitions. [2024-05-12 13:00:08,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 592 transitions, 10813 flow [2024-05-12 13:00:08,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 592 transitions, 10714 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-05-12 13:00:08,742 INFO L231 Difference]: Finished difference. Result has 264 places, 552 transitions, 9460 flow [2024-05-12 13:00:08,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=9122, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9460, PETRI_PLACES=264, PETRI_TRANSITIONS=552} [2024-05-12 13:00:08,743 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-05-12 13:00:08,743 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 552 transitions, 9460 flow [2024-05-12 13:00:08,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:08,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:08,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:08,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 13:00:08,743 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:08,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1975573802, now seen corresponding path program 6 times [2024-05-12 13:00:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:08,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104416142] [2024-05-12 13:00:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:09,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:09,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104416142] [2024-05-12 13:00:09,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104416142] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:09,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:09,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:09,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161368842] [2024-05-12 13:00:09,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:09,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:09,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:09,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:09,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:09,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:09,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 552 transitions, 9460 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:09,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:09,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:09,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:10,741 INFO L124 PetriNetUnfolderBase]: 2651/5237 cut-off events. [2024-05-12 13:00:10,741 INFO L125 PetriNetUnfolderBase]: For 105144/105144 co-relation queries the response was YES. [2024-05-12 13:00:10,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37180 conditions, 5237 events. 2651/5237 cut-off events. For 105144/105144 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 41723 event pairs, 563 based on Foata normal form. 2/5005 useless extension candidates. Maximal degree in co-relation 37059. Up to 2875 conditions per place. [2024-05-12 13:00:10,796 INFO L140 encePairwiseOnDemand]: 24/38 looper letters, 452 selfloop transitions, 195 changer transitions 0/654 dead transitions. [2024-05-12 13:00:10,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 654 transitions, 12280 flow [2024-05-12 13:00:10,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:00:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:00:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-05-12 13:00:10,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078947368421053 [2024-05-12 13:00:10,798 INFO L175 Difference]: Start difference. First operand has 264 places, 552 transitions, 9460 flow. Second operand 10 states and 193 transitions. [2024-05-12 13:00:10,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 654 transitions, 12280 flow [2024-05-12 13:00:11,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 654 transitions, 12144 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-05-12 13:00:11,161 INFO L231 Difference]: Finished difference. Result has 271 places, 591 transitions, 10604 flow [2024-05-12 13:00:11,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=9324, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10604, PETRI_PLACES=271, PETRI_TRANSITIONS=591} [2024-05-12 13:00:11,162 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 229 predicate places. [2024-05-12 13:00:11,162 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 591 transitions, 10604 flow [2024-05-12 13:00:11,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:11,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:11,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:11,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 13:00:11,164 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:11,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:11,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1975579382, now seen corresponding path program 7 times [2024-05-12 13:00:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:11,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143030094] [2024-05-12 13:00:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:11,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:11,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:11,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143030094] [2024-05-12 13:00:11,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143030094] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:11,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:11,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:11,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794555218] [2024-05-12 13:00:11,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:11,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:11,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:11,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:11,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:11,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:11,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 591 transitions, 10604 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:11,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:11,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:11,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:13,189 INFO L124 PetriNetUnfolderBase]: 2649/5303 cut-off events. [2024-05-12 13:00:13,189 INFO L125 PetriNetUnfolderBase]: For 113744/113744 co-relation queries the response was YES. [2024-05-12 13:00:13,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38581 conditions, 5303 events. 2649/5303 cut-off events. For 113744/113744 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 42976 event pairs, 555 based on Foata normal form. 1/5050 useless extension candidates. Maximal degree in co-relation 38456. Up to 3264 conditions per place. [2024-05-12 13:00:13,249 INFO L140 encePairwiseOnDemand]: 24/38 looper letters, 498 selfloop transitions, 152 changer transitions 0/657 dead transitions. [2024-05-12 13:00:13,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 657 transitions, 12795 flow [2024-05-12 13:00:13,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:00:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:00:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-05-12 13:00:13,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2024-05-12 13:00:13,256 INFO L175 Difference]: Start difference. First operand has 271 places, 591 transitions, 10604 flow. Second operand 10 states and 188 transitions. [2024-05-12 13:00:13,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 657 transitions, 12795 flow [2024-05-12 13:00:13,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 657 transitions, 12625 flow, removed 70 selfloop flow, removed 3 redundant places. [2024-05-12 13:00:13,689 INFO L231 Difference]: Finished difference. Result has 280 places, 606 transitions, 11185 flow [2024-05-12 13:00:13,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=10476, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11185, PETRI_PLACES=280, PETRI_TRANSITIONS=606} [2024-05-12 13:00:13,690 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 238 predicate places. [2024-05-12 13:00:13,690 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 606 transitions, 11185 flow [2024-05-12 13:00:13,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:13,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:13,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:13,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 13:00:13,690 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:13,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:13,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1975579537, now seen corresponding path program 4 times [2024-05-12 13:00:13,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:13,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646831496] [2024-05-12 13:00:13,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:13,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:14,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646831496] [2024-05-12 13:00:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646831496] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:14,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:14,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:14,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881407930] [2024-05-12 13:00:14,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:14,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:14,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:14,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:14,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:14,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:14,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 606 transitions, 11185 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:14,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:14,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:14,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:16,195 INFO L124 PetriNetUnfolderBase]: 2647/5284 cut-off events. [2024-05-12 13:00:16,195 INFO L125 PetriNetUnfolderBase]: For 119232/119232 co-relation queries the response was YES. [2024-05-12 13:00:16,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39297 conditions, 5284 events. 2647/5284 cut-off events. For 119232/119232 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 42727 event pairs, 619 based on Foata normal form. 1/5035 useless extension candidates. Maximal degree in co-relation 39168. Up to 3860 conditions per place. [2024-05-12 13:00:16,246 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 528 selfloop transitions, 113 changer transitions 0/648 dead transitions. [2024-05-12 13:00:16,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 648 transitions, 12827 flow [2024-05-12 13:00:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:00:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:00:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-05-12 13:00:16,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46578947368421053 [2024-05-12 13:00:16,247 INFO L175 Difference]: Start difference. First operand has 280 places, 606 transitions, 11185 flow. Second operand 10 states and 177 transitions. [2024-05-12 13:00:16,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 648 transitions, 12827 flow [2024-05-12 13:00:16,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 648 transitions, 12620 flow, removed 49 selfloop flow, removed 5 redundant places. [2024-05-12 13:00:16,651 INFO L231 Difference]: Finished difference. Result has 285 places, 606 transitions, 11215 flow [2024-05-12 13:00:16,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=10978, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11215, PETRI_PLACES=285, PETRI_TRANSITIONS=606} [2024-05-12 13:00:16,652 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places. [2024-05-12 13:00:16,652 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 606 transitions, 11215 flow [2024-05-12 13:00:16,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:16,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:16,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:16,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 13:00:16,652 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:16,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:16,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1959225290, now seen corresponding path program 8 times [2024-05-12 13:00:16,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:16,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174411517] [2024-05-12 13:00:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:17,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:17,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174411517] [2024-05-12 13:00:17,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174411517] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:17,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:17,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391396313] [2024-05-12 13:00:17,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:17,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:17,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:17,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 606 transitions, 11215 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:17,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:17,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:17,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:18,906 INFO L124 PetriNetUnfolderBase]: 2692/5365 cut-off events. [2024-05-12 13:00:18,907 INFO L125 PetriNetUnfolderBase]: For 122958/122958 co-relation queries the response was YES. [2024-05-12 13:00:18,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40095 conditions, 5365 events. 2692/5365 cut-off events. For 122958/122958 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 43479 event pairs, 658 based on Foata normal form. 1/5114 useless extension candidates. Maximal degree in co-relation 39964. Up to 3808 conditions per place. [2024-05-12 13:00:18,964 INFO L140 encePairwiseOnDemand]: 24/38 looper letters, 556 selfloop transitions, 98 changer transitions 0/661 dead transitions. [2024-05-12 13:00:18,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 661 transitions, 13253 flow [2024-05-12 13:00:18,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:00:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:00:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-05-12 13:00:18,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2024-05-12 13:00:18,965 INFO L175 Difference]: Start difference. First operand has 285 places, 606 transitions, 11215 flow. Second operand 10 states and 188 transitions. [2024-05-12 13:00:18,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 661 transitions, 13253 flow [2024-05-12 13:00:19,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 661 transitions, 12918 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-05-12 13:00:19,333 INFO L231 Difference]: Finished difference. Result has 287 places, 615 transitions, 11326 flow [2024-05-12 13:00:19,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=10882, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11326, PETRI_PLACES=287, PETRI_TRANSITIONS=615} [2024-05-12 13:00:19,334 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 245 predicate places. [2024-05-12 13:00:19,334 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 615 transitions, 11326 flow [2024-05-12 13:00:19,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:19,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:19,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:19,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 13:00:19,334 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:19,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:19,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1831683272, now seen corresponding path program 9 times [2024-05-12 13:00:19,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:19,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513830704] [2024-05-12 13:00:19,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:19,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:20,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:20,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513830704] [2024-05-12 13:00:20,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513830704] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:20,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:20,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:20,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886534509] [2024-05-12 13:00:20,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:20,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:20,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:20,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:20,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:20,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:20,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 615 transitions, 11326 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:20,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:20,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:20,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:21,521 INFO L124 PetriNetUnfolderBase]: 2713/5420 cut-off events. [2024-05-12 13:00:21,521 INFO L125 PetriNetUnfolderBase]: For 124194/124194 co-relation queries the response was YES. [2024-05-12 13:00:21,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40594 conditions, 5420 events. 2713/5420 cut-off events. For 124194/124194 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 44096 event pairs, 623 based on Foata normal form. 1/5164 useless extension candidates. Maximal degree in co-relation 40461. Up to 3832 conditions per place. [2024-05-12 13:00:21,584 INFO L140 encePairwiseOnDemand]: 24/38 looper letters, 561 selfloop transitions, 97 changer transitions 0/665 dead transitions. [2024-05-12 13:00:21,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 665 transitions, 13294 flow [2024-05-12 13:00:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:00:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:00:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-05-12 13:00:21,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4921052631578947 [2024-05-12 13:00:21,585 INFO L175 Difference]: Start difference. First operand has 287 places, 615 transitions, 11326 flow. Second operand 10 states and 187 transitions. [2024-05-12 13:00:21,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 665 transitions, 13294 flow [2024-05-12 13:00:22,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 665 transitions, 13103 flow, removed 54 selfloop flow, removed 5 redundant places. [2024-05-12 13:00:22,070 INFO L231 Difference]: Finished difference. Result has 292 places, 619 transitions, 11452 flow [2024-05-12 13:00:22,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=11161, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11452, PETRI_PLACES=292, PETRI_TRANSITIONS=619} [2024-05-12 13:00:22,070 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 250 predicate places. [2024-05-12 13:00:22,070 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 619 transitions, 11452 flow [2024-05-12 13:00:22,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:22,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:22,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:22,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 13:00:22,071 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:22,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:22,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1831481462, now seen corresponding path program 10 times [2024-05-12 13:00:22,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:22,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394714669] [2024-05-12 13:00:22,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:22,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:22,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:22,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394714669] [2024-05-12 13:00:22,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394714669] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:22,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:22,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:22,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948365357] [2024-05-12 13:00:22,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:22,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:22,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:22,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:22,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:22,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:22,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 619 transitions, 11452 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:22,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:22,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:22,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:24,372 INFO L124 PetriNetUnfolderBase]: 2707/5402 cut-off events. [2024-05-12 13:00:24,372 INFO L125 PetriNetUnfolderBase]: For 124322/124322 co-relation queries the response was YES. [2024-05-12 13:00:24,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40458 conditions, 5402 events. 2707/5402 cut-off events. For 124322/124322 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 43959 event pairs, 638 based on Foata normal form. 3/5150 useless extension candidates. Maximal degree in co-relation 40323. Up to 3956 conditions per place. [2024-05-12 13:00:24,435 INFO L140 encePairwiseOnDemand]: 24/38 looper letters, 575 selfloop transitions, 79 changer transitions 0/661 dead transitions. [2024-05-12 13:00:24,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 661 transitions, 13123 flow [2024-05-12 13:00:24,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:00:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:00:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-05-12 13:00:24,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842105263157895 [2024-05-12 13:00:24,436 INFO L175 Difference]: Start difference. First operand has 292 places, 619 transitions, 11452 flow. Second operand 10 states and 184 transitions. [2024-05-12 13:00:24,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 661 transitions, 13123 flow [2024-05-12 13:00:24,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 661 transitions, 12891 flow, removed 39 selfloop flow, removed 7 redundant places. [2024-05-12 13:00:24,985 INFO L231 Difference]: Finished difference. Result has 295 places, 619 transitions, 11390 flow [2024-05-12 13:00:24,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=11220, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11390, PETRI_PLACES=295, PETRI_TRANSITIONS=619} [2024-05-12 13:00:24,986 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 253 predicate places. [2024-05-12 13:00:24,986 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 619 transitions, 11390 flow [2024-05-12 13:00:24,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:24,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:24,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:24,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 13:00:24,986 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:24,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:24,987 INFO L85 PathProgramCache]: Analyzing trace with hash 437276772, now seen corresponding path program 11 times [2024-05-12 13:00:24,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:24,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526178224] [2024-05-12 13:00:24,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:24,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:25,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526178224] [2024-05-12 13:00:25,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526178224] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:25,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970267651] [2024-05-12 13:00:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:25,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:25,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:26,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:26,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 619 transitions, 11390 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:26,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:26,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:26,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:27,392 INFO L124 PetriNetUnfolderBase]: 2711/5469 cut-off events. [2024-05-12 13:00:27,392 INFO L125 PetriNetUnfolderBase]: For 121179/121179 co-relation queries the response was YES. [2024-05-12 13:00:27,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40279 conditions, 5469 events. 2711/5469 cut-off events. For 121179/121179 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 44420 event pairs, 648 based on Foata normal form. 1/5203 useless extension candidates. Maximal degree in co-relation 40143. Up to 3929 conditions per place. [2024-05-12 13:00:27,448 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 517 selfloop transitions, 134 changer transitions 0/658 dead transitions. [2024-05-12 13:00:27,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 658 transitions, 13051 flow [2024-05-12 13:00:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:00:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:00:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-05-12 13:00:27,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4678362573099415 [2024-05-12 13:00:27,449 INFO L175 Difference]: Start difference. First operand has 295 places, 619 transitions, 11390 flow. Second operand 9 states and 160 transitions. [2024-05-12 13:00:27,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 658 transitions, 13051 flow [2024-05-12 13:00:27,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 658 transitions, 12895 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-05-12 13:00:27,857 INFO L231 Difference]: Finished difference. Result has 296 places, 623 transitions, 11638 flow [2024-05-12 13:00:27,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=11234, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11638, PETRI_PLACES=296, PETRI_TRANSITIONS=623} [2024-05-12 13:00:27,858 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 254 predicate places. [2024-05-12 13:00:27,858 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 623 transitions, 11638 flow [2024-05-12 13:00:27,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:27,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:27,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:27,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 13:00:27,858 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:27,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:27,858 INFO L85 PathProgramCache]: Analyzing trace with hash 441001422, now seen corresponding path program 12 times [2024-05-12 13:00:27,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:27,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339969774] [2024-05-12 13:00:27,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:28,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:28,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339969774] [2024-05-12 13:00:28,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339969774] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:28,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:28,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:28,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560497866] [2024-05-12 13:00:28,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:28,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:28,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:28,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:28,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:28,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:28,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 623 transitions, 11638 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:28,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:28,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:28,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:30,269 INFO L124 PetriNetUnfolderBase]: 2784/5545 cut-off events. [2024-05-12 13:00:30,269 INFO L125 PetriNetUnfolderBase]: For 130395/130395 co-relation queries the response was YES. [2024-05-12 13:00:30,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41838 conditions, 5545 events. 2784/5545 cut-off events. For 130395/130395 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 44723 event pairs, 359 based on Foata normal form. 1/5279 useless extension candidates. Maximal degree in co-relation 41701. Up to 2497 conditions per place. [2024-05-12 13:00:30,332 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 398 selfloop transitions, 284 changer transitions 0/689 dead transitions. [2024-05-12 13:00:30,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 689 transitions, 14098 flow [2024-05-12 13:00:30,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:00:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:00:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-05-12 13:00:30,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029239766081871 [2024-05-12 13:00:30,333 INFO L175 Difference]: Start difference. First operand has 296 places, 623 transitions, 11638 flow. Second operand 9 states and 172 transitions. [2024-05-12 13:00:30,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 689 transitions, 14098 flow [2024-05-12 13:00:30,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 689 transitions, 13780 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-05-12 13:00:30,801 INFO L231 Difference]: Finished difference. Result has 299 places, 639 transitions, 12519 flow [2024-05-12 13:00:30,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=11324, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12519, PETRI_PLACES=299, PETRI_TRANSITIONS=639} [2024-05-12 13:00:30,801 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places. [2024-05-12 13:00:30,802 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 639 transitions, 12519 flow [2024-05-12 13:00:30,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:30,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:30,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:30,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 13:00:30,802 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:30,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash -650788727, now seen corresponding path program 2 times [2024-05-12 13:00:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:30,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418642855] [2024-05-12 13:00:30,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:30,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:32,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:32,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418642855] [2024-05-12 13:00:32,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418642855] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:32,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:32,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:32,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860047753] [2024-05-12 13:00:32,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:32,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:32,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:32,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:32,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:32,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:32,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 639 transitions, 12519 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:32,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:32,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:32,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:33,673 INFO L124 PetriNetUnfolderBase]: 2882/5730 cut-off events. [2024-05-12 13:00:33,673 INFO L125 PetriNetUnfolderBase]: For 144620/144620 co-relation queries the response was YES. [2024-05-12 13:00:33,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44529 conditions, 5730 events. 2882/5730 cut-off events. For 144620/144620 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 46852 event pairs, 486 based on Foata normal form. 2/5467 useless extension candidates. Maximal degree in co-relation 44390. Up to 3334 conditions per place. [2024-05-12 13:00:33,738 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 490 selfloop transitions, 197 changer transitions 0/694 dead transitions. [2024-05-12 13:00:33,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 694 transitions, 14542 flow [2024-05-12 13:00:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:00:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:00:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-05-12 13:00:33,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49415204678362573 [2024-05-12 13:00:33,739 INFO L175 Difference]: Start difference. First operand has 299 places, 639 transitions, 12519 flow. Second operand 9 states and 169 transitions. [2024-05-12 13:00:33,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 694 transitions, 14542 flow [2024-05-12 13:00:34,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 694 transitions, 14357 flow, removed 46 selfloop flow, removed 3 redundant places. [2024-05-12 13:00:34,272 INFO L231 Difference]: Finished difference. Result has 305 places, 649 transitions, 12854 flow [2024-05-12 13:00:34,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=12334, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12854, PETRI_PLACES=305, PETRI_TRANSITIONS=649} [2024-05-12 13:00:34,273 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 263 predicate places. [2024-05-12 13:00:34,273 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 649 transitions, 12854 flow [2024-05-12 13:00:34,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:34,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:34,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:34,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 13:00:34,273 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:34,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:34,274 INFO L85 PathProgramCache]: Analyzing trace with hash 440995687, now seen corresponding path program 5 times [2024-05-12 13:00:34,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:34,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200855037] [2024-05-12 13:00:34,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:34,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:35,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:35,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200855037] [2024-05-12 13:00:35,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200855037] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:35,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:35,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:35,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394955825] [2024-05-12 13:00:35,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:35,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:35,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:35,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:35,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:35,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:35,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 649 transitions, 12854 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:35,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:35,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:35,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:37,431 INFO L124 PetriNetUnfolderBase]: 2903/5842 cut-off events. [2024-05-12 13:00:37,431 INFO L125 PetriNetUnfolderBase]: For 148465/148465 co-relation queries the response was YES. [2024-05-12 13:00:37,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45480 conditions, 5842 events. 2903/5842 cut-off events. For 148465/148465 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 48049 event pairs, 540 based on Foata normal form. 1/5546 useless extension candidates. Maximal degree in co-relation 45339. Up to 3943 conditions per place. [2024-05-12 13:00:37,498 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 498 selfloop transitions, 189 changer transitions 0/694 dead transitions. [2024-05-12 13:00:37,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 694 transitions, 14739 flow [2024-05-12 13:00:37,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:00:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:00:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-05-12 13:00:37,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-05-12 13:00:37,501 INFO L175 Difference]: Start difference. First operand has 305 places, 649 transitions, 12854 flow. Second operand 9 states and 162 transitions. [2024-05-12 13:00:37,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 694 transitions, 14739 flow [2024-05-12 13:00:38,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 694 transitions, 14579 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-05-12 13:00:38,082 INFO L231 Difference]: Finished difference. Result has 309 places, 655 transitions, 13219 flow [2024-05-12 13:00:38,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=12694, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13219, PETRI_PLACES=309, PETRI_TRANSITIONS=655} [2024-05-12 13:00:38,083 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 267 predicate places. [2024-05-12 13:00:38,083 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 655 transitions, 13219 flow [2024-05-12 13:00:38,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:38,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:38,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:38,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 13:00:38,083 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:38,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:38,084 INFO L85 PathProgramCache]: Analyzing trace with hash 440995842, now seen corresponding path program 13 times [2024-05-12 13:00:38,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:38,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898118700] [2024-05-12 13:00:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:38,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:38,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:38,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898118700] [2024-05-12 13:00:38,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898118700] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:38,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:38,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:38,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090511301] [2024-05-12 13:00:38,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:38,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:38,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:38,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:38,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:38,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:38,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 655 transitions, 13219 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:38,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:38,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:38,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:40,356 INFO L124 PetriNetUnfolderBase]: 3021/5816 cut-off events. [2024-05-12 13:00:40,357 INFO L125 PetriNetUnfolderBase]: For 161544/161544 co-relation queries the response was YES. [2024-05-12 13:00:40,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47952 conditions, 5816 events. 3021/5816 cut-off events. For 161544/161544 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 46187 event pairs, 341 based on Foata normal form. 3/5580 useless extension candidates. Maximal degree in co-relation 47809. Up to 1909 conditions per place. [2024-05-12 13:00:40,428 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 366 selfloop transitions, 359 changer transitions 0/732 dead transitions. [2024-05-12 13:00:40,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 732 transitions, 16128 flow [2024-05-12 13:00:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:00:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:00:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-05-12 13:00:40,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52046783625731 [2024-05-12 13:00:40,429 INFO L175 Difference]: Start difference. First operand has 309 places, 655 transitions, 13219 flow. Second operand 9 states and 178 transitions. [2024-05-12 13:00:40,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 732 transitions, 16128 flow [2024-05-12 13:00:41,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 732 transitions, 15673 flow, removed 43 selfloop flow, removed 8 redundant places. [2024-05-12 13:00:41,090 INFO L231 Difference]: Finished difference. Result has 311 places, 682 transitions, 14322 flow [2024-05-12 13:00:41,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=12770, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=334, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14322, PETRI_PLACES=311, PETRI_TRANSITIONS=682} [2024-05-12 13:00:41,091 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 269 predicate places. [2024-05-12 13:00:41,091 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 682 transitions, 14322 flow [2024-05-12 13:00:41,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:41,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:41,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:41,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-12 13:00:41,091 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:41,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:41,092 INFO L85 PathProgramCache]: Analyzing trace with hash 585093762, now seen corresponding path program 14 times [2024-05-12 13:00:41,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:41,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533368985] [2024-05-12 13:00:41,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:41,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:41,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:41,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533368985] [2024-05-12 13:00:41,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533368985] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:41,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:41,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:41,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438754756] [2024-05-12 13:00:41,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:41,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:41,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:41,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:41,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:41,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:41,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 682 transitions, 14322 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:41,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:41,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:41,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:43,504 INFO L124 PetriNetUnfolderBase]: 3162/6262 cut-off events. [2024-05-12 13:00:43,504 INFO L125 PetriNetUnfolderBase]: For 187015/187015 co-relation queries the response was YES. [2024-05-12 13:00:43,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51829 conditions, 6262 events. 3162/6262 cut-off events. For 187015/187015 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 51890 event pairs, 698 based on Foata normal form. 9/5980 useless extension candidates. Maximal degree in co-relation 51685. Up to 4270 conditions per place. [2024-05-12 13:00:43,591 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 626 selfloop transitions, 123 changer transitions 0/756 dead transitions. [2024-05-12 13:00:43,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 756 transitions, 16958 flow [2024-05-12 13:00:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:00:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:00:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-05-12 13:00:43,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48830409356725146 [2024-05-12 13:00:43,592 INFO L175 Difference]: Start difference. First operand has 311 places, 682 transitions, 14322 flow. Second operand 9 states and 167 transitions. [2024-05-12 13:00:43,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 756 transitions, 16958 flow [2024-05-12 13:00:44,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 756 transitions, 16685 flow, removed 100 selfloop flow, removed 4 redundant places. [2024-05-12 13:00:44,269 INFO L231 Difference]: Finished difference. Result has 316 places, 703 transitions, 14912 flow [2024-05-12 13:00:44,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=14053, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14912, PETRI_PLACES=316, PETRI_TRANSITIONS=703} [2024-05-12 13:00:44,269 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 274 predicate places. [2024-05-12 13:00:44,270 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 703 transitions, 14912 flow [2024-05-12 13:00:44,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:44,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:44,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:44,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-05-12 13:00:44,270 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:44,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:44,270 INFO L85 PathProgramCache]: Analyzing trace with hash 585093979, now seen corresponding path program 3 times [2024-05-12 13:00:44,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:44,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786865891] [2024-05-12 13:00:44,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:44,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:45,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786865891] [2024-05-12 13:00:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786865891] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:45,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:45,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:45,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263359454] [2024-05-12 13:00:45,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:45,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:45,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:45,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:45,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:45,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:45,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 703 transitions, 14912 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:45,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:45,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:45,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:47,020 INFO L124 PetriNetUnfolderBase]: 3220/6391 cut-off events. [2024-05-12 13:00:47,020 INFO L125 PetriNetUnfolderBase]: For 177558/177558 co-relation queries the response was YES. [2024-05-12 13:00:47,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52616 conditions, 6391 events. 3220/6391 cut-off events. For 177558/177558 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 53076 event pairs, 739 based on Foata normal form. 2/6092 useless extension candidates. Maximal degree in co-relation 52471. Up to 4542 conditions per place. [2024-05-12 13:00:47,103 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 649 selfloop transitions, 104 changer transitions 0/760 dead transitions. [2024-05-12 13:00:47,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 760 transitions, 17036 flow [2024-05-12 13:00:47,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:00:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:00:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-05-12 13:00:47,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824561403508772 [2024-05-12 13:00:47,104 INFO L175 Difference]: Start difference. First operand has 316 places, 703 transitions, 14912 flow. Second operand 9 states and 165 transitions. [2024-05-12 13:00:47,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 760 transitions, 17036 flow [2024-05-12 13:00:47,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 760 transitions, 16616 flow, removed 100 selfloop flow, removed 8 redundant places. [2024-05-12 13:00:47,917 INFO L231 Difference]: Finished difference. Result has 317 places, 709 transitions, 14794 flow [2024-05-12 13:00:47,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=14492, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14794, PETRI_PLACES=317, PETRI_TRANSITIONS=709} [2024-05-12 13:00:47,918 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 275 predicate places. [2024-05-12 13:00:47,918 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 709 transitions, 14794 flow [2024-05-12 13:00:47,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:47,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:47,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:47,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-05-12 13:00:47,919 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:47,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash 584886372, now seen corresponding path program 15 times [2024-05-12 13:00:47,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:47,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055847161] [2024-05-12 13:00:47,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:48,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:48,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055847161] [2024-05-12 13:00:48,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055847161] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:48,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:48,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:48,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215732290] [2024-05-12 13:00:48,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:48,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:48,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:48,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:48,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:48,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:48,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 709 transitions, 14794 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:48,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:48,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:48,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:50,738 INFO L124 PetriNetUnfolderBase]: 3359/6582 cut-off events. [2024-05-12 13:00:50,738 INFO L125 PetriNetUnfolderBase]: For 187540/187540 co-relation queries the response was YES. [2024-05-12 13:00:50,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55012 conditions, 6582 events. 3359/6582 cut-off events. For 187540/187540 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 54410 event pairs, 689 based on Foata normal form. 3/6295 useless extension candidates. Maximal degree in co-relation 54867. Up to 4121 conditions per place. [2024-05-12 13:00:50,815 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 587 selfloop transitions, 207 changer transitions 0/801 dead transitions. [2024-05-12 13:00:50,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 801 transitions, 18156 flow [2024-05-12 13:00:50,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:00:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:00:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-05-12 13:00:50,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029239766081871 [2024-05-12 13:00:50,816 INFO L175 Difference]: Start difference. First operand has 317 places, 709 transitions, 14794 flow. Second operand 9 states and 172 transitions. [2024-05-12 13:00:50,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 801 transitions, 18156 flow [2024-05-12 13:00:51,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 801 transitions, 17963 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-05-12 13:00:51,530 INFO L231 Difference]: Finished difference. Result has 320 places, 741 transitions, 16019 flow [2024-05-12 13:00:51,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=14601, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16019, PETRI_PLACES=320, PETRI_TRANSITIONS=741} [2024-05-12 13:00:51,531 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 278 predicate places. [2024-05-12 13:00:51,531 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 741 transitions, 16019 flow [2024-05-12 13:00:51,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:51,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:51,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:51,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-05-12 13:00:51,531 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:51,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:51,531 INFO L85 PathProgramCache]: Analyzing trace with hash 584891952, now seen corresponding path program 16 times [2024-05-12 13:00:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:51,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523124774] [2024-05-12 13:00:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:51,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:52,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:52,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523124774] [2024-05-12 13:00:52,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523124774] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:52,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:52,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:52,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055600820] [2024-05-12 13:00:52,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:52,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:52,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:52,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:52,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:52,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:52,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 741 transitions, 16019 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:52,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:52,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:52,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:54,344 INFO L124 PetriNetUnfolderBase]: 3353/6619 cut-off events. [2024-05-12 13:00:54,344 INFO L125 PetriNetUnfolderBase]: For 190607/190607 co-relation queries the response was YES. [2024-05-12 13:00:54,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55374 conditions, 6619 events. 3353/6619 cut-off events. For 190607/190607 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 55032 event pairs, 712 based on Foata normal form. 3/6319 useless extension candidates. Maximal degree in co-relation 55228. Up to 4116 conditions per place. [2024-05-12 13:00:54,427 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 600 selfloop transitions, 196 changer transitions 0/803 dead transitions. [2024-05-12 13:00:54,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 803 transitions, 18416 flow [2024-05-12 13:00:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:00:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:00:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-05-12 13:00:54,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 13:00:54,428 INFO L175 Difference]: Start difference. First operand has 320 places, 741 transitions, 16019 flow. Second operand 9 states and 171 transitions. [2024-05-12 13:00:54,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 803 transitions, 18416 flow [2024-05-12 13:00:55,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 803 transitions, 17876 flow, removed 192 selfloop flow, removed 6 redundant places. [2024-05-12 13:00:55,209 INFO L231 Difference]: Finished difference. Result has 323 places, 741 transitions, 15903 flow [2024-05-12 13:00:55,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=15479, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15903, PETRI_PLACES=323, PETRI_TRANSITIONS=741} [2024-05-12 13:00:55,210 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 281 predicate places. [2024-05-12 13:00:55,210 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 741 transitions, 15903 flow [2024-05-12 13:00:55,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:55,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:55,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:55,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-05-12 13:00:55,211 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:55,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash 584892169, now seen corresponding path program 4 times [2024-05-12 13:00:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:55,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730075774] [2024-05-12 13:00:55,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:55,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:00:56,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:00:56,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:00:56,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730075774] [2024-05-12 13:00:56,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730075774] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:00:56,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:00:56,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:00:56,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702304277] [2024-05-12 13:00:56,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:00:56,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:00:56,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:00:56,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:00:56,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:00:56,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:00:56,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 741 transitions, 15903 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:56,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:00:56,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:00:56,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:00:58,455 INFO L124 PetriNetUnfolderBase]: 3389/6751 cut-off events. [2024-05-12 13:00:58,456 INFO L125 PetriNetUnfolderBase]: For 186706/186706 co-relation queries the response was YES. [2024-05-12 13:00:58,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55844 conditions, 6751 events. 3389/6751 cut-off events. For 186706/186706 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 56800 event pairs, 753 based on Foata normal form. 2/6430 useless extension candidates. Maximal degree in co-relation 55697. Up to 4622 conditions per place. [2024-05-12 13:00:58,531 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 661 selfloop transitions, 132 changer transitions 0/800 dead transitions. [2024-05-12 13:00:58,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 800 transitions, 18179 flow [2024-05-12 13:00:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:00:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:00:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-05-12 13:00:58,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48830409356725146 [2024-05-12 13:00:58,532 INFO L175 Difference]: Start difference. First operand has 323 places, 741 transitions, 15903 flow. Second operand 9 states and 167 transitions. [2024-05-12 13:00:58,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 800 transitions, 18179 flow [2024-05-12 13:00:59,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 800 transitions, 17650 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-05-12 13:00:59,232 INFO L231 Difference]: Finished difference. Result has 323 places, 745 transitions, 15720 flow [2024-05-12 13:00:59,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=15374, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15720, PETRI_PLACES=323, PETRI_TRANSITIONS=745} [2024-05-12 13:00:59,232 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 281 predicate places. [2024-05-12 13:00:59,232 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 745 transitions, 15720 flow [2024-05-12 13:00:59,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:00:59,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:00:59,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:00:59,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-05-12 13:00:59,233 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:00:59,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:00:59,233 INFO L85 PathProgramCache]: Analyzing trace with hash 260295625, now seen corresponding path program 5 times [2024-05-12 13:00:59,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:00:59,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287277662] [2024-05-12 13:00:59,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:00:59,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:00:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:00,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:00,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287277662] [2024-05-12 13:01:00,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287277662] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:00,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:00,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:01:00,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374909405] [2024-05-12 13:01:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:00,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:01:00,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:00,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:01:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:01:00,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:00,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 745 transitions, 15720 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:00,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:00,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:00,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:02,034 INFO L124 PetriNetUnfolderBase]: 3391/6671 cut-off events. [2024-05-12 13:01:02,034 INFO L125 PetriNetUnfolderBase]: For 179646/179646 co-relation queries the response was YES. [2024-05-12 13:01:02,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55308 conditions, 6671 events. 3391/6671 cut-off events. For 179646/179646 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 55398 event pairs, 1035 based on Foata normal form. 2/6376 useless extension candidates. Maximal degree in co-relation 55161. Up to 5260 conditions per place. [2024-05-12 13:01:02,126 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 745 selfloop transitions, 22 changer transitions 0/774 dead transitions. [2024-05-12 13:01:02,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 774 transitions, 17494 flow [2024-05-12 13:01:02,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:01:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:01:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 13:01:02,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4415204678362573 [2024-05-12 13:01:02,127 INFO L175 Difference]: Start difference. First operand has 323 places, 745 transitions, 15720 flow. Second operand 9 states and 151 transitions. [2024-05-12 13:01:02,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 774 transitions, 17494 flow [2024-05-12 13:01:02,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 774 transitions, 17210 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-05-12 13:01:02,846 INFO L231 Difference]: Finished difference. Result has 325 places, 747 transitions, 15517 flow [2024-05-12 13:01:02,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=15436, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15517, PETRI_PLACES=325, PETRI_TRANSITIONS=747} [2024-05-12 13:01:02,846 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 283 predicate places. [2024-05-12 13:01:02,846 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 747 transitions, 15517 flow [2024-05-12 13:01:02,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:02,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:02,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:02,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-05-12 13:01:02,847 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:02,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash 987204433, now seen corresponding path program 6 times [2024-05-12 13:01:02,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:02,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252025686] [2024-05-12 13:01:02,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:02,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:03,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:03,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252025686] [2024-05-12 13:01:03,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252025686] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:03,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:03,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:01:03,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397726876] [2024-05-12 13:01:03,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:03,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:01:03,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:03,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:01:03,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:01:03,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:03,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 747 transitions, 15517 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:03,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:03,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:03,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:05,585 INFO L124 PetriNetUnfolderBase]: 3427/6775 cut-off events. [2024-05-12 13:01:05,585 INFO L125 PetriNetUnfolderBase]: For 178816/178816 co-relation queries the response was YES. [2024-05-12 13:01:05,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55200 conditions, 6775 events. 3427/6775 cut-off events. For 178816/178816 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 56726 event pairs, 991 based on Foata normal form. 2/6467 useless extension candidates. Maximal degree in co-relation 55052. Up to 5145 conditions per place. [2024-05-12 13:01:05,669 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 743 selfloop transitions, 51 changer transitions 0/801 dead transitions. [2024-05-12 13:01:05,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 801 transitions, 17719 flow [2024-05-12 13:01:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:01:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:01:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-05-12 13:01:05,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649122807017544 [2024-05-12 13:01:05,670 INFO L175 Difference]: Start difference. First operand has 325 places, 747 transitions, 15517 flow. Second operand 9 states and 159 transitions. [2024-05-12 13:01:05,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 801 transitions, 17719 flow [2024-05-12 13:01:06,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 801 transitions, 17650 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-05-12 13:01:06,391 INFO L231 Difference]: Finished difference. Result has 327 places, 751 transitions, 15633 flow [2024-05-12 13:01:06,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=15448, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15633, PETRI_PLACES=327, PETRI_TRANSITIONS=751} [2024-05-12 13:01:06,392 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 285 predicate places. [2024-05-12 13:01:06,392 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 751 transitions, 15633 flow [2024-05-12 13:01:06,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:06,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:06,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:06,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-05-12 13:01:06,393 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:06,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:06,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1330996852, now seen corresponding path program 17 times [2024-05-12 13:01:06,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:06,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611282510] [2024-05-12 13:01:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:06,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:07,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:07,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611282510] [2024-05-12 13:01:07,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611282510] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:07,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:07,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:01:07,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631941777] [2024-05-12 13:01:07,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:07,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:01:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:07,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:01:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:01:07,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:07,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 751 transitions, 15633 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:07,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:07,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:07,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:09,157 INFO L124 PetriNetUnfolderBase]: 3561/6985 cut-off events. [2024-05-12 13:01:09,158 INFO L125 PetriNetUnfolderBase]: For 195108/195108 co-relation queries the response was YES. [2024-05-12 13:01:09,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57711 conditions, 6985 events. 3561/6985 cut-off events. For 195108/195108 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 58413 event pairs, 1019 based on Foata normal form. 6/6682 useless extension candidates. Maximal degree in co-relation 57562. Up to 5237 conditions per place. [2024-05-12 13:01:09,242 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 750 selfloop transitions, 66 changer transitions 0/823 dead transitions. [2024-05-12 13:01:09,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 823 transitions, 18419 flow [2024-05-12 13:01:09,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:01:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:01:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-05-12 13:01:09,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47076023391812866 [2024-05-12 13:01:09,243 INFO L175 Difference]: Start difference. First operand has 327 places, 751 transitions, 15633 flow. Second operand 9 states and 161 transitions. [2024-05-12 13:01:09,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 823 transitions, 18419 flow [2024-05-12 13:01:09,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 823 transitions, 18288 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-05-12 13:01:09,983 INFO L231 Difference]: Finished difference. Result has 329 places, 770 transitions, 16234 flow [2024-05-12 13:01:09,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=15502, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16234, PETRI_PLACES=329, PETRI_TRANSITIONS=770} [2024-05-12 13:01:09,984 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 287 predicate places. [2024-05-12 13:01:09,984 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 770 transitions, 16234 flow [2024-05-12 13:01:09,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:09,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:09,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:09,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-05-12 13:01:09,985 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:09,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash 987002406, now seen corresponding path program 18 times [2024-05-12 13:01:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:09,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196826748] [2024-05-12 13:01:09,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:10,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:10,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196826748] [2024-05-12 13:01:10,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196826748] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:10,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:10,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:01:10,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944373261] [2024-05-12 13:01:10,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:10,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:01:10,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:01:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:01:10,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:10,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 770 transitions, 16234 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:10,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:10,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:10,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:12,821 INFO L124 PetriNetUnfolderBase]: 3625/7170 cut-off events. [2024-05-12 13:01:12,821 INFO L125 PetriNetUnfolderBase]: For 200471/200471 co-relation queries the response was YES. [2024-05-12 13:01:12,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59402 conditions, 7170 events. 3625/7170 cut-off events. For 200471/200471 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 60382 event pairs, 960 based on Foata normal form. 1/6841 useless extension candidates. Maximal degree in co-relation 59252. Up to 5091 conditions per place. [2024-05-12 13:01:12,906 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 729 selfloop transitions, 98 changer transitions 0/834 dead transitions. [2024-05-12 13:01:12,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 834 transitions, 19153 flow [2024-05-12 13:01:12,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:01:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:01:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-05-12 13:01:12,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-05-12 13:01:12,907 INFO L175 Difference]: Start difference. First operand has 329 places, 770 transitions, 16234 flow. Second operand 10 states and 171 transitions. [2024-05-12 13:01:12,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 834 transitions, 19153 flow [2024-05-12 13:01:13,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 834 transitions, 18841 flow, removed 117 selfloop flow, removed 5 redundant places. [2024-05-12 13:01:13,694 INFO L231 Difference]: Finished difference. Result has 334 places, 786 transitions, 16623 flow [2024-05-12 13:01:13,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=15922, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16623, PETRI_PLACES=334, PETRI_TRANSITIONS=786} [2024-05-12 13:01:13,695 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 292 predicate places. [2024-05-12 13:01:13,695 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 786 transitions, 16623 flow [2024-05-12 13:01:13,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:13,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:13,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:13,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-05-12 13:01:13,695 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:13,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:13,695 INFO L85 PathProgramCache]: Analyzing trace with hash 987002623, now seen corresponding path program 7 times [2024-05-12 13:01:13,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:13,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47476773] [2024-05-12 13:01:13,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:13,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:14,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-05-12 13:01:14,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:14,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47476773] [2024-05-12 13:01:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47476773] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:01:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731001314] [2024-05-12 13:01:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:14,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:01:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:14,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:01:14,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:01:14,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:14,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 786 transitions, 16623 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:14,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:14,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:14,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:16,857 INFO L124 PetriNetUnfolderBase]: 3661/7251 cut-off events. [2024-05-12 13:01:16,857 INFO L125 PetriNetUnfolderBase]: For 203647/203647 co-relation queries the response was YES. [2024-05-12 13:01:16,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59652 conditions, 7251 events. 3661/7251 cut-off events. For 203647/203647 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 61303 event pairs, 1019 based on Foata normal form. 2/6916 useless extension candidates. Maximal degree in co-relation 59501. Up to 5280 conditions per place. [2024-05-12 13:01:16,949 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 748 selfloop transitions, 79 changer transitions 0/834 dead transitions. [2024-05-12 13:01:16,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 834 transitions, 18925 flow [2024-05-12 13:01:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:01:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:01:16,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-05-12 13:01:16,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649122807017544 [2024-05-12 13:01:16,950 INFO L175 Difference]: Start difference. First operand has 334 places, 786 transitions, 16623 flow. Second operand 9 states and 159 transitions. [2024-05-12 13:01:16,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 834 transitions, 18925 flow [2024-05-12 13:01:17,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 834 transitions, 18668 flow, removed 111 selfloop flow, removed 5 redundant places. [2024-05-12 13:01:17,782 INFO L231 Difference]: Finished difference. Result has 338 places, 790 transitions, 16607 flow [2024-05-12 13:01:17,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16366, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16607, PETRI_PLACES=338, PETRI_TRANSITIONS=790} [2024-05-12 13:01:17,783 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 296 predicate places. [2024-05-12 13:01:17,783 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 790 transitions, 16607 flow [2024-05-12 13:01:17,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:17,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:17,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:17,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-05-12 13:01:17,783 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:17,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:17,783 INFO L85 PathProgramCache]: Analyzing trace with hash -686025986, now seen corresponding path program 19 times [2024-05-12 13:01:17,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:17,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956326032] [2024-05-12 13:01:17,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:17,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956326032] [2024-05-12 13:01:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956326032] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:01:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242688097] [2024-05-12 13:01:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:18,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:01:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:18,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:01:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:01:18,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:18,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 790 transitions, 16607 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:18,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:18,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:18,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:20,454 INFO L124 PetriNetUnfolderBase]: 3682/7225 cut-off events. [2024-05-12 13:01:20,454 INFO L125 PetriNetUnfolderBase]: For 202214/202214 co-relation queries the response was YES. [2024-05-12 13:01:20,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59733 conditions, 7225 events. 3682/7225 cut-off events. For 202214/202214 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 60738 event pairs, 1076 based on Foata normal form. 6/6912 useless extension candidates. Maximal degree in co-relation 59580. Up to 5504 conditions per place. [2024-05-12 13:01:20,550 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 781 selfloop transitions, 52 changer transitions 0/840 dead transitions. [2024-05-12 13:01:20,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 840 transitions, 19008 flow [2024-05-12 13:01:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:01:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:01:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-05-12 13:01:20,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2024-05-12 13:01:20,551 INFO L175 Difference]: Start difference. First operand has 338 places, 790 transitions, 16607 flow. Second operand 9 states and 156 transitions. [2024-05-12 13:01:20,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 840 transitions, 19008 flow [2024-05-12 13:01:21,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 840 transitions, 18627 flow, removed 62 selfloop flow, removed 7 redundant places. [2024-05-12 13:01:21,457 INFO L231 Difference]: Finished difference. Result has 340 places, 800 transitions, 16695 flow [2024-05-12 13:01:21,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16238, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=738, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16695, PETRI_PLACES=340, PETRI_TRANSITIONS=800} [2024-05-12 13:01:21,457 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 298 predicate places. [2024-05-12 13:01:21,457 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 800 transitions, 16695 flow [2024-05-12 13:01:21,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:21,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:21,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:21,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-05-12 13:01:21,458 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:21,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:21,458 INFO L85 PathProgramCache]: Analyzing trace with hash 986996826, now seen corresponding path program 20 times [2024-05-12 13:01:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:21,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742224759] [2024-05-12 13:01:21,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:21,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:22,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:22,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742224759] [2024-05-12 13:01:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742224759] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:22,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:01:22,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508812808] [2024-05-12 13:01:22,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:22,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:01:22,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:22,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:01:22,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:01:22,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:22,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 800 transitions, 16695 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:22,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:22,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:22,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:24,249 INFO L124 PetriNetUnfolderBase]: 3680/7262 cut-off events. [2024-05-12 13:01:24,249 INFO L125 PetriNetUnfolderBase]: For 190291/190291 co-relation queries the response was YES. [2024-05-12 13:01:24,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59037 conditions, 7262 events. 3680/7262 cut-off events. For 190291/190291 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 61233 event pairs, 941 based on Foata normal form. 1/6932 useless extension candidates. Maximal degree in co-relation 58883. Up to 5183 conditions per place. [2024-05-12 13:01:24,350 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 729 selfloop transitions, 109 changer transitions 0/845 dead transitions. [2024-05-12 13:01:24,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 845 transitions, 18887 flow [2024-05-12 13:01:24,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:01:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:01:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-05-12 13:01:24,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4678362573099415 [2024-05-12 13:01:24,351 INFO L175 Difference]: Start difference. First operand has 340 places, 800 transitions, 16695 flow. Second operand 9 states and 160 transitions. [2024-05-12 13:01:24,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 845 transitions, 18887 flow [2024-05-12 13:01:25,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 845 transitions, 18496 flow, removed 165 selfloop flow, removed 6 redundant places. [2024-05-12 13:01:25,268 INFO L231 Difference]: Finished difference. Result has 343 places, 800 transitions, 16536 flow [2024-05-12 13:01:25,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16304, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16536, PETRI_PLACES=343, PETRI_TRANSITIONS=800} [2024-05-12 13:01:25,269 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 301 predicate places. [2024-05-12 13:01:25,269 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 800 transitions, 16536 flow [2024-05-12 13:01:25,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:25,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:25,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:25,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-05-12 13:01:25,269 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:25,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1271410573, now seen corresponding path program 8 times [2024-05-12 13:01:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579499722] [2024-05-12 13:01:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:26,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:26,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579499722] [2024-05-12 13:01:26,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579499722] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:26,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:26,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:01:26,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666371333] [2024-05-12 13:01:26,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:26,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:01:26,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:26,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:01:26,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:01:26,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:26,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 800 transitions, 16536 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:26,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:26,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:26,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:28,337 INFO L124 PetriNetUnfolderBase]: 3676/7250 cut-off events. [2024-05-12 13:01:28,338 INFO L125 PetriNetUnfolderBase]: For 184113/184113 co-relation queries the response was YES. [2024-05-12 13:01:28,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58309 conditions, 7250 events. 3676/7250 cut-off events. For 184113/184113 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 61172 event pairs, 1105 based on Foata normal form. 2/6924 useless extension candidates. Maximal degree in co-relation 58154. Up to 5613 conditions per place. [2024-05-12 13:01:28,438 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 793 selfloop transitions, 37 changer transitions 0/837 dead transitions. [2024-05-12 13:01:28,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 837 transitions, 18558 flow [2024-05-12 13:01:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:01:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:01:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-05-12 13:01:28,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4502923976608187 [2024-05-12 13:01:28,439 INFO L175 Difference]: Start difference. First operand has 343 places, 800 transitions, 16536 flow. Second operand 9 states and 154 transitions. [2024-05-12 13:01:28,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 837 transitions, 18558 flow [2024-05-12 13:01:29,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 837 transitions, 18309 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-05-12 13:01:29,219 INFO L231 Difference]: Finished difference. Result has 345 places, 800 transitions, 16372 flow [2024-05-12 13:01:29,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16287, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=763, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16372, PETRI_PLACES=345, PETRI_TRANSITIONS=800} [2024-05-12 13:01:29,219 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 303 predicate places. [2024-05-12 13:01:29,219 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 800 transitions, 16372 flow [2024-05-12 13:01:29,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:29,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:29,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:29,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-05-12 13:01:29,220 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:29,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash 986996671, now seen corresponding path program 6 times [2024-05-12 13:01:29,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:29,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779737102] [2024-05-12 13:01:29,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:30,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:30,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779737102] [2024-05-12 13:01:30,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779737102] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:30,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:30,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:01:30,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327140619] [2024-05-12 13:01:30,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:30,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:01:30,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:30,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:01:30,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:01:30,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:30,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 800 transitions, 16372 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:30,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:30,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:30,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:32,807 INFO L124 PetriNetUnfolderBase]: 3674/7239 cut-off events. [2024-05-12 13:01:32,808 INFO L125 PetriNetUnfolderBase]: For 179566/179566 co-relation queries the response was YES. [2024-05-12 13:01:32,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57820 conditions, 7239 events. 3674/7239 cut-off events. For 179566/179566 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 61038 event pairs, 1120 based on Foata normal form. 1/6913 useless extension candidates. Maximal degree in co-relation 57664. Up to 5709 conditions per place. [2024-05-12 13:01:32,911 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 783 selfloop transitions, 42 changer transitions 0/832 dead transitions. [2024-05-12 13:01:32,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 832 transitions, 18392 flow [2024-05-12 13:01:32,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:01:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:01:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-05-12 13:01:32,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2024-05-12 13:01:32,912 INFO L175 Difference]: Start difference. First operand has 345 places, 800 transitions, 16372 flow. Second operand 9 states and 150 transitions. [2024-05-12 13:01:32,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 832 transitions, 18392 flow [2024-05-12 13:01:33,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 832 transitions, 18096 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-05-12 13:01:33,729 INFO L231 Difference]: Finished difference. Result has 345 places, 803 transitions, 16271 flow [2024-05-12 13:01:33,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16076, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16271, PETRI_PLACES=345, PETRI_TRANSITIONS=803} [2024-05-12 13:01:33,730 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 303 predicate places. [2024-05-12 13:01:33,730 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 803 transitions, 16271 flow [2024-05-12 13:01:33,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:33,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:33,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:33,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-05-12 13:01:33,730 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:33,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:33,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1002126473, now seen corresponding path program 1 times [2024-05-12 13:01:33,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:33,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267688044] [2024-05-12 13:01:33,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:33,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:33,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:33,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267688044] [2024-05-12 13:01:33,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267688044] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:33,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:33,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:01:33,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57896535] [2024-05-12 13:01:33,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:33,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:01:33,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:33,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:01:33,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:01:33,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-05-12 13:01:33,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 803 transitions, 16271 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-05-12 13:01:33,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:33,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-05-12 13:01:33,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:35,523 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L788-->L791: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~x~0_3) InVars {~x~0=v_~x~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][309], [189#true, Black: 511#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 513#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 512#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 1021#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 259#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 773#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0))), 455#true, Black: 527#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 1046#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 ~y~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~y$mem_tmp~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 272#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 788#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 786#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 787#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 785#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 228#true, 369#true, Black: 541#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 1057#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 795#true, Black: 801#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 804#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 294#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 803#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 148#true, Black: 290#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), P1Thread1of1ForFork0InUse, Black: 284#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), P0Thread1of1ForFork1InUse, Black: 285#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 555#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 49#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~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) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), 382#true, Black: 1072#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), 823#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 310#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0))), Black: 307#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 710#true, Black: 64#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 569#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 24#L791true, Black: 577#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1093#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)) (and (= ~y$mem_tmp~0 1) (= ~y~0 1))) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0~0 1) (= ~y~0 ~__unbuffered_p1_EBX~0)), Black: 831#(and (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$read_delayed_var~0.base 0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0)) (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1))) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 109#true, Black: 322#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 588#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 317#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 1104#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 93#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 340#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 611#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 1121#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), 929#true, 901#true, Black: 605#(and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), 122#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 365#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 361#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (<= 0 ~y$r_buff1_thd2~0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1144#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 ~y~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 627#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 621#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 622#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 895#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 892#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 894#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 1063#true, Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 132#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 302#true, Black: 126#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 164#true, Black: 1155#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 390#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), 779#true, Black: 649#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 914#(and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$read_delayed_var~0.offset 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0~0 1)), Black: 402#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 280#true, Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 925#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1))) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 669#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), 1146#true, 394#true, Black: 938#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 1161#true, Black: 171#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 935#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 683#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 433#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 12#L848true, 28#L781true, 335#true, 616#true, 206#true, Black: 952#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 183#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 693#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$w_buff0~0 1)), Black: 704#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 451#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 706#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0))) (= |#ghost~multithreaded| 1) (<= 0 ~y$mem_tmp~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= ~y$mem_tmp~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 447#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 969#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 462#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0)) (= ~y~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (not (= ~y~0 1))) (<= 0 ~y$r_buff1_thd2~0)), Black: 463#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0)) (= ~y~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (not (= ~y~0 1))) (<= 0 ~y$r_buff1_thd2~0)), 689#true, Black: 980#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 715#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 727#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 474#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 476#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 993#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 971#true, Black: 489#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 1010#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 501#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 757#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (and (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y~0 0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 761#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 886#true]) [2024-05-12 13:01:35,526 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-05-12 13:01:35,526 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-05-12 13:01:35,526 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-05-12 13:01:35,527 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-05-12 13:01:35,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L788-->L791: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~x~0_3) InVars {~x~0=v_~x~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][309], [189#true, Black: 511#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 513#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 512#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 1021#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 259#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 773#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0))), 455#true, Black: 527#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 1046#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 ~y~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~y$mem_tmp~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 272#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 788#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 786#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 787#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 785#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 228#true, 369#true, Black: 541#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 1057#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 795#true, Black: 801#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 804#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 294#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 803#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 148#true, Black: 290#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), P1Thread1of1ForFork0InUse, Black: 284#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), P0Thread1of1ForFork1InUse, Black: 285#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 555#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 49#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~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) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), 382#true, Black: 1072#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), 823#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 310#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0))), Black: 307#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 710#true, Black: 64#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 569#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 24#L791true, Black: 577#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1093#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)) (and (= ~y$mem_tmp~0 1) (= ~y~0 1))) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0~0 1) (= ~y~0 ~__unbuffered_p1_EBX~0)), Black: 831#(and (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$read_delayed_var~0.base 0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0)) (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1))) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 109#true, Black: 322#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 588#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 317#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 1104#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 93#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 340#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 611#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 1121#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), 929#true, 901#true, Black: 605#(and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), 122#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 365#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 361#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (<= 0 ~y$r_buff1_thd2~0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1144#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 ~y~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 627#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 621#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 622#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 895#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 892#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 894#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 1063#true, Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 132#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 302#true, Black: 126#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 164#true, Black: 1155#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 390#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), 779#true, Black: 649#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 914#(and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$read_delayed_var~0.offset 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0~0 1)), Black: 402#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 280#true, Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 925#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1))) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 669#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), 1146#true, 26#L19-1true, 394#true, Black: 938#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 1161#true, Black: 171#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 935#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 683#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 433#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 28#L781true, 616#true, 335#true, 206#true, Black: 952#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 183#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 693#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$w_buff0~0 1)), Black: 704#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 451#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 706#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0))) (= |#ghost~multithreaded| 1) (<= 0 ~y$mem_tmp~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= ~y$mem_tmp~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 447#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 969#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 462#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0)) (= ~y~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (not (= ~y~0 1))) (<= 0 ~y$r_buff1_thd2~0)), Black: 463#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0)) (= ~y~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (not (= ~y~0 1))) (<= 0 ~y$r_buff1_thd2~0)), 689#true, Black: 980#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 715#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 727#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 474#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 476#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 993#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 971#true, Black: 489#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 1010#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 501#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 757#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (and (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y~0 0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 761#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 886#true]) [2024-05-12 13:01:35,949 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-05-12 13:01:35,949 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 13:01:35,950 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 13:01:35,950 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 13:01:36,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L788-->L791: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~x~0_3) InVars {~x~0=v_~x~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][1169], [189#true, Black: 511#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 513#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 512#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 1021#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 32#L19-5true, Black: 259#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 773#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0))), 455#true, Black: 527#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 1046#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 ~y~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~y$mem_tmp~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 272#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 788#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 786#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 787#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 785#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 228#true, 369#true, Black: 541#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 1057#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 795#true, Black: 801#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 804#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 294#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 803#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 148#true, Black: 290#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), P1Thread1of1ForFork0InUse, Black: 284#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), P0Thread1of1ForFork1InUse, Black: 285#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 555#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 49#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~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) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), 382#true, Black: 1072#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), 823#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 310#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0))), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 307#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 710#true, Black: 64#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 569#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 24#L791true, Black: 577#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1093#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)) (and (= ~y$mem_tmp~0 1) (= ~y~0 1))) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0~0 1) (= ~y~0 ~__unbuffered_p1_EBX~0)), Black: 831#(and (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$read_delayed_var~0.base 0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0)) (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1))) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 109#true, Black: 322#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 588#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 317#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 1104#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 93#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 340#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 611#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 1121#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), 929#true, 901#true, Black: 605#(and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), 122#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 365#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 361#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (<= 0 ~y$r_buff1_thd2~0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 1144#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 ~y~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 627#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 621#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 622#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 895#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 892#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 894#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 1063#true, Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 132#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 302#true, Black: 126#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 164#true, Black: 1155#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 390#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), 779#true, Black: 649#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 914#(and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$read_delayed_var~0.offset 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0~0 1)), Black: 402#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 280#true, Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 925#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1))) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 669#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), 1146#true, 394#true, Black: 938#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 171#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 935#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 683#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 433#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 28#L781true, 616#true, 335#true, 206#true, Black: 952#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 183#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 693#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$w_buff0~0 1)), Black: 704#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 451#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 706#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0))) (= |#ghost~multithreaded| 1) (<= 0 ~y$mem_tmp~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= ~y$mem_tmp~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 447#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 969#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 462#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0)) (= ~y~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (not (= ~y~0 1))) (<= 0 ~y$r_buff1_thd2~0)), Black: 463#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0)) (= ~y~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (not (= ~y~0 1))) (<= 0 ~y$r_buff1_thd2~0)), 689#true, Black: 980#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 715#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 727#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 474#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 476#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 993#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 971#true, Black: 489#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 1165#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 1010#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 501#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 757#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (and (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y~0 0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 761#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 886#true]) [2024-05-12 13:01:36,284 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,284 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,284 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,284 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L788-->L791: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~x~0_3) InVars {~x~0=v_~x~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][309], [189#true, Black: 511#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 513#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 512#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 1021#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 259#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 773#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0))), 455#true, Black: 527#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 1046#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 ~y~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~y$mem_tmp~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 272#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 788#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 786#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 787#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 785#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 228#true, 369#true, Black: 541#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 1057#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 795#true, Black: 801#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 804#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 294#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 803#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 148#true, Black: 290#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), P1Thread1of1ForFork0InUse, Black: 284#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), P0Thread1of1ForFork1InUse, Black: 285#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 555#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 49#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~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) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), 4#L19-2true, 382#true, Black: 1072#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), 823#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 310#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0))), Black: 307#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 710#true, Black: 64#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 569#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 24#L791true, Black: 577#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1093#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)) (and (= ~y$mem_tmp~0 1) (= ~y~0 1))) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0~0 1) (= ~y~0 ~__unbuffered_p1_EBX~0)), Black: 831#(and (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$read_delayed_var~0.base 0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0)) (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1))) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 109#true, Black: 322#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 588#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 317#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 1104#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 93#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 340#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 929#true, Black: 611#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 1121#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), 901#true, Black: 605#(and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), 122#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 365#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 361#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (<= 0 ~y$r_buff1_thd2~0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1144#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 ~y~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 627#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 621#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 622#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 895#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 892#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 894#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 1063#true, Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 132#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 302#true, Black: 126#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 164#true, Black: 1155#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 390#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), 779#true, Black: 649#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 914#(and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$read_delayed_var~0.offset 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0~0 1)), Black: 402#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 280#true, Black: 925#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1))) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 669#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), 1146#true, 394#true, 1161#true, Black: 938#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 171#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 935#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 683#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 433#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 28#L781true, 335#true, 616#true, 206#true, Black: 952#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 183#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 693#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$w_buff0~0 1)), Black: 704#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 451#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 706#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0))) (= |#ghost~multithreaded| 1) (<= 0 ~y$mem_tmp~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= ~y$mem_tmp~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 447#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 969#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 462#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0)) (= ~y~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (not (= ~y~0 1))) (<= 0 ~y$r_buff1_thd2~0)), Black: 463#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0)) (= ~y~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (not (= ~y~0 1))) (<= 0 ~y$r_buff1_thd2~0)), 689#true, Black: 980#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 715#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 727#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 474#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 476#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 993#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 971#true, Black: 489#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 1010#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 501#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 757#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (and (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y~0 0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 761#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 886#true]) [2024-05-12 13:01:36,299 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,299 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,299 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,299 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,343 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([352] L788-->L791: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~x~0_3) InVars {~x~0=v_~x~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][1169], [189#true, Black: 511#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 513#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 512#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 1021#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 32#L19-5true, Black: 259#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 773#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0))), 455#true, Black: 527#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 1046#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 ~y~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~y$mem_tmp~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 272#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 788#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 786#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 787#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 785#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 228#true, 369#true, Black: 541#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 1057#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 795#true, Black: 801#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 804#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 294#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 803#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), 148#true, Black: 286#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 290#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), P1Thread1of1ForFork0InUse, Black: 284#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 285#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), P0Thread1of1ForFork1InUse, Black: 555#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 49#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~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) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), 382#true, Black: 1072#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), 823#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 310#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0))), Black: 307#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 710#true, Black: 64#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 569#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 24#L791true, Black: 577#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1093#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)) (and (= ~y$mem_tmp~0 1) (= ~y~0 1))) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0~0 1) (= ~y~0 ~__unbuffered_p1_EBX~0)), Black: 831#(and (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$read_delayed_var~0.base 0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0)) (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1))) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 109#true, Black: 322#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 588#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 317#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 1104#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 93#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 340#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 611#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 1121#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), 929#true, 901#true, Black: 605#(and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), 122#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 365#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 361#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (<= 0 ~y$r_buff1_thd2~0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1144#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 ~y~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 627#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 621#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 622#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 895#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 892#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 894#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 1063#true, Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 132#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 302#true, Black: 126#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 164#true, Black: 1155#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 390#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), 779#true, Black: 649#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 914#(and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$read_delayed_var~0.offset 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0~0 1)), Black: 402#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 280#true, Black: 925#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1))) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 669#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), 1146#true, 394#true, Black: 938#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 171#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 935#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 683#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 433#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 28#L781true, 335#true, 616#true, 206#true, Black: 952#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 183#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 693#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$w_buff0~0 1)), Black: 704#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 451#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 706#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0))) (= |#ghost~multithreaded| 1) (<= 0 ~y$mem_tmp~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= ~y$mem_tmp~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 447#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 969#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 462#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0)) (= ~y~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (not (= ~y~0 1))) (<= 0 ~y$r_buff1_thd2~0)), Black: 463#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0)) (= ~y~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (not (= ~y~0 1))) (<= 0 ~y$r_buff1_thd2~0)), 689#true, Black: 980#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 715#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 727#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 474#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 476#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 971#true, Black: 993#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 489#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 1165#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 1010#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 501#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 757#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (and (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y~0 0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 761#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 886#true]) [2024-05-12 13:01:36,343 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,343 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,343 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,343 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,343 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([349] L781-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res#1.base_1| 0) (= |v_P0Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_1|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base][1196], [189#true, Black: 511#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 513#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 512#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 1021#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 32#L19-5true, Black: 259#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 773#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0))), 455#true, Black: 527#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 1046#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 ~y~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 0)) (= ~y$mem_tmp~0 ~__unbuffered_p1_EBX~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 272#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 788#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 786#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 787#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 785#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 228#true, 369#true, Black: 541#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 1057#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 795#true, Black: 801#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 804#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 294#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 803#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 286#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 148#true, Black: 290#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), P1Thread1of1ForFork0InUse, Black: 284#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 285#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), P0Thread1of1ForFork1InUse, Black: 555#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 49#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~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) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), 382#true, Black: 1072#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), 823#true, 11#L788true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 56#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 310#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0))), Black: 307#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 710#true, Black: 64#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), Black: 569#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 577#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1093#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$read_delayed_var~0.base 0) (or (and (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)) (and (= ~y$mem_tmp~0 1) (= ~y~0 1))) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0~0 1) (= ~y~0 ~__unbuffered_p1_EBX~0)), Black: 831#(and (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$read_delayed_var~0.base 0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0)) (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1))) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 109#true, Black: 322#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 321#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 588#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 317#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 1104#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 93#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 340#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 0) (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 611#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 1121#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0))) (<= 0 ~y$r_buff1_thd2~0)), 929#true, 901#true, Black: 605#(and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), 122#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 365#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 361#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (<= 0 ~y$r_buff1_thd2~0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 1144#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$mem_tmp~0 ~y~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 627#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 375#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 621#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 622#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (or (= ~__unbuffered_p0_EAX~0 ~y~0) (= ~y~0 0)) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 895#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 892#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 894#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 1063#true, Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 132#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 302#true, Black: 126#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 164#true, Black: 1155#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 390#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1)) (and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)))), 779#true, Black: 649#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 914#(and (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$read_delayed_var~0.offset 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0~0 1)), Black: 402#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 280#true, Black: 157#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 925#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EBX~0 1) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1))) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 669#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1)), 1146#true, 394#true, Black: 938#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 935#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 171#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 1)) (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 683#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 433#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 335#true, 616#true, 206#true, Black: 952#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 183#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 693#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$w_buff0~0 1)), Black: 451#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 33#P0EXITtrue, Black: 704#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 706#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0))) (= |#ghost~multithreaded| 1) (<= 0 ~y$mem_tmp~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= ~y$mem_tmp~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 447#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 969#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 462#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0)) (= ~y~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (not (= ~y~0 1))) (<= 0 ~y$r_buff1_thd2~0)), Black: 463#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (or (and (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~y~0 0)) (= ~y~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (or (= ~__unbuffered_p0_EAX~0 1) (not (= ~y~0 1))) (<= 0 ~y$r_buff1_thd2~0)), 689#true, Black: 980#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 715#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 727#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (<= ~y~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (<= 0 ~y~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 474#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 476#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 971#true, Black: 993#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 489#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 1165#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 1010#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p0_EBX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 501#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EBX~0 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 757#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 761#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (and (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y~0 0))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 886#true]) [2024-05-12 13:01:36,344 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,344 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,344 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,344 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 13:01:36,562 INFO L124 PetriNetUnfolderBase]: 6401/10962 cut-off events. [2024-05-12 13:01:36,562 INFO L125 PetriNetUnfolderBase]: For 241357/241731 co-relation queries the response was YES. [2024-05-12 13:01:36,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89055 conditions, 10962 events. 6401/10962 cut-off events. For 241357/241731 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 83109 event pairs, 1605 based on Foata normal form. 217/10628 useless extension candidates. Maximal degree in co-relation 88899. Up to 6665 conditions per place. [2024-05-12 13:01:36,739 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 955 selfloop transitions, 39 changer transitions 372/1624 dead transitions. [2024-05-12 13:01:36,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 1624 transitions, 35318 flow [2024-05-12 13:01:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:01:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:01:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2024-05-12 13:01:36,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2024-05-12 13:01:36,741 INFO L175 Difference]: Start difference. First operand has 345 places, 803 transitions, 16271 flow. Second operand 8 states and 168 transitions. [2024-05-12 13:01:36,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 1624 transitions, 35318 flow [2024-05-12 13:01:38,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1624 transitions, 34939 flow, removed 112 selfloop flow, removed 7 redundant places. [2024-05-12 13:01:38,313 INFO L231 Difference]: Finished difference. Result has 351 places, 808 transitions, 16308 flow [2024-05-12 13:01:38,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16079, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16308, PETRI_PLACES=351, PETRI_TRANSITIONS=808} [2024-05-12 13:01:38,314 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 309 predicate places. [2024-05-12 13:01:38,314 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 808 transitions, 16308 flow [2024-05-12 13:01:38,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-05-12 13:01:38,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:38,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:38,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-05-12 13:01:38,315 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:38,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:38,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2086582829, now seen corresponding path program 1 times [2024-05-12 13:01:38,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:38,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690111445] [2024-05-12 13:01:38,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:38,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:39,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:39,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690111445] [2024-05-12 13:01:39,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690111445] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:39,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:39,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:01:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813110597] [2024-05-12 13:01:39,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:39,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:01:39,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:39,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:01:39,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:01:39,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:39,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 808 transitions, 16308 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:39,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:39,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:39,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:42,152 INFO L124 PetriNetUnfolderBase]: 3701/7393 cut-off events. [2024-05-12 13:01:42,152 INFO L125 PetriNetUnfolderBase]: For 190012/190049 co-relation queries the response was YES. [2024-05-12 13:01:42,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60283 conditions, 7393 events. 3701/7393 cut-off events. For 190012/190049 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 62594 event pairs, 944 based on Foata normal form. 24/7400 useless extension candidates. Maximal degree in co-relation 60122. Up to 5320 conditions per place. [2024-05-12 13:01:42,239 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 715 selfloop transitions, 135 changer transitions 2/860 dead transitions. [2024-05-12 13:01:42,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 860 transitions, 18511 flow [2024-05-12 13:01:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:01:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:01:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 211 transitions. [2024-05-12 13:01:42,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46271929824561403 [2024-05-12 13:01:42,240 INFO L175 Difference]: Start difference. First operand has 351 places, 808 transitions, 16308 flow. Second operand 12 states and 211 transitions. [2024-05-12 13:01:42,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 860 transitions, 18511 flow [2024-05-12 13:01:43,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 860 transitions, 18471 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-05-12 13:01:43,067 INFO L231 Difference]: Finished difference. Result has 359 places, 807 transitions, 16589 flow [2024-05-12 13:01:43,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16282, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16589, PETRI_PLACES=359, PETRI_TRANSITIONS=807} [2024-05-12 13:01:43,068 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 317 predicate places. [2024-05-12 13:01:43,068 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 807 transitions, 16589 flow [2024-05-12 13:01:43,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:43,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:43,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:43,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-05-12 13:01:43,068 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:43,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:43,069 INFO L85 PathProgramCache]: Analyzing trace with hash 143513671, now seen corresponding path program 2 times [2024-05-12 13:01:43,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:43,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725452875] [2024-05-12 13:01:43,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:43,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:43,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725452875] [2024-05-12 13:01:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725452875] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:43,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:43,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:01:43,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316825285] [2024-05-12 13:01:43,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:43,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:01:43,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:43,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:01:43,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:01:43,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:43,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 807 transitions, 16589 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:43,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:43,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:43,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:46,204 INFO L124 PetriNetUnfolderBase]: 3786/7532 cut-off events. [2024-05-12 13:01:46,204 INFO L125 PetriNetUnfolderBase]: For 209478/209515 co-relation queries the response was YES. [2024-05-12 13:01:46,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61684 conditions, 7532 events. 3786/7532 cut-off events. For 209478/209515 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 63686 event pairs, 886 based on Foata normal form. 24/7531 useless extension candidates. Maximal degree in co-relation 61521. Up to 5215 conditions per place. [2024-05-12 13:01:46,301 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 726 selfloop transitions, 132 changer transitions 0/866 dead transitions. [2024-05-12 13:01:46,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 866 transitions, 19065 flow [2024-05-12 13:01:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:01:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:01:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-05-12 13:01:46,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47129186602870815 [2024-05-12 13:01:46,302 INFO L175 Difference]: Start difference. First operand has 359 places, 807 transitions, 16589 flow. Second operand 11 states and 197 transitions. [2024-05-12 13:01:46,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 866 transitions, 19065 flow [2024-05-12 13:01:47,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 866 transitions, 18709 flow, removed 30 selfloop flow, removed 11 redundant places. [2024-05-12 13:01:47,319 INFO L231 Difference]: Finished difference. Result has 360 places, 813 transitions, 16731 flow [2024-05-12 13:01:47,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16264, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16731, PETRI_PLACES=360, PETRI_TRANSITIONS=813} [2024-05-12 13:01:47,320 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 318 predicate places. [2024-05-12 13:01:47,320 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 813 transitions, 16731 flow [2024-05-12 13:01:47,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:47,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:47,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:47,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-05-12 13:01:47,321 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:47,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1283106233, now seen corresponding path program 1 times [2024-05-12 13:01:47,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:47,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086017954] [2024-05-12 13:01:47,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:47,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:48,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:48,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086017954] [2024-05-12 13:01:48,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086017954] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:48,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:48,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:01:48,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970943157] [2024-05-12 13:01:48,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:48,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:01:48,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:48,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:01:48,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:01:48,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:48,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 813 transitions, 16731 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:48,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:48,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:48,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:50,718 INFO L124 PetriNetUnfolderBase]: 3798/7559 cut-off events. [2024-05-12 13:01:50,718 INFO L125 PetriNetUnfolderBase]: For 205986/206019 co-relation queries the response was YES. [2024-05-12 13:01:50,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61302 conditions, 7559 events. 3798/7559 cut-off events. For 205986/206019 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 63983 event pairs, 979 based on Foata normal form. 19/7565 useless extension candidates. Maximal degree in co-relation 61138. Up to 5241 conditions per place. [2024-05-12 13:01:50,811 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 713 selfloop transitions, 150 changer transitions 0/871 dead transitions. [2024-05-12 13:01:50,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 871 transitions, 19175 flow [2024-05-12 13:01:50,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:01:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:01:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 215 transitions. [2024-05-12 13:01:50,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47149122807017546 [2024-05-12 13:01:50,813 INFO L175 Difference]: Start difference. First operand has 360 places, 813 transitions, 16731 flow. Second operand 12 states and 215 transitions. [2024-05-12 13:01:50,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 871 transitions, 19175 flow [2024-05-12 13:01:51,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 871 transitions, 18894 flow, removed 54 selfloop flow, removed 7 redundant places. [2024-05-12 13:01:51,727 INFO L231 Difference]: Finished difference. Result has 366 places, 819 transitions, 16935 flow [2024-05-12 13:01:51,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16450, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16935, PETRI_PLACES=366, PETRI_TRANSITIONS=819} [2024-05-12 13:01:51,728 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 324 predicate places. [2024-05-12 13:01:51,728 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 819 transitions, 16935 flow [2024-05-12 13:01:51,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:51,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:51,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:51,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-05-12 13:01:51,728 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:51,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1279947829, now seen corresponding path program 3 times [2024-05-12 13:01:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:51,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406882719] [2024-05-12 13:01:51,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:52,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:52,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406882719] [2024-05-12 13:01:52,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406882719] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:52,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:52,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:01:52,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646921891] [2024-05-12 13:01:52,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:52,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:01:52,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:52,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:01:52,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:01:52,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:52,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 819 transitions, 16935 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:52,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:52,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:52,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:55,113 INFO L124 PetriNetUnfolderBase]: 3887/7752 cut-off events. [2024-05-12 13:01:55,114 INFO L125 PetriNetUnfolderBase]: For 210347/210385 co-relation queries the response was YES. [2024-05-12 13:01:55,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62474 conditions, 7752 events. 3887/7752 cut-off events. For 210347/210385 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 66030 event pairs, 982 based on Foata normal form. 25/7749 useless extension candidates. Maximal degree in co-relation 62308. Up to 5478 conditions per place. [2024-05-12 13:01:55,215 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 730 selfloop transitions, 142 changer transitions 0/880 dead transitions. [2024-05-12 13:01:55,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 880 transitions, 19254 flow [2024-05-12 13:01:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 13:01:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 13:01:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 214 transitions. [2024-05-12 13:01:55,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4692982456140351 [2024-05-12 13:01:55,217 INFO L175 Difference]: Start difference. First operand has 366 places, 819 transitions, 16935 flow. Second operand 12 states and 214 transitions. [2024-05-12 13:01:55,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 880 transitions, 19254 flow [2024-05-12 13:01:56,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 880 transitions, 18895 flow, removed 39 selfloop flow, removed 8 redundant places. [2024-05-12 13:01:56,207 INFO L231 Difference]: Finished difference. Result has 371 places, 825 transitions, 17000 flow [2024-05-12 13:01:56,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16586, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=819, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=17000, PETRI_PLACES=371, PETRI_TRANSITIONS=825} [2024-05-12 13:01:56,207 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 329 predicate places. [2024-05-12 13:01:56,207 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 825 transitions, 17000 flow [2024-05-12 13:01:56,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:56,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:01:56,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:01:56,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-05-12 13:01:56,208 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:01:56,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:01:56,208 INFO L85 PathProgramCache]: Analyzing trace with hash -301461493, now seen corresponding path program 1 times [2024-05-12 13:01:56,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:01:56,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822819507] [2024-05-12 13:01:56,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:01:56,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:01:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:01:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:01:57,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:01:57,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822819507] [2024-05-12 13:01:57,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822819507] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:01:57,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:01:57,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:01:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638662020] [2024-05-12 13:01:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:01:57,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:01:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:01:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:01:57,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:01:57,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:01:57,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 825 transitions, 17000 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:01:57,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:01:57,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:01:57,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:01:59,972 INFO L124 PetriNetUnfolderBase]: 4037/8002 cut-off events. [2024-05-12 13:01:59,973 INFO L125 PetriNetUnfolderBase]: For 231617/231650 co-relation queries the response was YES. [2024-05-12 13:02:00,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64561 conditions, 8002 events. 4037/8002 cut-off events. For 231617/231650 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 68225 event pairs, 1028 based on Foata normal form. 22/8011 useless extension candidates. Maximal degree in co-relation 64393. Up to 5379 conditions per place. [2024-05-12 13:02:00,079 INFO L140 encePairwiseOnDemand]: 23/38 looper letters, 749 selfloop transitions, 142 changer transitions 0/899 dead transitions. [2024-05-12 13:02:00,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 899 transitions, 19811 flow [2024-05-12 13:02:00,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 13:02:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 13:02:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 240 transitions. [2024-05-12 13:02:00,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48582995951417 [2024-05-12 13:02:00,080 INFO L175 Difference]: Start difference. First operand has 371 places, 825 transitions, 17000 flow. Second operand 13 states and 240 transitions. [2024-05-12 13:02:00,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 899 transitions, 19811 flow [2024-05-12 13:02:01,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 899 transitions, 19585 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-05-12 13:02:01,131 INFO L231 Difference]: Finished difference. Result has 377 places, 835 transitions, 17299 flow [2024-05-12 13:02:01,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16774, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=17299, PETRI_PLACES=377, PETRI_TRANSITIONS=835} [2024-05-12 13:02:01,132 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 335 predicate places. [2024-05-12 13:02:01,132 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 835 transitions, 17299 flow [2024-05-12 13:02:01,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:02:01,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:02:01,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:02:01,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-05-12 13:02:01,132 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:02:01,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:02:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash 935831029, now seen corresponding path program 4 times [2024-05-12 13:02:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:02:01,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539306759] [2024-05-12 13:02:01,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:02:01,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:02:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:02:02,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-05-12 13:02:02,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:02:02,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539306759] [2024-05-12 13:02:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539306759] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:02:02,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:02:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:02:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346858050] [2024-05-12 13:02:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:02:02,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:02:02,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:02:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:02:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:02:02,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:02:02,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 835 transitions, 17299 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:02:02,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:02:02,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:02:02,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:02:05,044 INFO L124 PetriNetUnfolderBase]: 4201/8394 cut-off events. [2024-05-12 13:02:05,044 INFO L125 PetriNetUnfolderBase]: For 243752/243789 co-relation queries the response was YES. [2024-05-12 13:02:05,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67434 conditions, 8394 events. 4201/8394 cut-off events. For 243752/243789 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 72881 event pairs, 1113 based on Foata normal form. 22/8377 useless extension candidates. Maximal degree in co-relation 67263. Up to 6089 conditions per place. [2024-05-12 13:02:05,142 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 775 selfloop transitions, 111 changer transitions 0/894 dead transitions. [2024-05-12 13:02:05,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 894 transitions, 19773 flow [2024-05-12 13:02:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:02:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:02:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2024-05-12 13:02:05,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47607655502392343 [2024-05-12 13:02:05,143 INFO L175 Difference]: Start difference. First operand has 377 places, 835 transitions, 17299 flow. Second operand 11 states and 199 transitions. [2024-05-12 13:02:05,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 894 transitions, 19773 flow [2024-05-12 13:02:06,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 894 transitions, 19550 flow, removed 47 selfloop flow, removed 7 redundant places. [2024-05-12 13:02:06,154 INFO L231 Difference]: Finished difference. Result has 382 places, 846 transitions, 17524 flow [2024-05-12 13:02:06,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=17076, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17524, PETRI_PLACES=382, PETRI_TRANSITIONS=846} [2024-05-12 13:02:06,155 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 340 predicate places. [2024-05-12 13:02:06,155 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 846 transitions, 17524 flow [2024-05-12 13:02:06,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:02:06,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:02:06,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:02:06,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-05-12 13:02:06,155 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:02:06,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:02:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash 166319203, now seen corresponding path program 2 times [2024-05-12 13:02:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:02:06,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375122756] [2024-05-12 13:02:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:02:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:02:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:02:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:02:07,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:02:07,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375122756] [2024-05-12 13:02:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375122756] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:02:07,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:02:07,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:02:07,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553304349] [2024-05-12 13:02:07,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:02:07,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:02:07,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:02:07,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:02:07,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:02:07,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:02:07,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 846 transitions, 17524 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:02:07,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:02:07,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:02:07,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:02:10,291 INFO L124 PetriNetUnfolderBase]: 4355/8722 cut-off events. [2024-05-12 13:02:10,291 INFO L125 PetriNetUnfolderBase]: For 258883/258923 co-relation queries the response was YES. [2024-05-12 13:02:10,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69493 conditions, 8722 events. 4355/8722 cut-off events. For 258883/258923 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 76455 event pairs, 1165 based on Foata normal form. 29/8735 useless extension candidates. Maximal degree in co-relation 69319. Up to 6257 conditions per place. [2024-05-12 13:02:10,396 INFO L140 encePairwiseOnDemand]: 23/38 looper letters, 779 selfloop transitions, 133 changer transitions 0/920 dead transitions. [2024-05-12 13:02:10,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 920 transitions, 20220 flow [2024-05-12 13:02:10,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:02:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:02:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2024-05-12 13:02:10,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48325358851674644 [2024-05-12 13:02:10,397 INFO L175 Difference]: Start difference. First operand has 382 places, 846 transitions, 17524 flow. Second operand 11 states and 202 transitions. [2024-05-12 13:02:10,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 920 transitions, 20220 flow [2024-05-12 13:02:11,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 920 transitions, 20097 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-05-12 13:02:11,515 INFO L231 Difference]: Finished difference. Result has 390 places, 864 transitions, 18021 flow [2024-05-12 13:02:11,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=17401, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18021, PETRI_PLACES=390, PETRI_TRANSITIONS=864} [2024-05-12 13:02:11,515 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 348 predicate places. [2024-05-12 13:02:11,515 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 864 transitions, 18021 flow [2024-05-12 13:02:11,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:02:11,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:02:11,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:02:11,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-05-12 13:02:11,516 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:02:11,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:02:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash 162633303, now seen corresponding path program 5 times [2024-05-12 13:02:11,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:02:11,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490852534] [2024-05-12 13:02:11,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:02:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:02:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:02:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:02:12,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:02:12,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490852534] [2024-05-12 13:02:12,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490852534] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:02:12,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:02:12,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:02:12,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434629628] [2024-05-12 13:02:12,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:02:12,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:02:12,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:02:12,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:02:12,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:02:12,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:02:12,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 864 transitions, 18021 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:02:12,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:02:12,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:02:12,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:02:15,481 INFO L124 PetriNetUnfolderBase]: 4352/8731 cut-off events. [2024-05-12 13:02:15,481 INFO L125 PetriNetUnfolderBase]: For 255914/255953 co-relation queries the response was YES. [2024-05-12 13:02:15,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70187 conditions, 8731 events. 4352/8731 cut-off events. For 255914/255953 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 76642 event pairs, 1221 based on Foata normal form. 24/8728 useless extension candidates. Maximal degree in co-relation 70008. Up to 6459 conditions per place. [2024-05-12 13:02:15,591 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 792 selfloop transitions, 104 changer transitions 0/904 dead transitions. [2024-05-12 13:02:15,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 904 transitions, 20150 flow [2024-05-12 13:02:15,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:02:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:02:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-05-12 13:02:15,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-05-12 13:02:15,592 INFO L175 Difference]: Start difference. First operand has 390 places, 864 transitions, 18021 flow. Second operand 10 states and 180 transitions. [2024-05-12 13:02:15,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 904 transitions, 20150 flow [2024-05-12 13:02:16,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 904 transitions, 19909 flow, removed 52 selfloop flow, removed 7 redundant places. [2024-05-12 13:02:16,868 INFO L231 Difference]: Finished difference. Result has 393 places, 864 transitions, 18003 flow [2024-05-12 13:02:16,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=17780, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=760, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18003, PETRI_PLACES=393, PETRI_TRANSITIONS=864} [2024-05-12 13:02:16,869 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 351 predicate places. [2024-05-12 13:02:16,869 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 864 transitions, 18003 flow [2024-05-12 13:02:16,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:02:16,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:02:16,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:02:16,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-05-12 13:02:16,870 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:02:16,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:02:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash 268867513, now seen corresponding path program 3 times [2024-05-12 13:02:16,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:02:16,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383064793] [2024-05-12 13:02:16,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:02:16,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:02:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:02:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:02:18,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:02:18,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383064793] [2024-05-12 13:02:18,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383064793] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:02:18,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:02:18,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:02:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835956586] [2024-05-12 13:02:18,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:02:18,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:02:18,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:02:18,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:02:18,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:02:18,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:02:18,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 864 transitions, 18003 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:02:18,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:02:18,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:02:18,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:02:21,445 INFO L124 PetriNetUnfolderBase]: 4801/9114 cut-off events. [2024-05-12 13:02:21,445 INFO L125 PetriNetUnfolderBase]: For 307953/308026 co-relation queries the response was YES. [2024-05-12 13:02:21,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76058 conditions, 9114 events. 4801/9114 cut-off events. For 307953/308026 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 76834 event pairs, 677 based on Foata normal form. 68/9141 useless extension candidates. Maximal degree in co-relation 75877. Up to 2579 conditions per place. [2024-05-12 13:02:21,559 INFO L140 encePairwiseOnDemand]: 23/38 looper letters, 575 selfloop transitions, 436 changer transitions 0/1019 dead transitions. [2024-05-12 13:02:21,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 1019 transitions, 22452 flow [2024-05-12 13:02:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-12 13:02:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-05-12 13:02:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 276 transitions. [2024-05-12 13:02:21,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518796992481203 [2024-05-12 13:02:21,560 INFO L175 Difference]: Start difference. First operand has 393 places, 864 transitions, 18003 flow. Second operand 14 states and 276 transitions. [2024-05-12 13:02:21,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 1019 transitions, 22452 flow [2024-05-12 13:02:23,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 1019 transitions, 22253 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 13:02:23,105 INFO L231 Difference]: Finished difference. Result has 402 places, 921 transitions, 19925 flow [2024-05-12 13:02:23,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=17808, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=385, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=19925, PETRI_PLACES=402, PETRI_TRANSITIONS=921} [2024-05-12 13:02:23,105 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 360 predicate places. [2024-05-12 13:02:23,105 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 921 transitions, 19925 flow [2024-05-12 13:02:23,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:02:23,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:02:23,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:02:23,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-05-12 13:02:23,106 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:02:23,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:02:23,106 INFO L85 PathProgramCache]: Analyzing trace with hash -950173697, now seen corresponding path program 4 times [2024-05-12 13:02:23,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:02:23,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251313386] [2024-05-12 13:02:23,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:02:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:02:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:02:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:02:24,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:02:24,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251313386] [2024-05-12 13:02:24,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251313386] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:02:24,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:02:24,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:02:24,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537746966] [2024-05-12 13:02:24,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:02:24,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:02:24,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:02:24,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:02:24,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:02:24,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:02:24,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 921 transitions, 19925 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:02:24,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:02:24,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:02:24,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:02:28,214 INFO L124 PetriNetUnfolderBase]: 5777/11135 cut-off events. [2024-05-12 13:02:28,214 INFO L125 PetriNetUnfolderBase]: For 377753/377791 co-relation queries the response was YES. [2024-05-12 13:02:28,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92505 conditions, 11135 events. 5777/11135 cut-off events. For 377753/377791 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 98750 event pairs, 894 based on Foata normal form. 36/11125 useless extension candidates. Maximal degree in co-relation 92320. Up to 3818 conditions per place. [2024-05-12 13:02:28,365 INFO L140 encePairwiseOnDemand]: 24/38 looper letters, 810 selfloop transitions, 401 changer transitions 0/1219 dead transitions. [2024-05-12 13:02:28,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 1219 transitions, 27088 flow [2024-05-12 13:02:28,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:02:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:02:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2024-05-12 13:02:28,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311004784688995 [2024-05-12 13:02:28,366 INFO L175 Difference]: Start difference. First operand has 402 places, 921 transitions, 19925 flow. Second operand 11 states and 222 transitions. [2024-05-12 13:02:28,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 1219 transitions, 27088 flow [2024-05-12 13:02:30,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 1219 transitions, 26457 flow, removed 228 selfloop flow, removed 6 redundant places. [2024-05-12 13:02:30,302 INFO L231 Difference]: Finished difference. Result has 410 places, 1060 transitions, 23171 flow [2024-05-12 13:02:30,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=19596, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=297, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=23171, PETRI_PLACES=410, PETRI_TRANSITIONS=1060} [2024-05-12 13:02:30,302 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 368 predicate places. [2024-05-12 13:02:30,302 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 1060 transitions, 23171 flow [2024-05-12 13:02:30,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:02:30,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:02:30,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:02:30,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-05-12 13:02:30,303 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:02:30,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:02:30,303 INFO L85 PathProgramCache]: Analyzing trace with hash -950353187, now seen corresponding path program 5 times [2024-05-12 13:02:30,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:02:30,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687590435] [2024-05-12 13:02:30,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:02:30,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:02:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:02:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:02:31,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:02:31,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687590435] [2024-05-12 13:02:31,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687590435] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:02:31,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:02:31,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:02:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785937965] [2024-05-12 13:02:31,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:02:31,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:02:31,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:02:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:02:31,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:02:31,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-05-12 13:02:31,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 1060 transitions, 23171 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:02:31,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:02:31,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-05-12 13:02:31,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand