./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/protection/mix006.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i ./goblint.2024-06-19_11-23-25.files/protection/mix006.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 19:48:55,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 19:48:55,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 19:48:55,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 19:48:55,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 19:48:55,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 19:48:55,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 19:48:55,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 19:48:55,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 19:48:55,738 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 19:48:55,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 19:48:55,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 19:48:55,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 19:48:55,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 19:48:55,741 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 19:48:55,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 19:48:55,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 19:48:55,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 19:48:55,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 19:48:55,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 19:48:55,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 19:48:55,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 19:48:55,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 19:48:55,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 19:48:55,744 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 19:48:55,744 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 19:48:55,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 19:48:55,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 19:48:55,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 19:48:55,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 19:48:55,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 19:48:55,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 19:48:55,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:48:55,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 19:48:55,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 19:48:55,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 19:48:55,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 19:48:55,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 19:48:55,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 19:48:55,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 19:48:55,748 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 19:48:55,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 19:48:55,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 19:48:55,749 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-27 19:48:55,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 19:48:56,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 19:48:56,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 19:48:56,003 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 19:48:56,004 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 19:48:56,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/mix006.opt.yml/witness.yml [2024-06-27 19:48:56,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 19:48:56,152 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 19:48:56,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2024-06-27 19:48:57,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 19:48:57,403 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 19:48:57,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2024-06-27 19:48:57,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b70d028/1ae9b2a3a14147228cd7ec7cff0a33bf/FLAGc85fedaab [2024-06-27 19:48:57,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b70d028/1ae9b2a3a14147228cd7ec7cff0a33bf [2024-06-27 19:48:57,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 19:48:57,431 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 19:48:57,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 19:48:57,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 19:48:57,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 19:48:57,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:48:56" (1/2) ... [2024-06-27 19:48:57,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@512b2764 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:48:57, skipping insertion in model container [2024-06-27 19:48:57,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:48:56" (1/2) ... [2024-06-27 19:48:57,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3ce5ad7e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:48:57, skipping insertion in model container [2024-06-27 19:48:57,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:48:57" (2/2) ... [2024-06-27 19:48:57,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@512b2764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:57, skipping insertion in model container [2024-06-27 19:48:57,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:48:57" (2/2) ... [2024-06-27 19:48:57,439 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 19:48:57,528 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 19:48:57,529 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) [2024-06-27 19:48:57,530 INFO L97 edCorrectnessWitness]: Location invariant before [L852-L852] (((((((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) [2024-06-27 19:48:57,530 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] (((((((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) [2024-06-27 19:48:57,530 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 19:48:57,530 INFO L106 edCorrectnessWitness]: ghost_update [L847-L847] multithreaded = 1; [2024-06-27 19:48:57,578 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 19:48:57,877 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:48:57,910 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 19:48:58,041 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:48:58,078 INFO L206 MainTranslator]: Completed translation [2024-06-27 19:48:58,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58 WrapperNode [2024-06-27 19:48:58,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 19:48:58,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 19:48:58,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 19:48:58,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 19:48:58,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (1/1) ... [2024-06-27 19:48:58,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (1/1) ... [2024-06-27 19:48:58,124 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2024-06-27 19:48:58,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 19:48:58,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 19:48:58,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 19:48:58,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 19:48:58,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (1/1) ... [2024-06-27 19:48:58,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (1/1) ... [2024-06-27 19:48:58,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (1/1) ... [2024-06-27 19:48:58,165 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 19:48:58,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (1/1) ... [2024-06-27 19:48:58,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (1/1) ... [2024-06-27 19:48:58,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (1/1) ... [2024-06-27 19:48:58,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (1/1) ... [2024-06-27 19:48:58,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (1/1) ... [2024-06-27 19:48:58,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (1/1) ... [2024-06-27 19:48:58,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 19:48:58,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 19:48:58,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 19:48:58,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 19:48:58,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (1/1) ... [2024-06-27 19:48:58,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:48:58,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:48:58,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 19:48:58,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 19:48:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 19:48:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 19:48:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 19:48:58,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 19:48:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 19:48:58,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 19:48:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 19:48:58,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 19:48:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 19:48:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 19:48:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 19:48:58,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 19:48:58,280 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 19:48:58,398 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 19:48:58,400 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 19:48:58,732 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 19:48:58,733 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 19:48:58,907 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 19:48:58,907 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 19:48:58,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:48:58 BoogieIcfgContainer [2024-06-27 19:48:58,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 19:48:58,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 19:48:58,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 19:48:58,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 19:48:58,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:48:56" (1/4) ... [2024-06-27 19:48:58,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88a8b83 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 07:48:58, skipping insertion in model container [2024-06-27 19:48:58,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 07:48:57" (2/4) ... [2024-06-27 19:48:58,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88a8b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 07:48:58, skipping insertion in model container [2024-06-27 19:48:58,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:48:58" (3/4) ... [2024-06-27 19:48:58,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88a8b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 07:48:58, skipping insertion in model container [2024-06-27 19:48:58,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:48:58" (4/4) ... [2024-06-27 19:48:58,917 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2024-06-27 19:48:58,930 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 19:48:58,931 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 19:48:58,931 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 19:48:58,972 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 19:48:59,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-27 19:48:59,041 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-27 19:48:59,042 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 19:48:59,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 19:48:59,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-27 19:48:59,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-27 19:48:59,060 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 19:48:59,065 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;@6f6fa3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 19:48:59,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 19:48:59,068 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 19:48:59,068 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 19:48:59,068 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 19:48:59,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:48:59,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 19:48:59,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:48:59,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:48:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash 398955286, now seen corresponding path program 1 times [2024-06-27 19:48:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:48:59,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781210579] [2024-06-27 19:48:59,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:48:59,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:48:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:48:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:48:59,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:48:59,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781210579] [2024-06-27 19:48:59,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781210579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:48:59,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:48:59,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 19:48:59,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820939109] [2024-06-27 19:48:59,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:48:59,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:48:59,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:48:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:48:59,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:48:59,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-06-27 19:48:59,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:48:59,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:48:59,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-06-27 19:49:00,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:00,264 INFO L124 PetriNetUnfolderBase]: 1116/1776 cut-off events. [2024-06-27 19:49:00,264 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-27 19:49:00,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 1776 events. 1116/1776 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8974 event pairs, 765 based on Foata normal form. 1/1713 useless extension candidates. Maximal degree in co-relation 3515. Up to 1676 conditions per place. [2024-06-27 19:49:00,278 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 31 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-27 19:49:00,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 171 flow [2024-06-27 19:49:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:49:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:49:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-27 19:49:00,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2024-06-27 19:49:00,289 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 80 transitions. [2024-06-27 19:49:00,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 171 flow [2024-06-27 19:49:00,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 19:49:00,293 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-27 19:49:00,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-27 19:49:00,296 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-27 19:49:00,296 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-27 19:49:00,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:00,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:00,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:00,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 19:49:00,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:00,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1144019377, now seen corresponding path program 1 times [2024-06-27 19:49:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:00,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108505786] [2024-06-27 19:49:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:00,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:00,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:00,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108505786] [2024-06-27 19:49:00,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108505786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:00,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:00,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 19:49:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696034421] [2024-06-27 19:49:00,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:00,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:49:00,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:00,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:49:00,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:49:00,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-27 19:49:00,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:00,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:00,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-27 19:49:00,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:00,950 INFO L124 PetriNetUnfolderBase]: 1280/1982 cut-off events. [2024-06-27 19:49:00,951 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2024-06-27 19:49:00,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4503 conditions, 1982 events. 1280/1982 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9782 event pairs, 750 based on Foata normal form. 3/1979 useless extension candidates. Maximal degree in co-relation 4491. Up to 1897 conditions per place. [2024-06-27 19:49:00,960 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 39 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-06-27 19:49:00,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 240 flow [2024-06-27 19:49:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 19:49:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 19:49:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-06-27 19:49:00,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6011904761904762 [2024-06-27 19:49:00,962 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 101 transitions. [2024-06-27 19:49:00,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 240 flow [2024-06-27 19:49:00,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 19:49:00,964 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow [2024-06-27 19:49:00,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-27 19:49:00,965 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-27 19:49:00,965 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow [2024-06-27 19:49:00,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:00,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:00,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:00,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 19:49:00,966 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:00,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:00,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1104863043, now seen corresponding path program 1 times [2024-06-27 19:49:00,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:00,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924310667] [2024-06-27 19:49:00,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:00,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:01,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-06-27 19:49:01,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924310667] [2024-06-27 19:49:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924310667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:01,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:01,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:49:01,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493430096] [2024-06-27 19:49:01,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:01,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:49:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:01,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:49:01,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:49:01,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-27 19:49:01,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:01,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:01,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-27 19:49:01,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:01,802 INFO L124 PetriNetUnfolderBase]: 1568/2406 cut-off events. [2024-06-27 19:49:01,802 INFO L125 PetriNetUnfolderBase]: For 1364/1364 co-relation queries the response was YES. [2024-06-27 19:49:01,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6039 conditions, 2406 events. 1568/2406 cut-off events. For 1364/1364 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11887 event pairs, 669 based on Foata normal form. 5/2408 useless extension candidates. Maximal degree in co-relation 6025. Up to 2248 conditions per place. [2024-06-27 19:49:01,811 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 53 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2024-06-27 19:49:01,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 396 flow [2024-06-27 19:49:01,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:49:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:49:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-06-27 19:49:01,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2024-06-27 19:49:01,814 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 128 transitions. [2024-06-27 19:49:01,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 396 flow [2024-06-27 19:49:01,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 382 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 19:49:01,816 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 237 flow [2024-06-27 19:49:01,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2024-06-27 19:49:01,817 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-27 19:49:01,817 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 237 flow [2024-06-27 19:49:01,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:01,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:01,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:01,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 19:49:01,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:01,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash -801262658, now seen corresponding path program 1 times [2024-06-27 19:49:01,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:01,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653470733] [2024-06-27 19:49:01,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:01,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:02,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:02,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653470733] [2024-06-27 19:49:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653470733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:02,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:02,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:49:02,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876016627] [2024-06-27 19:49:02,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:02,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:49:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:02,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:49:02,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:49:02,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-27 19:49:02,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:02,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:02,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-27 19:49:02,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:02,727 INFO L124 PetriNetUnfolderBase]: 1580/2426 cut-off events. [2024-06-27 19:49:02,727 INFO L125 PetriNetUnfolderBase]: For 3226/3228 co-relation queries the response was YES. [2024-06-27 19:49:02,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7183 conditions, 2426 events. 1580/2426 cut-off events. For 3226/3228 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12009 event pairs, 481 based on Foata normal form. 12/2435 useless extension candidates. Maximal degree in co-relation 7166. Up to 2216 conditions per place. [2024-06-27 19:49:02,738 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 57 selfloop transitions, 19 changer transitions 0/82 dead transitions. [2024-06-27 19:49:02,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 499 flow [2024-06-27 19:49:02,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:49:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:49:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-06-27 19:49:02,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-27 19:49:02,740 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 237 flow. Second operand 6 states and 147 transitions. [2024-06-27 19:49:02,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 499 flow [2024-06-27 19:49:02,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 491 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-27 19:49:02,744 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 293 flow [2024-06-27 19:49:02,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-06-27 19:49:02,745 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2024-06-27 19:49:02,745 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 293 flow [2024-06-27 19:49:02,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:02,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:02,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:02,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 19:49:02,746 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:02,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:02,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1011703320, now seen corresponding path program 1 times [2024-06-27 19:49:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:02,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769119020] [2024-06-27 19:49:02,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:03,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:03,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769119020] [2024-06-27 19:49:03,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769119020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:03,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:03,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:49:03,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440013772] [2024-06-27 19:49:03,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:03,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:49:03,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:03,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:49:03,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:49:03,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:49:03,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 293 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:03,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:03,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:49:03,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:03,613 INFO L124 PetriNetUnfolderBase]: 1368/2159 cut-off events. [2024-06-27 19:49:03,614 INFO L125 PetriNetUnfolderBase]: For 4097/4097 co-relation queries the response was YES. [2024-06-27 19:49:03,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6930 conditions, 2159 events. 1368/2159 cut-off events. For 4097/4097 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10907 event pairs, 562 based on Foata normal form. 2/2140 useless extension candidates. Maximal degree in co-relation 6909. Up to 2036 conditions per place. [2024-06-27 19:49:03,624 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 49 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2024-06-27 19:49:03,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 435 flow [2024-06-27 19:49:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:49:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:49:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-27 19:49:03,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 19:49:03,626 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 293 flow. Second operand 5 states and 100 transitions. [2024-06-27 19:49:03,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 435 flow [2024-06-27 19:49:03,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 385 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:03,629 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 267 flow [2024-06-27 19:49:03,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2024-06-27 19:49:03,630 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2024-06-27 19:49:03,630 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 267 flow [2024-06-27 19:49:03,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:03,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:03,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:03,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 19:49:03,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:03,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:03,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1325736148, now seen corresponding path program 1 times [2024-06-27 19:49:03,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:03,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812148534] [2024-06-27 19:49:03,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:03,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:04,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812148534] [2024-06-27 19:49:04,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812148534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:04,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:04,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:49:04,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024533975] [2024-06-27 19:49:04,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:04,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:49:04,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:04,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:49:04,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:49:04,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:49:04,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 267 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-06-27 19:49:04,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:04,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:49:04,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:04,762 INFO L124 PetriNetUnfolderBase]: 1358/2171 cut-off events. [2024-06-27 19:49:04,763 INFO L125 PetriNetUnfolderBase]: For 4747/4747 co-relation queries the response was YES. [2024-06-27 19:49:04,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6938 conditions, 2171 events. 1358/2171 cut-off events. For 4747/4747 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11000 event pairs, 526 based on Foata normal form. 4/2166 useless extension candidates. Maximal degree in co-relation 6915. Up to 2004 conditions per place. [2024-06-27 19:49:04,775 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 54 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2024-06-27 19:49:04,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 455 flow [2024-06-27 19:49:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:49:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:49:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2024-06-27 19:49:04,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 19:49:04,776 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 267 flow. Second operand 6 states and 119 transitions. [2024-06-27 19:49:04,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 455 flow [2024-06-27 19:49:04,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 433 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:04,780 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 299 flow [2024-06-27 19:49:04,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2024-06-27 19:49:04,781 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2024-06-27 19:49:04,781 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 299 flow [2024-06-27 19:49:04,781 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-06-27 19:49:04,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:04,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:04,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 19:49:04,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:04,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1846131877, now seen corresponding path program 1 times [2024-06-27 19:49:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:04,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348523950] [2024-06-27 19:49:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:04,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:05,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:05,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348523950] [2024-06-27 19:49:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348523950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:05,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:49:05,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156045562] [2024-06-27 19:49:05,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:05,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:49:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:05,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:49:05,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:49:05,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:05,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 299 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:05,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:05,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:05,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:05,885 INFO L124 PetriNetUnfolderBase]: 1571/2394 cut-off events. [2024-06-27 19:49:05,886 INFO L125 PetriNetUnfolderBase]: For 7305/7309 co-relation queries the response was YES. [2024-06-27 19:49:05,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8368 conditions, 2394 events. 1571/2394 cut-off events. For 7305/7309 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11650 event pairs, 635 based on Foata normal form. 8/2401 useless extension candidates. Maximal degree in co-relation 8345. Up to 2253 conditions per place. [2024-06-27 19:49:05,898 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 54 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2024-06-27 19:49:05,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 541 flow [2024-06-27 19:49:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:49:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:49:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-27 19:49:05,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2024-06-27 19:49:05,900 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 299 flow. Second operand 6 states and 122 transitions. [2024-06-27 19:49:05,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 541 flow [2024-06-27 19:49:05,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 511 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:05,904 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 341 flow [2024-06-27 19:49:05,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=341, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2024-06-27 19:49:05,905 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2024-06-27 19:49:05,905 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 341 flow [2024-06-27 19:49:05,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:05,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:05,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:05,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 19:49:05,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:05,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1584246969, now seen corresponding path program 2 times [2024-06-27 19:49:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:05,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220538913] [2024-06-27 19:49:05,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:05,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:06,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:06,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220538913] [2024-06-27 19:49:06,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220538913] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:06,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:06,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:49:06,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428730100] [2024-06-27 19:49:06,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:06,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:49:06,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:49:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:49:06,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:06,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 341 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:06,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:06,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:06,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:06,878 INFO L124 PetriNetUnfolderBase]: 1559/2367 cut-off events. [2024-06-27 19:49:06,879 INFO L125 PetriNetUnfolderBase]: For 8725/8725 co-relation queries the response was YES. [2024-06-27 19:49:06,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8537 conditions, 2367 events. 1559/2367 cut-off events. For 8725/8725 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11458 event pairs, 649 based on Foata normal form. 2/2365 useless extension candidates. Maximal degree in co-relation 8513. Up to 2237 conditions per place. [2024-06-27 19:49:06,898 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 48 selfloop transitions, 20 changer transitions 0/73 dead transitions. [2024-06-27 19:49:06,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 515 flow [2024-06-27 19:49:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:49:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:49:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-27 19:49:06,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2024-06-27 19:49:06,902 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 341 flow. Second operand 6 states and 118 transitions. [2024-06-27 19:49:06,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 515 flow [2024-06-27 19:49:06,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 486 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 19:49:06,909 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 360 flow [2024-06-27 19:49:06,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-06-27 19:49:06,912 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-06-27 19:49:06,912 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 360 flow [2024-06-27 19:49:06,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:06,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:06,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:06,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 19:49:06,913 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:06,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1889539607, now seen corresponding path program 1 times [2024-06-27 19:49:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:06,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428813919] [2024-06-27 19:49:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:07,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-06-27 19:49:07,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:07,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428813919] [2024-06-27 19:49:07,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428813919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:07,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:07,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:07,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463685642] [2024-06-27 19:49:07,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:07,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:07,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:07,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:07,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:07,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:07,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 360 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:07,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:07,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:07,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:08,073 INFO L124 PetriNetUnfolderBase]: 1733/2649 cut-off events. [2024-06-27 19:49:08,073 INFO L125 PetriNetUnfolderBase]: For 11612/11616 co-relation queries the response was YES. [2024-06-27 19:49:08,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9924 conditions, 2649 events. 1733/2649 cut-off events. For 11612/11616 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13070 event pairs, 547 based on Foata normal form. 9/2657 useless extension candidates. Maximal degree in co-relation 9899. Up to 2237 conditions per place. [2024-06-27 19:49:08,088 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 79 selfloop transitions, 39 changer transitions 0/123 dead transitions. [2024-06-27 19:49:08,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 123 transitions, 997 flow [2024-06-27 19:49:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:49:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:49:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-27 19:49:08,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029761904761905 [2024-06-27 19:49:08,090 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 360 flow. Second operand 8 states and 169 transitions. [2024-06-27 19:49:08,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 123 transitions, 997 flow [2024-06-27 19:49:08,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 123 transitions, 871 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 19:49:08,098 INFO L231 Difference]: Finished difference. Result has 69 places, 82 transitions, 581 flow [2024-06-27 19:49:08,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=581, PETRI_PLACES=69, PETRI_TRANSITIONS=82} [2024-06-27 19:49:08,100 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2024-06-27 19:49:08,100 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 82 transitions, 581 flow [2024-06-27 19:49:08,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:08,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:08,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:08,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 19:49:08,101 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:08,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:08,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1562649223, now seen corresponding path program 2 times [2024-06-27 19:49:08,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:08,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527333296] [2024-06-27 19:49:08,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:08,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527333296] [2024-06-27 19:49:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527333296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:08,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:08,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523192974] [2024-06-27 19:49:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:08,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:08,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:08,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:08,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:08,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 82 transitions, 581 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:08,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:08,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:08,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:09,401 INFO L124 PetriNetUnfolderBase]: 1805/2765 cut-off events. [2024-06-27 19:49:09,401 INFO L125 PetriNetUnfolderBase]: For 15152/15156 co-relation queries the response was YES. [2024-06-27 19:49:09,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11381 conditions, 2765 events. 1805/2765 cut-off events. For 15152/15156 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13773 event pairs, 559 based on Foata normal form. 12/2776 useless extension candidates. Maximal degree in co-relation 11352. Up to 2285 conditions per place. [2024-06-27 19:49:09,417 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 65 selfloop transitions, 48 changer transitions 0/118 dead transitions. [2024-06-27 19:49:09,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 118 transitions, 1003 flow [2024-06-27 19:49:09,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:49:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:49:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2024-06-27 19:49:09,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931972789115646 [2024-06-27 19:49:09,418 INFO L175 Difference]: Start difference. First operand has 69 places, 82 transitions, 581 flow. Second operand 7 states and 145 transitions. [2024-06-27 19:49:09,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 118 transitions, 1003 flow [2024-06-27 19:49:09,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 118 transitions, 975 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-27 19:49:09,429 INFO L231 Difference]: Finished difference. Result has 74 places, 89 transitions, 734 flow [2024-06-27 19:49:09,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=734, PETRI_PLACES=74, PETRI_TRANSITIONS=89} [2024-06-27 19:49:09,429 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2024-06-27 19:49:09,430 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 89 transitions, 734 flow [2024-06-27 19:49:09,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:09,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:09,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:09,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 19:49:09,430 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:09,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1866777303, now seen corresponding path program 3 times [2024-06-27 19:49:09,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:09,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145710204] [2024-06-27 19:49:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:09,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:10,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-06-27 19:49:10,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:10,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145710204] [2024-06-27 19:49:10,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145710204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:10,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:10,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:10,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985111038] [2024-06-27 19:49:10,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:10,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:10,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:10,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:10,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:10,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:10,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 89 transitions, 734 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:10,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:10,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:10,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:10,639 INFO L124 PetriNetUnfolderBase]: 1841/2818 cut-off events. [2024-06-27 19:49:10,639 INFO L125 PetriNetUnfolderBase]: For 18412/18414 co-relation queries the response was YES. [2024-06-27 19:49:10,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12391 conditions, 2818 events. 1841/2818 cut-off events. For 18412/18414 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 14017 event pairs, 563 based on Foata normal form. 6/2818 useless extension candidates. Maximal degree in co-relation 12360. Up to 2301 conditions per place. [2024-06-27 19:49:10,656 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 62 selfloop transitions, 60 changer transitions 0/127 dead transitions. [2024-06-27 19:49:10,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 127 transitions, 1268 flow [2024-06-27 19:49:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:49:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:49:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2024-06-27 19:49:10,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931972789115646 [2024-06-27 19:49:10,658 INFO L175 Difference]: Start difference. First operand has 74 places, 89 transitions, 734 flow. Second operand 7 states and 145 transitions. [2024-06-27 19:49:10,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 127 transitions, 1268 flow [2024-06-27 19:49:10,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 127 transitions, 1152 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:10,675 INFO L231 Difference]: Finished difference. Result has 77 places, 99 transitions, 882 flow [2024-06-27 19:49:10,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=882, PETRI_PLACES=77, PETRI_TRANSITIONS=99} [2024-06-27 19:49:10,676 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2024-06-27 19:49:10,676 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 99 transitions, 882 flow [2024-06-27 19:49:10,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:10,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:10,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:10,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 19:49:10,676 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:10,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1572646189, now seen corresponding path program 4 times [2024-06-27 19:49:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:10,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819846347] [2024-06-27 19:49:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:11,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:11,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819846347] [2024-06-27 19:49:11,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819846347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:11,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:11,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:11,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200058576] [2024-06-27 19:49:11,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:11,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:11,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:11,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:11,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:11,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:11,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 99 transitions, 882 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:11,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:11,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:11,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:12,000 INFO L124 PetriNetUnfolderBase]: 1825/2793 cut-off events. [2024-06-27 19:49:12,001 INFO L125 PetriNetUnfolderBase]: For 18612/18614 co-relation queries the response was YES. [2024-06-27 19:49:12,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12206 conditions, 2793 events. 1825/2793 cut-off events. For 18612/18614 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13882 event pairs, 572 based on Foata normal form. 6/2793 useless extension candidates. Maximal degree in co-relation 12174. Up to 2294 conditions per place. [2024-06-27 19:49:12,015 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 62 selfloop transitions, 58 changer transitions 0/125 dead transitions. [2024-06-27 19:49:12,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 125 transitions, 1242 flow [2024-06-27 19:49:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:49:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:49:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-06-27 19:49:12,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-27 19:49:12,018 INFO L175 Difference]: Start difference. First operand has 77 places, 99 transitions, 882 flow. Second operand 7 states and 144 transitions. [2024-06-27 19:49:12,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 125 transitions, 1242 flow [2024-06-27 19:49:12,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 125 transitions, 1146 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-27 19:49:12,038 INFO L231 Difference]: Finished difference. Result has 81 places, 99 transitions, 912 flow [2024-06-27 19:49:12,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=912, PETRI_PLACES=81, PETRI_TRANSITIONS=99} [2024-06-27 19:49:12,039 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2024-06-27 19:49:12,039 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 99 transitions, 912 flow [2024-06-27 19:49:12,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:12,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:12,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:12,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 19:49:12,041 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:12,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:12,042 INFO L85 PathProgramCache]: Analyzing trace with hash 787456522, now seen corresponding path program 1 times [2024-06-27 19:49:12,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:12,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30453894] [2024-06-27 19:49:12,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:12,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:12,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30453894] [2024-06-27 19:49:12,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30453894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:12,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:12,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:49:12,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285303652] [2024-06-27 19:49:12,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:12,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:49:12,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:12,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:49:12,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:49:12,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-27 19:49:12,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 99 transitions, 912 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:12,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:12,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-27 19:49:12,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:12,941 INFO L124 PetriNetUnfolderBase]: 1510/2459 cut-off events. [2024-06-27 19:49:12,941 INFO L125 PetriNetUnfolderBase]: For 18210/18229 co-relation queries the response was YES. [2024-06-27 19:49:12,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10757 conditions, 2459 events. 1510/2459 cut-off events. For 18210/18229 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 13087 event pairs, 521 based on Foata normal form. 8/2451 useless extension candidates. Maximal degree in co-relation 10723. Up to 2206 conditions per place. [2024-06-27 19:49:12,958 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 89 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2024-06-27 19:49:12,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 110 transitions, 1150 flow [2024-06-27 19:49:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:49:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:49:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-27 19:49:12,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 19:49:12,960 INFO L175 Difference]: Start difference. First operand has 81 places, 99 transitions, 912 flow. Second operand 5 states and 100 transitions. [2024-06-27 19:49:12,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 110 transitions, 1150 flow [2024-06-27 19:49:12,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 110 transitions, 1007 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 19:49:12,975 INFO L231 Difference]: Finished difference. Result has 80 places, 102 transitions, 817 flow [2024-06-27 19:49:12,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=817, PETRI_PLACES=80, PETRI_TRANSITIONS=102} [2024-06-27 19:49:12,976 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2024-06-27 19:49:12,976 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 102 transitions, 817 flow [2024-06-27 19:49:12,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:12,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:12,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:12,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 19:49:12,977 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:12,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:12,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2001640229, now seen corresponding path program 1 times [2024-06-27 19:49:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:12,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585329096] [2024-06-27 19:49:12,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:13,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:13,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585329096] [2024-06-27 19:49:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585329096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:13,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:13,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:49:13,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884781576] [2024-06-27 19:49:13,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:13,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:49:13,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:13,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:49:13,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:49:13,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:13,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 102 transitions, 817 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:13,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:13,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:13,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:14,559 INFO L124 PetriNetUnfolderBase]: 1866/2883 cut-off events. [2024-06-27 19:49:14,572 INFO L125 PetriNetUnfolderBase]: For 22504/22508 co-relation queries the response was YES. [2024-06-27 19:49:14,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12838 conditions, 2883 events. 1866/2883 cut-off events. For 22504/22508 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14600 event pairs, 565 based on Foata normal form. 8/2890 useless extension candidates. Maximal degree in co-relation 12803. Up to 2328 conditions per place. [2024-06-27 19:49:14,602 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 75 selfloop transitions, 62 changer transitions 0/142 dead transitions. [2024-06-27 19:49:14,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 142 transitions, 1319 flow [2024-06-27 19:49:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:49:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:49:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-27 19:49:14,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2024-06-27 19:49:14,604 INFO L175 Difference]: Start difference. First operand has 80 places, 102 transitions, 817 flow. Second operand 8 states and 163 transitions. [2024-06-27 19:49:14,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 142 transitions, 1319 flow [2024-06-27 19:49:14,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 142 transitions, 1293 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 19:49:14,620 INFO L231 Difference]: Finished difference. Result has 85 places, 108 transitions, 1003 flow [2024-06-27 19:49:14,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1003, PETRI_PLACES=85, PETRI_TRANSITIONS=108} [2024-06-27 19:49:14,621 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2024-06-27 19:49:14,621 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 108 transitions, 1003 flow [2024-06-27 19:49:14,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:14,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:14,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:14,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 19:49:14,622 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:14,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:14,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2001634649, now seen corresponding path program 2 times [2024-06-27 19:49:14,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:14,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739151767] [2024-06-27 19:49:14,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:14,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:15,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:15,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739151767] [2024-06-27 19:49:15,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739151767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:15,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:15,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:15,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113881458] [2024-06-27 19:49:15,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:15,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:15,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:15,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:15,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:15,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:15,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 108 transitions, 1003 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:15,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:15,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:15,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:15,929 INFO L124 PetriNetUnfolderBase]: 1898/2954 cut-off events. [2024-06-27 19:49:15,929 INFO L125 PetriNetUnfolderBase]: For 27037/27045 co-relation queries the response was YES. [2024-06-27 19:49:15,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13731 conditions, 2954 events. 1898/2954 cut-off events. For 27037/27045 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 15149 event pairs, 576 based on Foata normal form. 14/2967 useless extension candidates. Maximal degree in co-relation 13695. Up to 2357 conditions per place. [2024-06-27 19:49:15,961 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 72 selfloop transitions, 69 changer transitions 0/146 dead transitions. [2024-06-27 19:49:15,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 146 transitions, 1523 flow [2024-06-27 19:49:15,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:49:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:49:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-06-27 19:49:15,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068027210884354 [2024-06-27 19:49:15,962 INFO L175 Difference]: Start difference. First operand has 85 places, 108 transitions, 1003 flow. Second operand 7 states and 149 transitions. [2024-06-27 19:49:15,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 146 transitions, 1523 flow [2024-06-27 19:49:15,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 146 transitions, 1359 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-27 19:49:15,989 INFO L231 Difference]: Finished difference. Result has 86 places, 114 transitions, 1076 flow [2024-06-27 19:49:15,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1076, PETRI_PLACES=86, PETRI_TRANSITIONS=114} [2024-06-27 19:49:15,990 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2024-06-27 19:49:15,990 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 114 transitions, 1076 flow [2024-06-27 19:49:15,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:15,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:15,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:15,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 19:49:15,991 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:15,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:15,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2035520401, now seen corresponding path program 3 times [2024-06-27 19:49:15,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:15,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882687780] [2024-06-27 19:49:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:16,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:16,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882687780] [2024-06-27 19:49:16,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882687780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:16,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:16,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:49:16,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917119762] [2024-06-27 19:49:16,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:16,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:49:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:16,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:49:16,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:49:16,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:16,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 114 transitions, 1076 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:16,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:16,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:16,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:17,574 INFO L124 PetriNetUnfolderBase]: 1934/3010 cut-off events. [2024-06-27 19:49:17,575 INFO L125 PetriNetUnfolderBase]: For 29974/29976 co-relation queries the response was YES. [2024-06-27 19:49:17,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14257 conditions, 3010 events. 1934/3010 cut-off events. For 29974/29976 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15516 event pairs, 562 based on Foata normal form. 6/3010 useless extension candidates. Maximal degree in co-relation 14220. Up to 2389 conditions per place. [2024-06-27 19:49:17,590 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 74 selfloop transitions, 78 changer transitions 0/157 dead transitions. [2024-06-27 19:49:17,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 157 transitions, 1640 flow [2024-06-27 19:49:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:49:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:49:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-27 19:49:17,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47354497354497355 [2024-06-27 19:49:17,595 INFO L175 Difference]: Start difference. First operand has 86 places, 114 transitions, 1076 flow. Second operand 9 states and 179 transitions. [2024-06-27 19:49:17,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 157 transitions, 1640 flow [2024-06-27 19:49:17,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 157 transitions, 1458 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-27 19:49:17,621 INFO L231 Difference]: Finished difference. Result has 90 places, 120 transitions, 1149 flow [2024-06-27 19:49:17,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1149, PETRI_PLACES=90, PETRI_TRANSITIONS=120} [2024-06-27 19:49:17,622 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2024-06-27 19:49:17,622 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 120 transitions, 1149 flow [2024-06-27 19:49:17,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:17,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:17,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:17,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 19:49:17,622 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:17,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:17,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1396788591, now seen corresponding path program 4 times [2024-06-27 19:49:17,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:17,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078630856] [2024-06-27 19:49:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:17,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:18,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-06-27 19:49:18,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:18,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078630856] [2024-06-27 19:49:18,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078630856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:18,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:18,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:49:18,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114980853] [2024-06-27 19:49:18,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:18,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:49:18,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:18,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:49:18,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:49:18,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:18,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 120 transitions, 1149 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:18,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:18,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:18,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:19,181 INFO L124 PetriNetUnfolderBase]: 1918/2968 cut-off events. [2024-06-27 19:49:19,181 INFO L125 PetriNetUnfolderBase]: For 32177/32179 co-relation queries the response was YES. [2024-06-27 19:49:19,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14244 conditions, 2968 events. 1918/2968 cut-off events. For 32177/32179 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15136 event pairs, 588 based on Foata normal form. 6/2968 useless extension candidates. Maximal degree in co-relation 14207. Up to 2376 conditions per place. [2024-06-27 19:49:19,198 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 68 selfloop transitions, 76 changer transitions 0/149 dead transitions. [2024-06-27 19:49:19,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 149 transitions, 1529 flow [2024-06-27 19:49:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:49:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:49:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-27 19:49:19,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 19:49:19,200 INFO L175 Difference]: Start difference. First operand has 90 places, 120 transitions, 1149 flow. Second operand 8 states and 160 transitions. [2024-06-27 19:49:19,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 149 transitions, 1529 flow [2024-06-27 19:49:19,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 149 transitions, 1306 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-27 19:49:19,225 INFO L231 Difference]: Finished difference. Result has 91 places, 120 transitions, 1089 flow [2024-06-27 19:49:19,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1089, PETRI_PLACES=91, PETRI_TRANSITIONS=120} [2024-06-27 19:49:19,225 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-06-27 19:49:19,225 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 120 transitions, 1089 flow [2024-06-27 19:49:19,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:19,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:19,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:19,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 19:49:19,226 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:19,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:19,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1404417288, now seen corresponding path program 1 times [2024-06-27 19:49:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:19,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804601756] [2024-06-27 19:49:19,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:19,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:20,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:20,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804601756] [2024-06-27 19:49:20,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804601756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:20,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:20,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:49:20,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374102976] [2024-06-27 19:49:20,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:20,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:49:20,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:20,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:49:20,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:49:20,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:49:20,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 120 transitions, 1089 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:20,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:20,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:49:20,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:20,719 INFO L124 PetriNetUnfolderBase]: 1703/2754 cut-off events. [2024-06-27 19:49:20,719 INFO L125 PetriNetUnfolderBase]: For 28975/28977 co-relation queries the response was YES. [2024-06-27 19:49:20,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12909 conditions, 2754 events. 1703/2754 cut-off events. For 28975/28977 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14599 event pairs, 550 based on Foata normal form. 4/2757 useless extension candidates. Maximal degree in co-relation 12871. Up to 2485 conditions per place. [2024-06-27 19:49:20,732 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 127 selfloop transitions, 16 changer transitions 0/149 dead transitions. [2024-06-27 19:49:20,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 149 transitions, 1492 flow [2024-06-27 19:49:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:49:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:49:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-27 19:49:20,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 19:49:20,733 INFO L175 Difference]: Start difference. First operand has 91 places, 120 transitions, 1089 flow. Second operand 8 states and 154 transitions. [2024-06-27 19:49:20,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 149 transitions, 1492 flow [2024-06-27 19:49:20,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 149 transitions, 1284 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 19:49:20,753 INFO L231 Difference]: Finished difference. Result has 92 places, 125 transitions, 975 flow [2024-06-27 19:49:20,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=975, PETRI_PLACES=92, PETRI_TRANSITIONS=125} [2024-06-27 19:49:20,754 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places. [2024-06-27 19:49:20,754 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 125 transitions, 975 flow [2024-06-27 19:49:20,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:20,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:20,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:20,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 19:49:20,754 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:20,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1340775507, now seen corresponding path program 1 times [2024-06-27 19:49:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103078017] [2024-06-27 19:49:20,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:20,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:21,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:21,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103078017] [2024-06-27 19:49:21,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103078017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:21,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:21,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:49:21,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123467255] [2024-06-27 19:49:21,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:21,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:49:21,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:21,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:49:21,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:49:21,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-27 19:49:21,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 125 transitions, 975 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:21,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:21,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-27 19:49:21,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:21,848 INFO L124 PetriNetUnfolderBase]: 1590/2616 cut-off events. [2024-06-27 19:49:21,848 INFO L125 PetriNetUnfolderBase]: For 30522/30541 co-relation queries the response was YES. [2024-06-27 19:49:21,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12378 conditions, 2616 events. 1590/2616 cut-off events. For 30522/30541 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14165 event pairs, 527 based on Foata normal form. 8/2606 useless extension candidates. Maximal degree in co-relation 12338. Up to 2321 conditions per place. [2024-06-27 19:49:21,865 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 113 selfloop transitions, 11 changer transitions 0/137 dead transitions. [2024-06-27 19:49:21,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 137 transitions, 1275 flow [2024-06-27 19:49:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:49:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:49:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-27 19:49:21,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-27 19:49:21,866 INFO L175 Difference]: Start difference. First operand has 92 places, 125 transitions, 975 flow. Second operand 6 states and 116 transitions. [2024-06-27 19:49:21,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 137 transitions, 1275 flow [2024-06-27 19:49:21,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 137 transitions, 1228 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 19:49:21,886 INFO L231 Difference]: Finished difference. Result has 93 places, 128 transitions, 988 flow [2024-06-27 19:49:21,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=988, PETRI_PLACES=93, PETRI_TRANSITIONS=128} [2024-06-27 19:49:21,887 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2024-06-27 19:49:21,887 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 128 transitions, 988 flow [2024-06-27 19:49:21,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:21,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:21,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:21,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 19:49:21,888 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:21,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2130486966, now seen corresponding path program 1 times [2024-06-27 19:49:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:21,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557298818] [2024-06-27 19:49:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:21,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:22,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:22,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557298818] [2024-06-27 19:49:22,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557298818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:22,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:22,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:22,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116858417] [2024-06-27 19:49:22,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:22,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:22,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:22,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:22,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:22,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:22,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 128 transitions, 988 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:22,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:22,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:22,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:23,135 INFO L124 PetriNetUnfolderBase]: 1921/2998 cut-off events. [2024-06-27 19:49:23,135 INFO L125 PetriNetUnfolderBase]: For 39215/39219 co-relation queries the response was YES. [2024-06-27 19:49:23,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14741 conditions, 2998 events. 1921/2998 cut-off events. For 39215/39219 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15445 event pairs, 430 based on Foata normal form. 6/3003 useless extension candidates. Maximal degree in co-relation 14700. Up to 2597 conditions per place. [2024-06-27 19:49:23,152 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 121 selfloop transitions, 32 changer transitions 0/158 dead transitions. [2024-06-27 19:49:23,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 158 transitions, 1484 flow [2024-06-27 19:49:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:49:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:49:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-06-27 19:49:23,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47278911564625853 [2024-06-27 19:49:23,154 INFO L175 Difference]: Start difference. First operand has 93 places, 128 transitions, 988 flow. Second operand 7 states and 139 transitions. [2024-06-27 19:49:23,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 158 transitions, 1484 flow [2024-06-27 19:49:23,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 158 transitions, 1446 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:23,180 INFO L231 Difference]: Finished difference. Result has 96 places, 132 transitions, 1069 flow [2024-06-27 19:49:23,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1069, PETRI_PLACES=96, PETRI_TRANSITIONS=132} [2024-06-27 19:49:23,181 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places. [2024-06-27 19:49:23,181 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 132 transitions, 1069 flow [2024-06-27 19:49:23,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:23,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:23,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:23,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 19:49:23,182 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:23,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash 941571762, now seen corresponding path program 2 times [2024-06-27 19:49:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:23,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021004426] [2024-06-27 19:49:23,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:23,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:23,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:23,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021004426] [2024-06-27 19:49:23,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021004426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:23,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:23,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:23,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240348174] [2024-06-27 19:49:23,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:23,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:23,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:23,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:23,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:23,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 132 transitions, 1069 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:23,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:23,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:23,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:24,588 INFO L124 PetriNetUnfolderBase]: 1913/2981 cut-off events. [2024-06-27 19:49:24,589 INFO L125 PetriNetUnfolderBase]: For 42888/42892 co-relation queries the response was YES. [2024-06-27 19:49:24,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15082 conditions, 2981 events. 1913/2981 cut-off events. For 42888/42892 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15309 event pairs, 568 based on Foata normal form. 6/2986 useless extension candidates. Maximal degree in co-relation 15040. Up to 2673 conditions per place. [2024-06-27 19:49:24,603 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 118 selfloop transitions, 33 changer transitions 0/156 dead transitions. [2024-06-27 19:49:24,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 156 transitions, 1449 flow [2024-06-27 19:49:24,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:49:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:49:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-27 19:49:24,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46598639455782315 [2024-06-27 19:49:24,605 INFO L175 Difference]: Start difference. First operand has 96 places, 132 transitions, 1069 flow. Second operand 7 states and 137 transitions. [2024-06-27 19:49:24,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 156 transitions, 1449 flow [2024-06-27 19:49:24,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 156 transitions, 1389 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-27 19:49:24,632 INFO L231 Difference]: Finished difference. Result has 100 places, 132 transitions, 1084 flow [2024-06-27 19:49:24,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1084, PETRI_PLACES=100, PETRI_TRANSITIONS=132} [2024-06-27 19:49:24,633 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2024-06-27 19:49:24,633 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 132 transitions, 1084 flow [2024-06-27 19:49:24,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:24,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:24,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:24,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 19:49:24,634 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:24,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1016038761, now seen corresponding path program 1 times [2024-06-27 19:49:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:24,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085580961] [2024-06-27 19:49:24,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:25,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:25,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085580961] [2024-06-27 19:49:25,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085580961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:25,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:25,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:49:25,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638632871] [2024-06-27 19:49:25,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:25,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:49:25,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:49:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:49:25,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:49:25,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 132 transitions, 1084 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:25,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:25,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:49:25,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:25,620 INFO L124 PetriNetUnfolderBase]: 1792/2848 cut-off events. [2024-06-27 19:49:25,620 INFO L125 PetriNetUnfolderBase]: For 46679/46699 co-relation queries the response was YES. [2024-06-27 19:49:25,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14730 conditions, 2848 events. 1792/2848 cut-off events. For 46679/46699 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15056 event pairs, 570 based on Foata normal form. 11/2850 useless extension candidates. Maximal degree in co-relation 14686. Up to 2596 conditions per place. [2024-06-27 19:49:25,636 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 124 selfloop transitions, 13 changer transitions 0/151 dead transitions. [2024-06-27 19:49:25,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 151 transitions, 1438 flow [2024-06-27 19:49:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:49:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:49:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-27 19:49:25,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-27 19:49:25,637 INFO L175 Difference]: Start difference. First operand has 100 places, 132 transitions, 1084 flow. Second operand 6 states and 117 transitions. [2024-06-27 19:49:25,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 151 transitions, 1438 flow [2024-06-27 19:49:25,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 151 transitions, 1363 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-27 19:49:25,664 INFO L231 Difference]: Finished difference. Result has 100 places, 135 transitions, 1074 flow [2024-06-27 19:49:25,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1074, PETRI_PLACES=100, PETRI_TRANSITIONS=135} [2024-06-27 19:49:25,665 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2024-06-27 19:49:25,665 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 135 transitions, 1074 flow [2024-06-27 19:49:25,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:25,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:25,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:25,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 19:49:25,666 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:25,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash 831506281, now seen corresponding path program 2 times [2024-06-27 19:49:25,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:25,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682642897] [2024-06-27 19:49:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:25,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:26,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682642897] [2024-06-27 19:49:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682642897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:26,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:26,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:49:26,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351133883] [2024-06-27 19:49:26,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:26,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:49:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:26,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:49:26,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:49:26,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:49:26,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 135 transitions, 1074 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:26,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:26,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:49:26,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:26,673 INFO L124 PetriNetUnfolderBase]: 1789/2853 cut-off events. [2024-06-27 19:49:26,673 INFO L125 PetriNetUnfolderBase]: For 50314/50343 co-relation queries the response was YES. [2024-06-27 19:49:26,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15045 conditions, 2853 events. 1789/2853 cut-off events. For 50314/50343 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15132 event pairs, 563 based on Foata normal form. 16/2861 useless extension candidates. Maximal degree in co-relation 15000. Up to 2586 conditions per place. [2024-06-27 19:49:26,691 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 117 selfloop transitions, 18 changer transitions 0/149 dead transitions. [2024-06-27 19:49:26,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 149 transitions, 1414 flow [2024-06-27 19:49:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:49:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:49:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-27 19:49:26,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2024-06-27 19:49:26,692 INFO L175 Difference]: Start difference. First operand has 100 places, 135 transitions, 1074 flow. Second operand 6 states and 113 transitions. [2024-06-27 19:49:26,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 149 transitions, 1414 flow [2024-06-27 19:49:26,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 149 transitions, 1373 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:26,721 INFO L231 Difference]: Finished difference. Result has 102 places, 138 transitions, 1113 flow [2024-06-27 19:49:26,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1113, PETRI_PLACES=102, PETRI_TRANSITIONS=138} [2024-06-27 19:49:26,722 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2024-06-27 19:49:26,722 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 138 transitions, 1113 flow [2024-06-27 19:49:26,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:26,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:26,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:26,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 19:49:26,723 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:26,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:26,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1385387683, now seen corresponding path program 1 times [2024-06-27 19:49:26,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:26,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458121134] [2024-06-27 19:49:26,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:26,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:27,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-06-27 19:49:27,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:27,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458121134] [2024-06-27 19:49:27,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458121134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:27,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:27,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:49:27,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62983623] [2024-06-27 19:49:27,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:27,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:49:27,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:27,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:49:27,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:49:27,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:49:27,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 138 transitions, 1113 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:27,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:27,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:49:27,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:27,701 INFO L124 PetriNetUnfolderBase]: 1716/2780 cut-off events. [2024-06-27 19:49:27,701 INFO L125 PetriNetUnfolderBase]: For 46132/46134 co-relation queries the response was YES. [2024-06-27 19:49:27,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14647 conditions, 2780 events. 1716/2780 cut-off events. For 46132/46134 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14762 event pairs, 535 based on Foata normal form. 1/2780 useless extension candidates. Maximal degree in co-relation 14601. Up to 2539 conditions per place. [2024-06-27 19:49:27,718 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 136 selfloop transitions, 11 changer transitions 0/153 dead transitions. [2024-06-27 19:49:27,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 153 transitions, 1473 flow [2024-06-27 19:49:27,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:49:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:49:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-27 19:49:27,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 19:49:27,720 INFO L175 Difference]: Start difference. First operand has 102 places, 138 transitions, 1113 flow. Second operand 6 states and 114 transitions. [2024-06-27 19:49:27,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 153 transitions, 1473 flow [2024-06-27 19:49:27,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 153 transitions, 1415 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:27,755 INFO L231 Difference]: Finished difference. Result has 104 places, 141 transitions, 1119 flow [2024-06-27 19:49:27,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1119, PETRI_PLACES=104, PETRI_TRANSITIONS=141} [2024-06-27 19:49:27,756 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2024-06-27 19:49:27,756 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 141 transitions, 1119 flow [2024-06-27 19:49:27,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:27,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:27,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:27,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 19:49:27,757 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:27,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash 831512233, now seen corresponding path program 2 times [2024-06-27 19:49:27,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:27,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601981686] [2024-06-27 19:49:27,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:28,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:28,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601981686] [2024-06-27 19:49:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601981686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:28,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:49:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439804092] [2024-06-27 19:49:28,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:28,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:49:28,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:28,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:49:28,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:49:28,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:49:28,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 141 transitions, 1119 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:28,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:28,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:49:28,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:28,748 INFO L124 PetriNetUnfolderBase]: 1713/2777 cut-off events. [2024-06-27 19:49:28,748 INFO L125 PetriNetUnfolderBase]: For 49102/49106 co-relation queries the response was YES. [2024-06-27 19:49:28,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14967 conditions, 2777 events. 1713/2777 cut-off events. For 49102/49106 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14811 event pairs, 539 based on Foata normal form. 3/2779 useless extension candidates. Maximal degree in co-relation 14920. Up to 2529 conditions per place. [2024-06-27 19:49:28,767 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 131 selfloop transitions, 16 changer transitions 0/153 dead transitions. [2024-06-27 19:49:28,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 153 transitions, 1475 flow [2024-06-27 19:49:28,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:49:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:49:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-27 19:49:28,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2024-06-27 19:49:28,768 INFO L175 Difference]: Start difference. First operand has 104 places, 141 transitions, 1119 flow. Second operand 6 states and 113 transitions. [2024-06-27 19:49:28,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 153 transitions, 1475 flow [2024-06-27 19:49:28,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 153 transitions, 1433 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:28,808 INFO L231 Difference]: Finished difference. Result has 106 places, 144 transitions, 1157 flow [2024-06-27 19:49:28,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1157, PETRI_PLACES=106, PETRI_TRANSITIONS=144} [2024-06-27 19:49:28,816 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2024-06-27 19:49:28,817 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 144 transitions, 1157 flow [2024-06-27 19:49:28,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:28,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:28,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:28,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 19:49:28,817 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:28,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:28,818 INFO L85 PathProgramCache]: Analyzing trace with hash -793014720, now seen corresponding path program 1 times [2024-06-27 19:49:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:28,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610392155] [2024-06-27 19:49:28,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:29,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:29,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610392155] [2024-06-27 19:49:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610392155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:29,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:29,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:49:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562623017] [2024-06-27 19:49:29,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:29,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:49:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:29,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:49:29,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:49:29,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:29,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 144 transitions, 1157 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:29,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:29,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:29,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:30,191 INFO L124 PetriNetUnfolderBase]: 2061/3248 cut-off events. [2024-06-27 19:49:30,191 INFO L125 PetriNetUnfolderBase]: For 72653/72657 co-relation queries the response was YES. [2024-06-27 19:49:30,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18349 conditions, 3248 events. 2061/3248 cut-off events. For 72653/72657 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 17150 event pairs, 444 based on Foata normal form. 16/3263 useless extension candidates. Maximal degree in co-relation 18301. Up to 2037 conditions per place. [2024-06-27 19:49:30,209 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 107 selfloop transitions, 73 changer transitions 0/185 dead transitions. [2024-06-27 19:49:30,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 185 transitions, 1769 flow [2024-06-27 19:49:30,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:49:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:49:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-27 19:49:30,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49702380952380953 [2024-06-27 19:49:30,211 INFO L175 Difference]: Start difference. First operand has 106 places, 144 transitions, 1157 flow. Second operand 8 states and 167 transitions. [2024-06-27 19:49:30,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 185 transitions, 1769 flow [2024-06-27 19:49:30,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 185 transitions, 1711 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:30,243 INFO L231 Difference]: Finished difference. Result has 110 places, 146 transitions, 1289 flow [2024-06-27 19:49:30,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1289, PETRI_PLACES=110, PETRI_TRANSITIONS=146} [2024-06-27 19:49:30,243 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2024-06-27 19:49:30,244 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 146 transitions, 1289 flow [2024-06-27 19:49:30,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:30,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:30,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:30,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 19:49:30,244 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:30,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1493860950, now seen corresponding path program 2 times [2024-06-27 19:49:30,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:30,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676348070] [2024-06-27 19:49:30,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:30,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:30,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:30,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676348070] [2024-06-27 19:49:30,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676348070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:30,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:30,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:49:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341573600] [2024-06-27 19:49:30,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:30,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:49:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:30,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:49:30,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:49:30,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:30,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 146 transitions, 1289 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:30,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:30,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:30,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:31,614 INFO L124 PetriNetUnfolderBase]: 2153/3401 cut-off events. [2024-06-27 19:49:31,614 INFO L125 PetriNetUnfolderBase]: For 81163/81167 co-relation queries the response was YES. [2024-06-27 19:49:31,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19631 conditions, 3401 events. 2153/3401 cut-off events. For 81163/81167 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 18306 event pairs, 596 based on Foata normal form. 24/3424 useless extension candidates. Maximal degree in co-relation 19582. Up to 2599 conditions per place. [2024-06-27 19:49:31,637 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 99 selfloop transitions, 78 changer transitions 0/182 dead transitions. [2024-06-27 19:49:31,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 182 transitions, 1791 flow [2024-06-27 19:49:31,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:49:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:49:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-27 19:49:31,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-06-27 19:49:31,639 INFO L175 Difference]: Start difference. First operand has 110 places, 146 transitions, 1289 flow. Second operand 8 states and 164 transitions. [2024-06-27 19:49:31,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 182 transitions, 1791 flow [2024-06-27 19:49:31,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 182 transitions, 1705 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:31,690 INFO L231 Difference]: Finished difference. Result has 114 places, 148 transitions, 1407 flow [2024-06-27 19:49:31,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1407, PETRI_PLACES=114, PETRI_TRANSITIONS=148} [2024-06-27 19:49:31,690 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places. [2024-06-27 19:49:31,690 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 148 transitions, 1407 flow [2024-06-27 19:49:31,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:31,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:31,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:31,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 19:49:31,691 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:31,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:31,692 INFO L85 PathProgramCache]: Analyzing trace with hash 59688058, now seen corresponding path program 3 times [2024-06-27 19:49:31,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:31,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920096389] [2024-06-27 19:49:31,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:31,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:32,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:32,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920096389] [2024-06-27 19:49:32,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920096389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:32,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:32,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:49:32,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74744075] [2024-06-27 19:49:32,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:32,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:49:32,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:32,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:49:32,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:49:32,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:32,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 148 transitions, 1407 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:32,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:32,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:32,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:33,174 INFO L124 PetriNetUnfolderBase]: 2211/3509 cut-off events. [2024-06-27 19:49:33,174 INFO L125 PetriNetUnfolderBase]: For 86927/86931 co-relation queries the response was YES. [2024-06-27 19:49:33,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20810 conditions, 3509 events. 2211/3509 cut-off events. For 86927/86931 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 19132 event pairs, 608 based on Foata normal form. 16/3524 useless extension candidates. Maximal degree in co-relation 20759. Up to 2579 conditions per place. [2024-06-27 19:49:33,198 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 102 selfloop transitions, 79 changer transitions 0/186 dead transitions. [2024-06-27 19:49:33,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 186 transitions, 1915 flow [2024-06-27 19:49:33,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:49:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:49:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-27 19:49:33,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49702380952380953 [2024-06-27 19:49:33,199 INFO L175 Difference]: Start difference. First operand has 114 places, 148 transitions, 1407 flow. Second operand 8 states and 167 transitions. [2024-06-27 19:49:33,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 186 transitions, 1915 flow [2024-06-27 19:49:33,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 186 transitions, 1747 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 19:49:33,257 INFO L231 Difference]: Finished difference. Result has 116 places, 149 transitions, 1427 flow [2024-06-27 19:49:33,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1427, PETRI_PLACES=116, PETRI_TRANSITIONS=149} [2024-06-27 19:49:33,258 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places. [2024-06-27 19:49:33,258 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 149 transitions, 1427 flow [2024-06-27 19:49:33,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:33,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:33,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:33,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 19:49:33,262 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:33,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:33,263 INFO L85 PathProgramCache]: Analyzing trace with hash 185554675, now seen corresponding path program 1 times [2024-06-27 19:49:33,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:33,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232140238] [2024-06-27 19:49:33,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:33,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:33,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-06-27 19:49:33,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:33,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232140238] [2024-06-27 19:49:33,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232140238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:33,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:33,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:33,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839062423] [2024-06-27 19:49:33,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:33,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:33,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:33,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:33,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:33,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:33,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 149 transitions, 1427 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:33,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:33,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:33,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:34,322 INFO L124 PetriNetUnfolderBase]: 2221/3534 cut-off events. [2024-06-27 19:49:34,322 INFO L125 PetriNetUnfolderBase]: For 88566/88574 co-relation queries the response was YES. [2024-06-27 19:49:34,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21057 conditions, 3534 events. 2221/3534 cut-off events. For 88566/88574 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 19339 event pairs, 644 based on Foata normal form. 10/3543 useless extension candidates. Maximal degree in co-relation 21005. Up to 3199 conditions per place. [2024-06-27 19:49:34,346 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 136 selfloop transitions, 35 changer transitions 0/176 dead transitions. [2024-06-27 19:49:34,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 176 transitions, 1895 flow [2024-06-27 19:49:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:49:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:49:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-27 19:49:34,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46598639455782315 [2024-06-27 19:49:34,348 INFO L175 Difference]: Start difference. First operand has 116 places, 149 transitions, 1427 flow. Second operand 7 states and 137 transitions. [2024-06-27 19:49:34,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 176 transitions, 1895 flow [2024-06-27 19:49:34,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 176 transitions, 1725 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-27 19:49:34,417 INFO L231 Difference]: Finished difference. Result has 117 places, 153 transitions, 1391 flow [2024-06-27 19:49:34,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1257, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1391, PETRI_PLACES=117, PETRI_TRANSITIONS=153} [2024-06-27 19:49:34,418 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places. [2024-06-27 19:49:34,418 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 153 transitions, 1391 flow [2024-06-27 19:49:34,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:34,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:34,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:34,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 19:49:34,419 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:34,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:34,419 INFO L85 PathProgramCache]: Analyzing trace with hash -574561158, now seen corresponding path program 4 times [2024-06-27 19:49:34,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:34,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173539849] [2024-06-27 19:49:34,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:34,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:35,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:35,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173539849] [2024-06-27 19:49:35,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173539849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:35,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:35,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:49:35,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861405016] [2024-06-27 19:49:35,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:35,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:49:35,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:35,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:49:35,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:49:35,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:35,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 153 transitions, 1391 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:35,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:35,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:35,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:35,772 INFO L124 PetriNetUnfolderBase]: 2340/3751 cut-off events. [2024-06-27 19:49:35,772 INFO L125 PetriNetUnfolderBase]: For 102633/102641 co-relation queries the response was YES. [2024-06-27 19:49:35,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22471 conditions, 3751 events. 2340/3751 cut-off events. For 102633/102641 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 20969 event pairs, 486 based on Foata normal form. 22/3772 useless extension candidates. Maximal degree in co-relation 22418. Up to 2672 conditions per place. [2024-06-27 19:49:35,795 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 111 selfloop transitions, 81 changer transitions 0/197 dead transitions. [2024-06-27 19:49:35,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 197 transitions, 2063 flow [2024-06-27 19:49:35,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:49:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:49:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-06-27 19:49:35,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-06-27 19:49:35,797 INFO L175 Difference]: Start difference. First operand has 117 places, 153 transitions, 1391 flow. Second operand 8 states and 172 transitions. [2024-06-27 19:49:35,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 197 transitions, 2063 flow [2024-06-27 19:49:35,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 197 transitions, 1959 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 19:49:35,849 INFO L231 Difference]: Finished difference. Result has 120 places, 155 transitions, 1505 flow [2024-06-27 19:49:35,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1505, PETRI_PLACES=120, PETRI_TRANSITIONS=155} [2024-06-27 19:49:35,849 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 77 predicate places. [2024-06-27 19:49:35,849 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 155 transitions, 1505 flow [2024-06-27 19:49:35,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:35,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:35,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:35,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 19:49:35,850 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:35,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:35,850 INFO L85 PathProgramCache]: Analyzing trace with hash 426608832, now seen corresponding path program 5 times [2024-06-27 19:49:35,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:35,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660809565] [2024-06-27 19:49:35,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:35,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:36,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:36,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660809565] [2024-06-27 19:49:36,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660809565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:36,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:36,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:49:36,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390917737] [2024-06-27 19:49:36,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:36,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:49:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:36,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:49:36,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:49:36,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:36,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 155 transitions, 1505 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:36,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:36,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:36,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:37,624 INFO L124 PetriNetUnfolderBase]: 2415/3867 cut-off events. [2024-06-27 19:49:37,624 INFO L125 PetriNetUnfolderBase]: For 113101/113105 co-relation queries the response was YES. [2024-06-27 19:49:37,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23602 conditions, 3867 events. 2415/3867 cut-off events. For 113101/113105 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21862 event pairs, 662 based on Foata normal form. 20/3886 useless extension candidates. Maximal degree in co-relation 23548. Up to 3072 conditions per place. [2024-06-27 19:49:37,653 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 114 selfloop transitions, 77 changer transitions 0/196 dead transitions. [2024-06-27 19:49:37,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 196 transitions, 2053 flow [2024-06-27 19:49:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:49:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:49:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-06-27 19:49:37,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47883597883597884 [2024-06-27 19:49:37,655 INFO L175 Difference]: Start difference. First operand has 120 places, 155 transitions, 1505 flow. Second operand 9 states and 181 transitions. [2024-06-27 19:49:37,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 196 transitions, 2053 flow [2024-06-27 19:49:37,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 196 transitions, 1946 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:37,734 INFO L231 Difference]: Finished difference. Result has 125 places, 156 transitions, 1589 flow [2024-06-27 19:49:37,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1589, PETRI_PLACES=125, PETRI_TRANSITIONS=156} [2024-06-27 19:49:37,735 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places. [2024-06-27 19:49:37,735 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 156 transitions, 1589 flow [2024-06-27 19:49:37,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:37,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:37,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:37,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 19:49:37,736 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:37,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:37,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1510290616, now seen corresponding path program 6 times [2024-06-27 19:49:37,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:37,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730934922] [2024-06-27 19:49:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:37,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:38,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:38,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730934922] [2024-06-27 19:49:38,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730934922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:38,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:38,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:49:38,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595860867] [2024-06-27 19:49:38,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:38,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:49:38,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:38,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:49:38,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:49:38,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:38,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 156 transitions, 1589 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:38,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:38,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:38,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:39,316 INFO L124 PetriNetUnfolderBase]: 2490/4001 cut-off events. [2024-06-27 19:49:39,316 INFO L125 PetriNetUnfolderBase]: For 121285/121293 co-relation queries the response was YES. [2024-06-27 19:49:39,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24690 conditions, 4001 events. 2490/4001 cut-off events. For 121285/121293 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22900 event pairs, 659 based on Foata normal form. 26/4026 useless extension candidates. Maximal degree in co-relation 24634. Up to 3197 conditions per place. [2024-06-27 19:49:39,341 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 112 selfloop transitions, 78 changer transitions 0/195 dead transitions. [2024-06-27 19:49:39,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 195 transitions, 2131 flow [2024-06-27 19:49:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:49:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:49:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-27 19:49:39,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49702380952380953 [2024-06-27 19:49:39,342 INFO L175 Difference]: Start difference. First operand has 125 places, 156 transitions, 1589 flow. Second operand 8 states and 167 transitions. [2024-06-27 19:49:39,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 195 transitions, 2131 flow [2024-06-27 19:49:39,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 195 transitions, 1968 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-27 19:49:39,418 INFO L231 Difference]: Finished difference. Result has 126 places, 157 transitions, 1621 flow [2024-06-27 19:49:39,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1621, PETRI_PLACES=126, PETRI_TRANSITIONS=157} [2024-06-27 19:49:39,419 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places. [2024-06-27 19:49:39,419 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 157 transitions, 1621 flow [2024-06-27 19:49:39,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:39,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:39,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:39,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 19:49:39,420 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:39,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:39,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1432431603, now seen corresponding path program 2 times [2024-06-27 19:49:39,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:39,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278792302] [2024-06-27 19:49:39,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:39,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278792302] [2024-06-27 19:49:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278792302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:40,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:40,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8485030] [2024-06-27 19:49:40,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:40,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:40,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:40,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:40,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:40,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 157 transitions, 1621 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:40,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:40,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:40,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:40,706 INFO L124 PetriNetUnfolderBase]: 2518/4045 cut-off events. [2024-06-27 19:49:40,707 INFO L125 PetriNetUnfolderBase]: For 122217/122221 co-relation queries the response was YES. [2024-06-27 19:49:40,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25211 conditions, 4045 events. 2518/4045 cut-off events. For 122217/122221 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 23305 event pairs, 742 based on Foata normal form. 4/4048 useless extension candidates. Maximal degree in co-relation 25154. Up to 3651 conditions per place. [2024-06-27 19:49:40,735 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 139 selfloop transitions, 38 changer transitions 0/182 dead transitions. [2024-06-27 19:49:40,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 182 transitions, 2195 flow [2024-06-27 19:49:40,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:49:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:49:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 19:49:40,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 19:49:40,736 INFO L175 Difference]: Start difference. First operand has 126 places, 157 transitions, 1621 flow. Second operand 7 states and 133 transitions. [2024-06-27 19:49:40,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 182 transitions, 2195 flow [2024-06-27 19:49:40,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 182 transitions, 2028 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 19:49:40,823 INFO L231 Difference]: Finished difference. Result has 128 places, 165 transitions, 1673 flow [2024-06-27 19:49:40,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1673, PETRI_PLACES=128, PETRI_TRANSITIONS=165} [2024-06-27 19:49:40,824 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places. [2024-06-27 19:49:40,824 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 165 transitions, 1673 flow [2024-06-27 19:49:40,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:40,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:40,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:40,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 19:49:40,825 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:40,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash -376892538, now seen corresponding path program 1 times [2024-06-27 19:49:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:40,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13531208] [2024-06-27 19:49:40,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:41,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:41,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13531208] [2024-06-27 19:49:41,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13531208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:41,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:41,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:41,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104662943] [2024-06-27 19:49:41,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:41,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:41,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:41,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:41,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:41,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:49:41,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 165 transitions, 1673 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:41,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:41,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:49:41,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:42,202 INFO L124 PetriNetUnfolderBase]: 2399/3879 cut-off events. [2024-06-27 19:49:42,202 INFO L125 PetriNetUnfolderBase]: For 127371/127391 co-relation queries the response was YES. [2024-06-27 19:49:42,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24733 conditions, 3879 events. 2399/3879 cut-off events. For 127371/127391 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 22547 event pairs, 735 based on Foata normal form. 11/3857 useless extension candidates. Maximal degree in co-relation 24674. Up to 3555 conditions per place. [2024-06-27 19:49:42,231 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 150 selfloop transitions, 16 changer transitions 0/185 dead transitions. [2024-06-27 19:49:42,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 185 transitions, 2101 flow [2024-06-27 19:49:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:49:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:49:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 19:49:42,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-27 19:49:42,232 INFO L175 Difference]: Start difference. First operand has 128 places, 165 transitions, 1673 flow. Second operand 7 states and 132 transitions. [2024-06-27 19:49:42,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 185 transitions, 2101 flow [2024-06-27 19:49:42,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 185 transitions, 2015 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-27 19:49:42,362 INFO L231 Difference]: Finished difference. Result has 132 places, 168 transitions, 1671 flow [2024-06-27 19:49:42,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1671, PETRI_PLACES=132, PETRI_TRANSITIONS=168} [2024-06-27 19:49:42,362 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 89 predicate places. [2024-06-27 19:49:42,362 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 168 transitions, 1671 flow [2024-06-27 19:49:42,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:42,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:42,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:42,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 19:49:42,363 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:42,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2010890066, now seen corresponding path program 7 times [2024-06-27 19:49:42,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:42,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79960331] [2024-06-27 19:49:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:43,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:43,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79960331] [2024-06-27 19:49:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79960331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:49:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11546036] [2024-06-27 19:49:43,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:43,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:49:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:43,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:49:43,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:49:43,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:43,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 168 transitions, 1671 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:43,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:43,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:43,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:44,250 INFO L124 PetriNetUnfolderBase]: 2598/4148 cut-off events. [2024-06-27 19:49:44,250 INFO L125 PetriNetUnfolderBase]: For 143334/143336 co-relation queries the response was YES. [2024-06-27 19:49:44,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26688 conditions, 4148 events. 2598/4148 cut-off events. For 143334/143336 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 23803 event pairs, 681 based on Foata normal form. 20/4162 useless extension candidates. Maximal degree in co-relation 26627. Up to 3374 conditions per place. [2024-06-27 19:49:44,285 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 123 selfloop transitions, 79 changer transitions 0/207 dead transitions. [2024-06-27 19:49:44,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 207 transitions, 2243 flow [2024-06-27 19:49:44,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:49:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:49:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-27 19:49:44,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 19:49:44,287 INFO L175 Difference]: Start difference. First operand has 132 places, 168 transitions, 1671 flow. Second operand 9 states and 180 transitions. [2024-06-27 19:49:44,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 207 transitions, 2243 flow [2024-06-27 19:49:44,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 207 transitions, 2181 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 19:49:44,397 INFO L231 Difference]: Finished difference. Result has 136 places, 169 transitions, 1808 flow [2024-06-27 19:49:44,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1808, PETRI_PLACES=136, PETRI_TRANSITIONS=169} [2024-06-27 19:49:44,397 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places. [2024-06-27 19:49:44,397 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 169 transitions, 1808 flow [2024-06-27 19:49:44,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:44,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:44,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:44,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 19:49:44,398 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:44,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:44,398 INFO L85 PathProgramCache]: Analyzing trace with hash -470908928, now seen corresponding path program 8 times [2024-06-27 19:49:44,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:44,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420280310] [2024-06-27 19:49:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:44,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:45,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:45,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420280310] [2024-06-27 19:49:45,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420280310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:45,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:45,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:49:45,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417755701] [2024-06-27 19:49:45,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:45,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:49:45,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:45,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:49:45,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:49:45,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:45,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 169 transitions, 1808 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:45,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:45,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:45,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:46,148 INFO L124 PetriNetUnfolderBase]: 2562/4109 cut-off events. [2024-06-27 19:49:46,148 INFO L125 PetriNetUnfolderBase]: For 143441/143443 co-relation queries the response was YES. [2024-06-27 19:49:46,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26491 conditions, 4109 events. 2562/4109 cut-off events. For 143441/143443 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 23611 event pairs, 637 based on Foata normal form. 20/4123 useless extension candidates. Maximal degree in co-relation 26429. Up to 3318 conditions per place. [2024-06-27 19:49:46,180 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 127 selfloop transitions, 81 changer transitions 0/213 dead transitions. [2024-06-27 19:49:46,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 213 transitions, 2384 flow [2024-06-27 19:49:46,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:49:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:49:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-27 19:49:46,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46904761904761905 [2024-06-27 19:49:46,182 INFO L175 Difference]: Start difference. First operand has 136 places, 169 transitions, 1808 flow. Second operand 10 states and 197 transitions. [2024-06-27 19:49:46,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 213 transitions, 2384 flow [2024-06-27 19:49:46,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 213 transitions, 2203 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-27 19:49:46,314 INFO L231 Difference]: Finished difference. Result has 139 places, 169 transitions, 1798 flow [2024-06-27 19:49:46,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1627, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1798, PETRI_PLACES=139, PETRI_TRANSITIONS=169} [2024-06-27 19:49:46,315 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 96 predicate places. [2024-06-27 19:49:46,315 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 169 transitions, 1798 flow [2024-06-27 19:49:46,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:46,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:46,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:46,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 19:49:46,316 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:46,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:46,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2010674585, now seen corresponding path program 1 times [2024-06-27 19:49:46,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:46,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850569662] [2024-06-27 19:49:46,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:46,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:47,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:47,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850569662] [2024-06-27 19:49:47,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850569662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:47,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:47,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:49:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287950088] [2024-06-27 19:49:47,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:47,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:49:47,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:47,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:49:47,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:49:47,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:47,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 169 transitions, 1798 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:47,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:47,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:47,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:48,153 INFO L124 PetriNetUnfolderBase]: 2579/4111 cut-off events. [2024-06-27 19:49:48,153 INFO L125 PetriNetUnfolderBase]: For 141443/141445 co-relation queries the response was YES. [2024-06-27 19:49:48,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26654 conditions, 4111 events. 2579/4111 cut-off events. For 141443/141445 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23529 event pairs, 669 based on Foata normal form. 4/4109 useless extension candidates. Maximal degree in co-relation 26591. Up to 3453 conditions per place. [2024-06-27 19:49:48,186 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 118 selfloop transitions, 84 changer transitions 0/207 dead transitions. [2024-06-27 19:49:48,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 207 transitions, 2390 flow [2024-06-27 19:49:48,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:49:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:49:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 19:49:48,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 19:49:48,188 INFO L175 Difference]: Start difference. First operand has 139 places, 169 transitions, 1798 flow. Second operand 9 states and 175 transitions. [2024-06-27 19:49:48,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 207 transitions, 2390 flow [2024-06-27 19:49:48,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 207 transitions, 2192 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-27 19:49:48,327 INFO L231 Difference]: Finished difference. Result has 140 places, 175 transitions, 1867 flow [2024-06-27 19:49:48,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1867, PETRI_PLACES=140, PETRI_TRANSITIONS=175} [2024-06-27 19:49:48,328 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places. [2024-06-27 19:49:48,328 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 175 transitions, 1867 flow [2024-06-27 19:49:48,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:48,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:48,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:48,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 19:49:48,329 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:48,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:48,329 INFO L85 PathProgramCache]: Analyzing trace with hash 759293769, now seen corresponding path program 2 times [2024-06-27 19:49:48,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:48,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456869732] [2024-06-27 19:49:48,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:48,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:49,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:49,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456869732] [2024-06-27 19:49:49,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456869732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:49,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:49,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:49:49,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034980599] [2024-06-27 19:49:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:49,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:49:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:49,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:49:49,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:49:49,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:49,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 175 transitions, 1867 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:49,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:49,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:49,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:50,110 INFO L124 PetriNetUnfolderBase]: 2614/4166 cut-off events. [2024-06-27 19:49:50,110 INFO L125 PetriNetUnfolderBase]: For 149657/149659 co-relation queries the response was YES. [2024-06-27 19:49:50,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27434 conditions, 4166 events. 2614/4166 cut-off events. For 149657/149659 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 23913 event pairs, 654 based on Foata normal form. 4/4164 useless extension candidates. Maximal degree in co-relation 27369. Up to 3492 conditions per place. [2024-06-27 19:49:50,143 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 119 selfloop transitions, 91 changer transitions 0/215 dead transitions. [2024-06-27 19:49:50,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 215 transitions, 2509 flow [2024-06-27 19:49:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:49:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:49:50,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 19:49:50,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 19:49:50,145 INFO L175 Difference]: Start difference. First operand has 140 places, 175 transitions, 1867 flow. Second operand 9 states and 175 transitions. [2024-06-27 19:49:50,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 215 transitions, 2509 flow [2024-06-27 19:49:50,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 215 transitions, 2297 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 19:49:50,268 INFO L231 Difference]: Finished difference. Result has 144 places, 183 transitions, 1969 flow [2024-06-27 19:49:50,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1665, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1969, PETRI_PLACES=144, PETRI_TRANSITIONS=183} [2024-06-27 19:49:50,269 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places. [2024-06-27 19:49:50,269 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 183 transitions, 1969 flow [2024-06-27 19:49:50,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:50,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:50,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:50,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 19:49:50,270 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:50,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:50,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1338338141, now seen corresponding path program 3 times [2024-06-27 19:49:50,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:50,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426061977] [2024-06-27 19:49:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:51,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426061977] [2024-06-27 19:49:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426061977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:51,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:51,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:49:51,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106616734] [2024-06-27 19:49:51,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:51,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:49:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:49:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:49:51,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:51,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 183 transitions, 1969 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:51,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:51,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:51,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:52,050 INFO L124 PetriNetUnfolderBase]: 2606/4158 cut-off events. [2024-06-27 19:49:52,050 INFO L125 PetriNetUnfolderBase]: For 155907/155909 co-relation queries the response was YES. [2024-06-27 19:49:52,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27780 conditions, 4158 events. 2606/4158 cut-off events. For 155907/155909 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 23862 event pairs, 655 based on Foata normal form. 4/4156 useless extension candidates. Maximal degree in co-relation 27713. Up to 3480 conditions per place. [2024-06-27 19:49:52,085 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 120 selfloop transitions, 104 changer transitions 0/229 dead transitions. [2024-06-27 19:49:52,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 229 transitions, 2724 flow [2024-06-27 19:49:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:49:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:49:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 19:49:52,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 19:49:52,087 INFO L175 Difference]: Start difference. First operand has 144 places, 183 transitions, 1969 flow. Second operand 9 states and 175 transitions. [2024-06-27 19:49:52,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 229 transitions, 2724 flow [2024-06-27 19:49:52,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 229 transitions, 2480 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-27 19:49:52,321 INFO L231 Difference]: Finished difference. Result has 148 places, 197 transitions, 2165 flow [2024-06-27 19:49:52,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2165, PETRI_PLACES=148, PETRI_TRANSITIONS=197} [2024-06-27 19:49:52,321 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places. [2024-06-27 19:49:52,321 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 197 transitions, 2165 flow [2024-06-27 19:49:52,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:52,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:52,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:52,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 19:49:52,322 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:52,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:52,323 INFO L85 PathProgramCache]: Analyzing trace with hash -58271005, now seen corresponding path program 4 times [2024-06-27 19:49:52,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:52,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802085838] [2024-06-27 19:49:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:53,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:53,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802085838] [2024-06-27 19:49:53,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802085838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:53,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:53,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:49:53,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848461525] [2024-06-27 19:49:53,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:53,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:49:53,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:53,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:49:53,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:49:53,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:53,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 197 transitions, 2165 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:53,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:53,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:53,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:54,099 INFO L124 PetriNetUnfolderBase]: 2639/4223 cut-off events. [2024-06-27 19:49:54,099 INFO L125 PetriNetUnfolderBase]: For 161928/161930 co-relation queries the response was YES. [2024-06-27 19:49:54,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28377 conditions, 4223 events. 2639/4223 cut-off events. For 161928/161930 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 24445 event pairs, 560 based on Foata normal form. 4/4221 useless extension candidates. Maximal degree in co-relation 28308. Up to 3322 conditions per place. [2024-06-27 19:49:54,133 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 118 selfloop transitions, 113 changer transitions 0/236 dead transitions. [2024-06-27 19:49:54,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 236 transitions, 2815 flow [2024-06-27 19:49:54,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:49:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:49:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-27 19:49:54,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47354497354497355 [2024-06-27 19:49:54,134 INFO L175 Difference]: Start difference. First operand has 148 places, 197 transitions, 2165 flow. Second operand 9 states and 179 transitions. [2024-06-27 19:49:54,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 236 transitions, 2815 flow [2024-06-27 19:49:54,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 236 transitions, 2614 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:54,271 INFO L231 Difference]: Finished difference. Result has 154 places, 200 transitions, 2286 flow [2024-06-27 19:49:54,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2286, PETRI_PLACES=154, PETRI_TRANSITIONS=200} [2024-06-27 19:49:54,271 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places. [2024-06-27 19:49:54,271 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 200 transitions, 2286 flow [2024-06-27 19:49:54,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:54,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:54,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:54,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 19:49:54,272 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:54,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:54,272 INFO L85 PathProgramCache]: Analyzing trace with hash 4959308, now seen corresponding path program 2 times [2024-06-27 19:49:54,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:54,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665286517] [2024-06-27 19:49:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:54,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:55,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:55,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665286517] [2024-06-27 19:49:55,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665286517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:55,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:55,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:55,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963998141] [2024-06-27 19:49:55,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:55,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:55,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:55,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:55,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:55,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:49:55,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 200 transitions, 2286 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:55,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:55,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:49:55,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:55,703 INFO L124 PetriNetUnfolderBase]: 2520/4114 cut-off events. [2024-06-27 19:49:55,703 INFO L125 PetriNetUnfolderBase]: For 167889/167926 co-relation queries the response was YES. [2024-06-27 19:49:55,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27643 conditions, 4114 events. 2520/4114 cut-off events. For 167889/167926 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 24438 event pairs, 641 based on Foata normal form. 24/4106 useless extension candidates. Maximal degree in co-relation 27572. Up to 3742 conditions per place. [2024-06-27 19:49:55,737 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 174 selfloop transitions, 28 changer transitions 0/221 dead transitions. [2024-06-27 19:49:55,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 221 transitions, 2926 flow [2024-06-27 19:49:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:49:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:49:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-27 19:49:55,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-27 19:49:55,738 INFO L175 Difference]: Start difference. First operand has 154 places, 200 transitions, 2286 flow. Second operand 7 states and 130 transitions. [2024-06-27 19:49:55,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 221 transitions, 2926 flow [2024-06-27 19:49:55,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 221 transitions, 2686 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 19:49:55,888 INFO L231 Difference]: Finished difference. Result has 156 places, 208 transitions, 2245 flow [2024-06-27 19:49:55,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2046, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2245, PETRI_PLACES=156, PETRI_TRANSITIONS=208} [2024-06-27 19:49:55,889 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places. [2024-06-27 19:49:55,889 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 208 transitions, 2245 flow [2024-06-27 19:49:55,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:55,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:55,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:55,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 19:49:55,890 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:55,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash 4513435, now seen corresponding path program 3 times [2024-06-27 19:49:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:55,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643187530] [2024-06-27 19:49:55,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:56,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:56,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643187530] [2024-06-27 19:49:56,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643187530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:56,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:56,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:56,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478828815] [2024-06-27 19:49:56,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:56,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:56,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:56,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:56,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:56,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:49:56,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 208 transitions, 2245 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:56,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:56,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:49:56,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:57,155 INFO L124 PetriNetUnfolderBase]: 2648/4284 cut-off events. [2024-06-27 19:49:57,155 INFO L125 PetriNetUnfolderBase]: For 175543/175547 co-relation queries the response was YES. [2024-06-27 19:49:57,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28405 conditions, 4284 events. 2648/4284 cut-off events. For 175543/175547 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25063 event pairs, 685 based on Foata normal form. 4/4282 useless extension candidates. Maximal degree in co-relation 28332. Up to 3836 conditions per place. [2024-06-27 19:49:57,193 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 173 selfloop transitions, 51 changer transitions 0/229 dead transitions. [2024-06-27 19:49:57,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 229 transitions, 3029 flow [2024-06-27 19:49:57,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:49:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:49:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-27 19:49:57,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-27 19:49:57,195 INFO L175 Difference]: Start difference. First operand has 156 places, 208 transitions, 2245 flow. Second operand 7 states and 131 transitions. [2024-06-27 19:49:57,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 229 transitions, 3029 flow [2024-06-27 19:49:57,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 229 transitions, 2956 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-27 19:49:57,366 INFO L231 Difference]: Finished difference. Result has 161 places, 216 transitions, 2440 flow [2024-06-27 19:49:57,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2172, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2440, PETRI_PLACES=161, PETRI_TRANSITIONS=216} [2024-06-27 19:49:57,368 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 118 predicate places. [2024-06-27 19:49:57,369 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 216 transitions, 2440 flow [2024-06-27 19:49:57,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:57,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:57,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:57,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 19:49:57,371 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:57,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:57,371 INFO L85 PathProgramCache]: Analyzing trace with hash 6892422, now seen corresponding path program 3 times [2024-06-27 19:49:57,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:57,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033912134] [2024-06-27 19:49:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:57,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:58,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-06-27 19:49:58,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:58,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033912134] [2024-06-27 19:49:58,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033912134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:58,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:58,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:58,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085169541] [2024-06-27 19:49:58,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:58,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:58,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:58,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:58,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:58,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:49:58,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 216 transitions, 2440 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:58,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:58,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:49:58,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:49:58,876 INFO L124 PetriNetUnfolderBase]: 2523/4129 cut-off events. [2024-06-27 19:49:58,877 INFO L125 PetriNetUnfolderBase]: For 184837/184874 co-relation queries the response was YES. [2024-06-27 19:49:58,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28288 conditions, 4129 events. 2523/4129 cut-off events. For 184837/184874 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 24629 event pairs, 650 based on Foata normal form. 24/4121 useless extension candidates. Maximal degree in co-relation 28212. Up to 3751 conditions per place. [2024-06-27 19:49:58,914 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 187 selfloop transitions, 21 changer transitions 0/229 dead transitions. [2024-06-27 19:49:58,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 229 transitions, 2903 flow [2024-06-27 19:49:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:49:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:49:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-27 19:49:58,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2024-06-27 19:49:58,916 INFO L175 Difference]: Start difference. First operand has 161 places, 216 transitions, 2440 flow. Second operand 7 states and 128 transitions. [2024-06-27 19:49:58,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 229 transitions, 2903 flow [2024-06-27 19:49:59,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 229 transitions, 2707 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-27 19:49:59,083 INFO L231 Difference]: Finished difference. Result has 164 places, 217 transitions, 2301 flow [2024-06-27 19:49:59,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2244, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2301, PETRI_PLACES=164, PETRI_TRANSITIONS=217} [2024-06-27 19:49:59,084 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places. [2024-06-27 19:49:59,084 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 217 transitions, 2301 flow [2024-06-27 19:49:59,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:59,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:49:59,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:49:59,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 19:49:59,085 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:49:59,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:49:59,085 INFO L85 PathProgramCache]: Analyzing trace with hash -529794745, now seen corresponding path program 1 times [2024-06-27 19:49:59,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:49:59,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566489792] [2024-06-27 19:49:59,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:49:59,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:49:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:49:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:49:59,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:49:59,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566489792] [2024-06-27 19:49:59,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566489792] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:49:59,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:49:59,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:49:59,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750891098] [2024-06-27 19:49:59,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:49:59,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:49:59,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:49:59,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:49:59,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:49:59,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:49:59,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 217 transitions, 2301 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:49:59,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:49:59,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:49:59,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:00,465 INFO L124 PetriNetUnfolderBase]: 2551/4196 cut-off events. [2024-06-27 19:50:00,465 INFO L125 PetriNetUnfolderBase]: For 192320/192322 co-relation queries the response was YES. [2024-06-27 19:50:00,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28360 conditions, 4196 events. 2551/4196 cut-off events. For 192320/192322 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24994 event pairs, 682 based on Foata normal form. 2/4197 useless extension candidates. Maximal degree in co-relation 28283. Up to 3840 conditions per place. [2024-06-27 19:50:00,498 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 213 selfloop transitions, 14 changer transitions 0/237 dead transitions. [2024-06-27 19:50:00,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 237 transitions, 2849 flow [2024-06-27 19:50:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:50:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:50:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 19:50:00,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 19:50:00,501 INFO L175 Difference]: Start difference. First operand has 164 places, 217 transitions, 2301 flow. Second operand 7 states and 133 transitions. [2024-06-27 19:50:00,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 237 transitions, 2849 flow [2024-06-27 19:50:00,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 237 transitions, 2803 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 19:50:00,672 INFO L231 Difference]: Finished difference. Result has 166 places, 220 transitions, 2335 flow [2024-06-27 19:50:00,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2335, PETRI_PLACES=166, PETRI_TRANSITIONS=220} [2024-06-27 19:50:00,672 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 123 predicate places. [2024-06-27 19:50:00,673 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 220 transitions, 2335 flow [2024-06-27 19:50:00,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:00,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:00,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:00,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 19:50:00,673 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:00,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:00,674 INFO L85 PathProgramCache]: Analyzing trace with hash -529645015, now seen corresponding path program 2 times [2024-06-27 19:50:00,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:00,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145153970] [2024-06-27 19:50:00,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:00,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:01,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-06-27 19:50:01,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:01,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145153970] [2024-06-27 19:50:01,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145153970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:01,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:01,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:50:01,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538425298] [2024-06-27 19:50:01,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:01,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:50:01,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:50:01,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:50:01,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:50:01,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 220 transitions, 2335 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:01,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:01,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:50:01,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:02,028 INFO L124 PetriNetUnfolderBase]: 2561/4212 cut-off events. [2024-06-27 19:50:02,028 INFO L125 PetriNetUnfolderBase]: For 200749/200751 co-relation queries the response was YES. [2024-06-27 19:50:02,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28978 conditions, 4212 events. 2561/4212 cut-off events. For 200749/200751 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25131 event pairs, 682 based on Foata normal form. 2/4213 useless extension candidates. Maximal degree in co-relation 28900. Up to 3845 conditions per place. [2024-06-27 19:50:02,073 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 209 selfloop transitions, 19 changer transitions 0/238 dead transitions. [2024-06-27 19:50:02,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 238 transitions, 2887 flow [2024-06-27 19:50:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:50:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:50:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 19:50:02,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 19:50:02,075 INFO L175 Difference]: Start difference. First operand has 166 places, 220 transitions, 2335 flow. Second operand 7 states and 133 transitions. [2024-06-27 19:50:02,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 238 transitions, 2887 flow [2024-06-27 19:50:02,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 238 transitions, 2829 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 19:50:02,297 INFO L231 Difference]: Finished difference. Result has 168 places, 223 transitions, 2373 flow [2024-06-27 19:50:02,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2277, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2373, PETRI_PLACES=168, PETRI_TRANSITIONS=223} [2024-06-27 19:50:02,298 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places. [2024-06-27 19:50:02,298 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 223 transitions, 2373 flow [2024-06-27 19:50:02,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:02,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:02,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:02,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 19:50:02,298 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:02,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash -199576506, now seen corresponding path program 1 times [2024-06-27 19:50:02,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:02,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676981451] [2024-06-27 19:50:02,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:02,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:03,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:03,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676981451] [2024-06-27 19:50:03,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676981451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:03,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:03,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:50:03,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108557766] [2024-06-27 19:50:03,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:03,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:50:03,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:03,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:50:03,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:50:03,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:50:03,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 223 transitions, 2373 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:03,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:03,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:50:03,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:03,728 INFO L124 PetriNetUnfolderBase]: 2566/4221 cut-off events. [2024-06-27 19:50:03,728 INFO L125 PetriNetUnfolderBase]: For 209587/209589 co-relation queries the response was YES. [2024-06-27 19:50:03,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29509 conditions, 4221 events. 2566/4221 cut-off events. For 209587/209589 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25189 event pairs, 681 based on Foata normal form. 2/4222 useless extension candidates. Maximal degree in co-relation 29430. Up to 3870 conditions per place. [2024-06-27 19:50:03,766 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 215 selfloop transitions, 14 changer transitions 0/239 dead transitions. [2024-06-27 19:50:03,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 239 transitions, 2911 flow [2024-06-27 19:50:03,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:50:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:50:03,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 19:50:03,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2024-06-27 19:50:03,768 INFO L175 Difference]: Start difference. First operand has 168 places, 223 transitions, 2373 flow. Second operand 7 states and 129 transitions. [2024-06-27 19:50:03,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 239 transitions, 2911 flow [2024-06-27 19:50:03,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 239 transitions, 2837 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 19:50:03,993 INFO L231 Difference]: Finished difference. Result has 170 places, 226 transitions, 2381 flow [2024-06-27 19:50:03,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2299, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2381, PETRI_PLACES=170, PETRI_TRANSITIONS=226} [2024-06-27 19:50:03,994 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places. [2024-06-27 19:50:03,994 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 226 transitions, 2381 flow [2024-06-27 19:50:03,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:03,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:03,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:03,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 19:50:03,995 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:03,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash 7076717, now seen corresponding path program 3 times [2024-06-27 19:50:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:03,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480493816] [2024-06-27 19:50:03,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:04,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-06-27 19:50:04,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:04,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480493816] [2024-06-27 19:50:04,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480493816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:04,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:04,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:50:04,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190178019] [2024-06-27 19:50:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:04,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:50:04,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:04,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:50:04,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:50:04,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:50:04,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 226 transitions, 2381 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:04,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:04,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:50:04,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:05,242 INFO L124 PetriNetUnfolderBase]: 2568/4227 cut-off events. [2024-06-27 19:50:05,242 INFO L125 PetriNetUnfolderBase]: For 216417/216421 co-relation queries the response was YES. [2024-06-27 19:50:05,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29844 conditions, 4227 events. 2568/4227 cut-off events. For 216417/216421 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25272 event pairs, 689 based on Foata normal form. 2/4228 useless extension candidates. Maximal degree in co-relation 29764. Up to 3843 conditions per place. [2024-06-27 19:50:05,282 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 205 selfloop transitions, 26 changer transitions 0/241 dead transitions. [2024-06-27 19:50:05,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 241 transitions, 2937 flow [2024-06-27 19:50:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:50:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:50:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 19:50:05,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-27 19:50:05,283 INFO L175 Difference]: Start difference. First operand has 170 places, 226 transitions, 2381 flow. Second operand 7 states and 132 transitions. [2024-06-27 19:50:05,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 241 transitions, 2937 flow [2024-06-27 19:50:05,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 241 transitions, 2877 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-27 19:50:05,477 INFO L231 Difference]: Finished difference. Result has 172 places, 229 transitions, 2439 flow [2024-06-27 19:50:05,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2439, PETRI_PLACES=172, PETRI_TRANSITIONS=229} [2024-06-27 19:50:05,477 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places. [2024-06-27 19:50:05,478 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 229 transitions, 2439 flow [2024-06-27 19:50:05,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:05,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:05,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:05,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 19:50:05,478 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:05,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:05,479 INFO L85 PathProgramCache]: Analyzing trace with hash 7076934, now seen corresponding path program 2 times [2024-06-27 19:50:05,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:05,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088077612] [2024-06-27 19:50:05,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:05,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088077612] [2024-06-27 19:50:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088077612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:06,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:06,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:50:06,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854154793] [2024-06-27 19:50:06,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:06,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:50:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:06,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:50:06,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:50:06,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:50:06,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 229 transitions, 2439 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:06,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:06,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:50:06,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:06,834 INFO L124 PetriNetUnfolderBase]: 2578/4243 cut-off events. [2024-06-27 19:50:06,834 INFO L125 PetriNetUnfolderBase]: For 226894/226898 co-relation queries the response was YES. [2024-06-27 19:50:06,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30483 conditions, 4243 events. 2578/4243 cut-off events. For 226894/226898 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 25336 event pairs, 685 based on Foata normal form. 5/4247 useless extension candidates. Maximal degree in co-relation 30402. Up to 3878 conditions per place. [2024-06-27 19:50:06,875 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 214 selfloop transitions, 19 changer transitions 0/243 dead transitions. [2024-06-27 19:50:06,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 243 transitions, 2985 flow [2024-06-27 19:50:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:50:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:50:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 19:50:06,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2024-06-27 19:50:06,876 INFO L175 Difference]: Start difference. First operand has 172 places, 229 transitions, 2439 flow. Second operand 7 states and 129 transitions. [2024-06-27 19:50:06,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 243 transitions, 2985 flow [2024-06-27 19:50:07,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 243 transitions, 2889 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-27 19:50:07,057 INFO L231 Difference]: Finished difference. Result has 174 places, 232 transitions, 2439 flow [2024-06-27 19:50:07,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2343, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2439, PETRI_PLACES=174, PETRI_TRANSITIONS=232} [2024-06-27 19:50:07,058 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 131 predicate places. [2024-06-27 19:50:07,058 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 232 transitions, 2439 flow [2024-06-27 19:50:07,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:07,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:07,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:07,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 19:50:07,058 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:07,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash 7343844, now seen corresponding path program 3 times [2024-06-27 19:50:07,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:07,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343947068] [2024-06-27 19:50:07,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:07,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:07,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:07,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343947068] [2024-06-27 19:50:07,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343947068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:07,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:07,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:50:07,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578961905] [2024-06-27 19:50:07,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:07,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:50:07,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:07,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:50:07,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:50:07,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:50:07,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 232 transitions, 2439 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:07,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:07,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:50:07,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:08,598 INFO L124 PetriNetUnfolderBase]: 2579/4245 cut-off events. [2024-06-27 19:50:08,598 INFO L125 PetriNetUnfolderBase]: For 234208/234212 co-relation queries the response was YES. [2024-06-27 19:50:08,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30745 conditions, 4245 events. 2579/4245 cut-off events. For 234208/234212 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25439 event pairs, 680 based on Foata normal form. 5/4249 useless extension candidates. Maximal degree in co-relation 30663. Up to 3856 conditions per place. [2024-06-27 19:50:08,641 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 211 selfloop transitions, 31 changer transitions 0/252 dead transitions. [2024-06-27 19:50:08,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 252 transitions, 3191 flow [2024-06-27 19:50:08,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:50:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:50:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 19:50:08,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-27 19:50:08,643 INFO L175 Difference]: Start difference. First operand has 174 places, 232 transitions, 2439 flow. Second operand 7 states and 132 transitions. [2024-06-27 19:50:08,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 252 transitions, 3191 flow [2024-06-27 19:50:08,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 252 transitions, 3123 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 19:50:08,931 INFO L231 Difference]: Finished difference. Result has 177 places, 239 transitions, 2597 flow [2024-06-27 19:50:08,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2371, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2597, PETRI_PLACES=177, PETRI_TRANSITIONS=239} [2024-06-27 19:50:08,932 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2024-06-27 19:50:08,932 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 239 transitions, 2597 flow [2024-06-27 19:50:08,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:08,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:08,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:08,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 19:50:08,932 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:08,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:08,933 INFO L85 PathProgramCache]: Analyzing trace with hash 4975180, now seen corresponding path program 1 times [2024-06-27 19:50:08,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:08,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323115132] [2024-06-27 19:50:08,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:08,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:10,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:10,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323115132] [2024-06-27 19:50:10,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323115132] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:10,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:10,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:50:10,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29048331] [2024-06-27 19:50:10,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:10,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:50:10,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:10,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:50:10,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:50:10,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:50:10,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 239 transitions, 2597 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:10,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:10,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:50:10,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:10,771 INFO L124 PetriNetUnfolderBase]: 2580/4192 cut-off events. [2024-06-27 19:50:10,771 INFO L125 PetriNetUnfolderBase]: For 243213/243242 co-relation queries the response was YES. [2024-06-27 19:50:10,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30954 conditions, 4192 events. 2580/4192 cut-off events. For 243213/243242 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24960 event pairs, 675 based on Foata normal form. 18/4168 useless extension candidates. Maximal degree in co-relation 30870. Up to 3822 conditions per place. [2024-06-27 19:50:10,811 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 210 selfloop transitions, 17 changer transitions 0/252 dead transitions. [2024-06-27 19:50:10,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 252 transitions, 3119 flow [2024-06-27 19:50:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:50:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:50:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 19:50:10,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2024-06-27 19:50:10,812 INFO L175 Difference]: Start difference. First operand has 177 places, 239 transitions, 2597 flow. Second operand 8 states and 141 transitions. [2024-06-27 19:50:10,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 252 transitions, 3119 flow [2024-06-27 19:50:11,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 252 transitions, 3043 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-27 19:50:11,102 INFO L231 Difference]: Finished difference. Result has 181 places, 241 transitions, 2603 flow [2024-06-27 19:50:11,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2523, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2603, PETRI_PLACES=181, PETRI_TRANSITIONS=241} [2024-06-27 19:50:11,103 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 138 predicate places. [2024-06-27 19:50:11,103 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 241 transitions, 2603 flow [2024-06-27 19:50:11,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:11,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:11,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:11,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 19:50:11,104 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:11,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1445531230, now seen corresponding path program 1 times [2024-06-27 19:50:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:11,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109243713] [2024-06-27 19:50:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:11,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:11,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109243713] [2024-06-27 19:50:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109243713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:11,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:11,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:50:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941554817] [2024-06-27 19:50:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:11,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:50:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:50:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:50:12,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:12,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 241 transitions, 2603 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:12,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:12,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:12,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:12,848 INFO L124 PetriNetUnfolderBase]: 2698/4368 cut-off events. [2024-06-27 19:50:12,848 INFO L125 PetriNetUnfolderBase]: For 249011/249019 co-relation queries the response was YES. [2024-06-27 19:50:12,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31940 conditions, 4368 events. 2698/4368 cut-off events. For 249011/249019 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25734 event pairs, 650 based on Foata normal form. 10/4377 useless extension candidates. Maximal degree in co-relation 31855. Up to 3970 conditions per place. [2024-06-27 19:50:12,892 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 225 selfloop transitions, 39 changer transitions 0/269 dead transitions. [2024-06-27 19:50:12,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 269 transitions, 3279 flow [2024-06-27 19:50:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:50:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:50:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 19:50:12,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 19:50:12,893 INFO L175 Difference]: Start difference. First operand has 181 places, 241 transitions, 2603 flow. Second operand 8 states and 152 transitions. [2024-06-27 19:50:12,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 269 transitions, 3279 flow [2024-06-27 19:50:13,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 269 transitions, 3167 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-27 19:50:13,121 INFO L231 Difference]: Finished difference. Result has 182 places, 245 transitions, 2652 flow [2024-06-27 19:50:13,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2491, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2652, PETRI_PLACES=182, PETRI_TRANSITIONS=245} [2024-06-27 19:50:13,122 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places. [2024-06-27 19:50:13,122 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 245 transitions, 2652 flow [2024-06-27 19:50:13,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:13,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:13,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:13,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 19:50:13,122 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:13,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:13,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2103599702, now seen corresponding path program 1 times [2024-06-27 19:50:13,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:13,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761346006] [2024-06-27 19:50:13,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:13,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:13,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:13,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761346006] [2024-06-27 19:50:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761346006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:13,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:13,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:50:13,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5204066] [2024-06-27 19:50:13,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:13,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:50:13,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:13,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:50:13,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:50:13,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:13,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 245 transitions, 2652 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:13,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:13,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:13,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:14,544 INFO L124 PetriNetUnfolderBase]: 2708/4374 cut-off events. [2024-06-27 19:50:14,544 INFO L125 PetriNetUnfolderBase]: For 258452/258456 co-relation queries the response was YES. [2024-06-27 19:50:14,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32720 conditions, 4374 events. 2708/4374 cut-off events. For 258452/258456 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 25751 event pairs, 657 based on Foata normal form. 4/4377 useless extension candidates. Maximal degree in co-relation 32635. Up to 3986 conditions per place. [2024-06-27 19:50:14,589 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 229 selfloop transitions, 35 changer transitions 0/269 dead transitions. [2024-06-27 19:50:14,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 269 transitions, 3299 flow [2024-06-27 19:50:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:50:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:50:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-27 19:50:14,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557823129251701 [2024-06-27 19:50:14,590 INFO L175 Difference]: Start difference. First operand has 182 places, 245 transitions, 2652 flow. Second operand 7 states and 134 transitions. [2024-06-27 19:50:14,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 269 transitions, 3299 flow [2024-06-27 19:50:14,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 269 transitions, 3166 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-27 19:50:14,891 INFO L231 Difference]: Finished difference. Result has 183 places, 249 transitions, 2659 flow [2024-06-27 19:50:14,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2519, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2659, PETRI_PLACES=183, PETRI_TRANSITIONS=249} [2024-06-27 19:50:14,891 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 140 predicate places. [2024-06-27 19:50:14,891 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 249 transitions, 2659 flow [2024-06-27 19:50:14,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:14,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:14,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:14,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 19:50:14,892 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:14,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1201225800, now seen corresponding path program 2 times [2024-06-27 19:50:14,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:14,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978872930] [2024-06-27 19:50:14,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:15,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:15,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978872930] [2024-06-27 19:50:15,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978872930] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:15,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:15,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:50:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130932166] [2024-06-27 19:50:15,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:15,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:50:15,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:15,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:50:15,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:50:15,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:15,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 249 transitions, 2659 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:15,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:15,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:15,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:16,257 INFO L124 PetriNetUnfolderBase]: 2710/4381 cut-off events. [2024-06-27 19:50:16,257 INFO L125 PetriNetUnfolderBase]: For 266174/266178 co-relation queries the response was YES. [2024-06-27 19:50:16,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32829 conditions, 4381 events. 2710/4381 cut-off events. For 266174/266178 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25757 event pairs, 658 based on Foata normal form. 4/4384 useless extension candidates. Maximal degree in co-relation 32743. Up to 3949 conditions per place. [2024-06-27 19:50:16,298 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 220 selfloop transitions, 44 changer transitions 0/269 dead transitions. [2024-06-27 19:50:16,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 269 transitions, 3393 flow [2024-06-27 19:50:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:50:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:50:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 19:50:16,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 19:50:16,299 INFO L175 Difference]: Start difference. First operand has 183 places, 249 transitions, 2659 flow. Second operand 7 states and 133 transitions. [2024-06-27 19:50:16,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 269 transitions, 3393 flow [2024-06-27 19:50:16,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 269 transitions, 3298 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-27 19:50:16,585 INFO L231 Difference]: Finished difference. Result has 185 places, 252 transitions, 2715 flow [2024-06-27 19:50:16,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2564, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2715, PETRI_PLACES=185, PETRI_TRANSITIONS=252} [2024-06-27 19:50:16,585 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places. [2024-06-27 19:50:16,586 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 252 transitions, 2715 flow [2024-06-27 19:50:16,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:16,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:16,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:16,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 19:50:16,586 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:16,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:16,587 INFO L85 PathProgramCache]: Analyzing trace with hash 346652959, now seen corresponding path program 1 times [2024-06-27 19:50:16,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:16,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012230473] [2024-06-27 19:50:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:16,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:17,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:17,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012230473] [2024-06-27 19:50:17,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012230473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:17,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:17,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:50:17,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852710411] [2024-06-27 19:50:17,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:17,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:50:17,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:17,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:50:17,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:50:17,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:17,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 252 transitions, 2715 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:17,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:17,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:17,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:18,844 INFO L124 PetriNetUnfolderBase]: 2792/4524 cut-off events. [2024-06-27 19:50:18,845 INFO L125 PetriNetUnfolderBase]: For 285815/285819 co-relation queries the response was YES. [2024-06-27 19:50:18,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33674 conditions, 4524 events. 2792/4524 cut-off events. For 285815/285819 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 26846 event pairs, 658 based on Foata normal form. 12/4535 useless extension candidates. Maximal degree in co-relation 33587. Up to 3498 conditions per place. [2024-06-27 19:50:18,886 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 206 selfloop transitions, 102 changer transitions 0/313 dead transitions. [2024-06-27 19:50:18,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 313 transitions, 3628 flow [2024-06-27 19:50:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 19:50:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 19:50:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 232 transitions. [2024-06-27 19:50:18,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-27 19:50:18,888 INFO L175 Difference]: Start difference. First operand has 185 places, 252 transitions, 2715 flow. Second operand 12 states and 232 transitions. [2024-06-27 19:50:18,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 313 transitions, 3628 flow [2024-06-27 19:50:19,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 313 transitions, 3532 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-27 19:50:19,165 INFO L231 Difference]: Finished difference. Result has 195 places, 259 transitions, 2948 flow [2024-06-27 19:50:19,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2619, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2948, PETRI_PLACES=195, PETRI_TRANSITIONS=259} [2024-06-27 19:50:19,165 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 152 predicate places. [2024-06-27 19:50:19,165 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 259 transitions, 2948 flow [2024-06-27 19:50:19,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:19,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:19,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:19,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 19:50:19,166 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:19,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1201234294, now seen corresponding path program 2 times [2024-06-27 19:50:19,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:19,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739273726] [2024-06-27 19:50:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:19,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739273726] [2024-06-27 19:50:19,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739273726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:19,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:19,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:50:19,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681317923] [2024-06-27 19:50:19,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:19,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:50:19,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:19,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:50:19,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:50:19,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:19,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 259 transitions, 2948 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:19,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:19,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:19,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:20,757 INFO L124 PetriNetUnfolderBase]: 2828/4598 cut-off events. [2024-06-27 19:50:20,757 INFO L125 PetriNetUnfolderBase]: For 293952/293956 co-relation queries the response was YES. [2024-06-27 19:50:20,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35104 conditions, 4598 events. 2828/4598 cut-off events. For 293952/293956 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 27570 event pairs, 678 based on Foata normal form. 4/4601 useless extension candidates. Maximal degree in co-relation 35014. Up to 4094 conditions per place. [2024-06-27 19:50:20,805 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 229 selfloop transitions, 53 changer transitions 0/287 dead transitions. [2024-06-27 19:50:20,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 287 transitions, 3962 flow [2024-06-27 19:50:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:50:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:50:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 19:50:20,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-27 19:50:20,806 INFO L175 Difference]: Start difference. First operand has 195 places, 259 transitions, 2948 flow. Second operand 8 states and 150 transitions. [2024-06-27 19:50:20,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 287 transitions, 3962 flow [2024-06-27 19:50:21,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 287 transitions, 3706 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-27 19:50:21,147 INFO L231 Difference]: Finished difference. Result has 194 places, 267 transitions, 2982 flow [2024-06-27 19:50:21,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2692, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2982, PETRI_PLACES=194, PETRI_TRANSITIONS=267} [2024-06-27 19:50:21,147 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places. [2024-06-27 19:50:21,148 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 267 transitions, 2982 flow [2024-06-27 19:50:21,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:21,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:21,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:21,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 19:50:21,148 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:21,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1201234728, now seen corresponding path program 1 times [2024-06-27 19:50:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261275847] [2024-06-27 19:50:21,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:21,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:21,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261275847] [2024-06-27 19:50:21,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261275847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:21,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:21,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:50:21,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480704129] [2024-06-27 19:50:21,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:21,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:50:21,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:21,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:50:21,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:50:21,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:50:21,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 267 transitions, 2982 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:21,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:21,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:50:21,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:22,676 INFO L124 PetriNetUnfolderBase]: 2749/4486 cut-off events. [2024-06-27 19:50:22,676 INFO L125 PetriNetUnfolderBase]: For 308454/308479 co-relation queries the response was YES. [2024-06-27 19:50:22,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34731 conditions, 4486 events. 2749/4486 cut-off events. For 308454/308479 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 27172 event pairs, 916 based on Foata normal form. 16/4465 useless extension candidates. Maximal degree in co-relation 34641. Up to 4039 conditions per place. [2024-06-27 19:50:22,722 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 242 selfloop transitions, 25 changer transitions 0/297 dead transitions. [2024-06-27 19:50:22,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 297 transitions, 3747 flow [2024-06-27 19:50:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:50:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:50:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 19:50:22,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 19:50:22,724 INFO L175 Difference]: Start difference. First operand has 194 places, 267 transitions, 2982 flow. Second operand 8 states and 148 transitions. [2024-06-27 19:50:22,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 297 transitions, 3747 flow [2024-06-27 19:50:23,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 297 transitions, 3602 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-27 19:50:23,135 INFO L231 Difference]: Finished difference. Result has 202 places, 283 transitions, 3129 flow [2024-06-27 19:50:23,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2842, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3129, PETRI_PLACES=202, PETRI_TRANSITIONS=283} [2024-06-27 19:50:23,135 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 159 predicate places. [2024-06-27 19:50:23,136 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 283 transitions, 3129 flow [2024-06-27 19:50:23,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:23,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:23,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:23,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 19:50:23,136 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:23,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1188715062, now seen corresponding path program 2 times [2024-06-27 19:50:23,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:23,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390572256] [2024-06-27 19:50:23,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:23,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:23,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:23,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390572256] [2024-06-27 19:50:23,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390572256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:23,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:23,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:50:23,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304180726] [2024-06-27 19:50:23,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:23,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:50:23,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:23,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:50:23,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:50:23,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:50:23,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 283 transitions, 3129 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:23,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:23,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:50:23,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:24,743 INFO L124 PetriNetUnfolderBase]: 2769/4514 cut-off events. [2024-06-27 19:50:24,744 INFO L125 PetriNetUnfolderBase]: For 318764/318789 co-relation queries the response was YES. [2024-06-27 19:50:24,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35393 conditions, 4514 events. 2769/4514 cut-off events. For 318764/318789 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 27376 event pairs, 914 based on Foata normal form. 16/4494 useless extension candidates. Maximal degree in co-relation 35296. Up to 4060 conditions per place. [2024-06-27 19:50:24,797 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 250 selfloop transitions, 36 changer transitions 0/316 dead transitions. [2024-06-27 19:50:24,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 316 transitions, 4000 flow [2024-06-27 19:50:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:50:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:50:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 19:50:24,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-27 19:50:24,798 INFO L175 Difference]: Start difference. First operand has 202 places, 283 transitions, 3129 flow. Second operand 9 states and 166 transitions. [2024-06-27 19:50:24,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 316 transitions, 4000 flow [2024-06-27 19:50:25,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 316 transitions, 3843 flow, removed 66 selfloop flow, removed 1 redundant places. [2024-06-27 19:50:25,281 INFO L231 Difference]: Finished difference. Result has 213 places, 297 transitions, 3349 flow [2024-06-27 19:50:25,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3046, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3349, PETRI_PLACES=213, PETRI_TRANSITIONS=297} [2024-06-27 19:50:25,282 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 170 predicate places. [2024-06-27 19:50:25,282 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 297 transitions, 3349 flow [2024-06-27 19:50:25,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:25,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:25,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:25,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 19:50:25,283 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:25,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:25,283 INFO L85 PathProgramCache]: Analyzing trace with hash 78729592, now seen corresponding path program 3 times [2024-06-27 19:50:25,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:25,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450755567] [2024-06-27 19:50:25,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:25,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:26,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:26,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450755567] [2024-06-27 19:50:26,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450755567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:26,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:26,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:50:26,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53417444] [2024-06-27 19:50:26,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:26,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:50:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:50:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:50:26,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:26,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 297 transitions, 3349 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:26,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:26,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:26,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:27,012 INFO L124 PetriNetUnfolderBase]: 2932/4751 cut-off events. [2024-06-27 19:50:27,012 INFO L125 PetriNetUnfolderBase]: For 324142/324144 co-relation queries the response was YES. [2024-06-27 19:50:27,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37271 conditions, 4751 events. 2932/4751 cut-off events. For 324142/324144 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 28438 event pairs, 675 based on Foata normal form. 4/4754 useless extension candidates. Maximal degree in co-relation 37168. Up to 4277 conditions per place. [2024-06-27 19:50:27,066 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 281 selfloop transitions, 60 changer transitions 0/346 dead transitions. [2024-06-27 19:50:27,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 346 transitions, 4531 flow [2024-06-27 19:50:27,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:50:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:50:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 19:50:27,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 19:50:27,067 INFO L175 Difference]: Start difference. First operand has 213 places, 297 transitions, 3349 flow. Second operand 9 states and 168 transitions. [2024-06-27 19:50:27,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 346 transitions, 4531 flow [2024-06-27 19:50:27,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 346 transitions, 4395 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-27 19:50:27,440 INFO L231 Difference]: Finished difference. Result has 219 places, 323 transitions, 3747 flow [2024-06-27 19:50:27,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3213, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3747, PETRI_PLACES=219, PETRI_TRANSITIONS=323} [2024-06-27 19:50:27,441 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 176 predicate places. [2024-06-27 19:50:27,441 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 323 transitions, 3747 flow [2024-06-27 19:50:27,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:27,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:27,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:27,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 19:50:27,441 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:27,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1201222204, now seen corresponding path program 4 times [2024-06-27 19:50:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:27,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220991089] [2024-06-27 19:50:27,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:27,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:28,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:28,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220991089] [2024-06-27 19:50:28,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220991089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:28,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:28,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:50:28,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111373366] [2024-06-27 19:50:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:28,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:50:28,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:28,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:50:28,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:50:28,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:28,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 323 transitions, 3747 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:28,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:28,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:28,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:29,042 INFO L124 PetriNetUnfolderBase]: 2936/4757 cut-off events. [2024-06-27 19:50:29,042 INFO L125 PetriNetUnfolderBase]: For 334265/334267 co-relation queries the response was YES. [2024-06-27 19:50:29,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37820 conditions, 4757 events. 2936/4757 cut-off events. For 334265/334267 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 28414 event pairs, 675 based on Foata normal form. 4/4760 useless extension candidates. Maximal degree in co-relation 37713. Up to 4238 conditions per place. [2024-06-27 19:50:29,185 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 258 selfloop transitions, 80 changer transitions 0/343 dead transitions. [2024-06-27 19:50:29,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 343 transitions, 4666 flow [2024-06-27 19:50:29,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:50:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:50:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 19:50:29,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 19:50:29,186 INFO L175 Difference]: Start difference. First operand has 219 places, 323 transitions, 3747 flow. Second operand 8 states and 148 transitions. [2024-06-27 19:50:29,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 343 transitions, 4666 flow [2024-06-27 19:50:29,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 343 transitions, 4556 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-27 19:50:29,579 INFO L231 Difference]: Finished difference. Result has 224 places, 327 transitions, 3902 flow [2024-06-27 19:50:29,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3637, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3902, PETRI_PLACES=224, PETRI_TRANSITIONS=327} [2024-06-27 19:50:29,579 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 181 predicate places. [2024-06-27 19:50:29,579 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 327 transitions, 3902 flow [2024-06-27 19:50:29,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:29,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:29,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:29,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 19:50:29,580 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:29,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash 205240426, now seen corresponding path program 3 times [2024-06-27 19:50:29,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:29,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969519681] [2024-06-27 19:50:29,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:29,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:30,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:30,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969519681] [2024-06-27 19:50:30,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969519681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:30,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:30,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:50:30,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336150935] [2024-06-27 19:50:30,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:30,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:50:30,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:30,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:50:30,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:50:30,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:30,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 327 transitions, 3902 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:30,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:30,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:30,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:31,159 INFO L124 PetriNetUnfolderBase]: 2922/4722 cut-off events. [2024-06-27 19:50:31,159 INFO L125 PetriNetUnfolderBase]: For 342203/342203 co-relation queries the response was YES. [2024-06-27 19:50:31,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37836 conditions, 4722 events. 2922/4722 cut-off events. For 342203/342203 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 28108 event pairs, 691 based on Foata normal form. 2/4721 useless extension candidates. Maximal degree in co-relation 37728. Up to 4313 conditions per place. [2024-06-27 19:50:31,201 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 295 selfloop transitions, 43 changer transitions 0/343 dead transitions. [2024-06-27 19:50:31,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 343 transitions, 4640 flow [2024-06-27 19:50:31,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:50:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:50:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-27 19:50:31,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-27 19:50:31,203 INFO L175 Difference]: Start difference. First operand has 224 places, 327 transitions, 3902 flow. Second operand 7 states and 131 transitions. [2024-06-27 19:50:31,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 343 transitions, 4640 flow [2024-06-27 19:50:31,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 343 transitions, 4422 flow, removed 57 selfloop flow, removed 5 redundant places. [2024-06-27 19:50:31,698 INFO L231 Difference]: Finished difference. Result has 226 places, 327 transitions, 3780 flow [2024-06-27 19:50:31,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3684, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3780, PETRI_PLACES=226, PETRI_TRANSITIONS=327} [2024-06-27 19:50:31,699 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places. [2024-06-27 19:50:31,699 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 327 transitions, 3780 flow [2024-06-27 19:50:31,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:31,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:31,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:31,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 19:50:31,699 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:31,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:31,700 INFO L85 PathProgramCache]: Analyzing trace with hash -82265662, now seen corresponding path program 4 times [2024-06-27 19:50:31,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:31,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444468216] [2024-06-27 19:50:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:32,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:32,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444468216] [2024-06-27 19:50:32,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444468216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:32,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:32,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:50:32,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388917634] [2024-06-27 19:50:32,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:32,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:50:32,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:32,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:50:32,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:50:32,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:32,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 327 transitions, 3780 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:32,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:32,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:32,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:33,305 INFO L124 PetriNetUnfolderBase]: 2927/4729 cut-off events. [2024-06-27 19:50:33,305 INFO L125 PetriNetUnfolderBase]: For 339069/339069 co-relation queries the response was YES. [2024-06-27 19:50:33,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37674 conditions, 4729 events. 2927/4729 cut-off events. For 339069/339069 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 28161 event pairs, 689 based on Foata normal form. 1/4727 useless extension candidates. Maximal degree in co-relation 37565. Up to 4298 conditions per place. [2024-06-27 19:50:33,351 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 282 selfloop transitions, 56 changer transitions 0/343 dead transitions. [2024-06-27 19:50:33,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 343 transitions, 4559 flow [2024-06-27 19:50:33,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:50:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:50:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-27 19:50:33,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-27 19:50:33,353 INFO L175 Difference]: Start difference. First operand has 226 places, 327 transitions, 3780 flow. Second operand 7 states and 130 transitions. [2024-06-27 19:50:33,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 343 transitions, 4559 flow [2024-06-27 19:50:33,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 343 transitions, 4314 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-27 19:50:33,813 INFO L231 Difference]: Finished difference. Result has 225 places, 330 transitions, 3717 flow [2024-06-27 19:50:33,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3535, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3717, PETRI_PLACES=225, PETRI_TRANSITIONS=330} [2024-06-27 19:50:33,813 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places. [2024-06-27 19:50:33,813 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 330 transitions, 3717 flow [2024-06-27 19:50:33,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:33,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:33,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:33,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 19:50:33,814 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:33,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:33,814 INFO L85 PathProgramCache]: Analyzing trace with hash 145635488, now seen corresponding path program 5 times [2024-06-27 19:50:33,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:33,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815758184] [2024-06-27 19:50:33,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:33,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:34,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:34,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815758184] [2024-06-27 19:50:34,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815758184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:34,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:34,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:50:34,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843890640] [2024-06-27 19:50:34,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:34,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:50:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:50:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:50:34,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:34,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 330 transitions, 3717 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:34,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:34,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:34,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:35,301 INFO L124 PetriNetUnfolderBase]: 2932/4750 cut-off events. [2024-06-27 19:50:35,302 INFO L125 PetriNetUnfolderBase]: For 349751/349753 co-relation queries the response was YES. [2024-06-27 19:50:35,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37868 conditions, 4750 events. 2932/4750 cut-off events. For 349751/349753 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 28370 event pairs, 695 based on Foata normal form. 3/4750 useless extension candidates. Maximal degree in co-relation 37758. Up to 4213 conditions per place. [2024-06-27 19:50:35,350 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 250 selfloop transitions, 88 changer transitions 0/343 dead transitions. [2024-06-27 19:50:35,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 343 transitions, 4601 flow [2024-06-27 19:50:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:50:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:50:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 19:50:35,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2024-06-27 19:50:35,351 INFO L175 Difference]: Start difference. First operand has 225 places, 330 transitions, 3717 flow. Second operand 7 states and 129 transitions. [2024-06-27 19:50:35,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 343 transitions, 4601 flow [2024-06-27 19:50:35,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 343 transitions, 4451 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-27 19:50:35,783 INFO L231 Difference]: Finished difference. Result has 227 places, 333 transitions, 3813 flow [2024-06-27 19:50:35,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3567, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3813, PETRI_PLACES=227, PETRI_TRANSITIONS=333} [2024-06-27 19:50:35,784 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 184 predicate places. [2024-06-27 19:50:35,784 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 333 transitions, 3813 flow [2024-06-27 19:50:35,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:35,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:35,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:35,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 19:50:35,785 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:35,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:35,785 INFO L85 PathProgramCache]: Analyzing trace with hash 213657672, now seen corresponding path program 6 times [2024-06-27 19:50:35,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:35,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944079605] [2024-06-27 19:50:35,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:35,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:36,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:36,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944079605] [2024-06-27 19:50:36,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944079605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:36,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:36,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:50:36,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098526061] [2024-06-27 19:50:36,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:36,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:50:36,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:50:36,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:50:36,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:36,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 333 transitions, 3813 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:36,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:36,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:36,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:37,339 INFO L124 PetriNetUnfolderBase]: 2924/4738 cut-off events. [2024-06-27 19:50:37,340 INFO L125 PetriNetUnfolderBase]: For 358866/358868 co-relation queries the response was YES. [2024-06-27 19:50:37,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37887 conditions, 4738 events. 2924/4738 cut-off events. For 358866/358868 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 28327 event pairs, 695 based on Foata normal form. 4/4739 useless extension candidates. Maximal degree in co-relation 37776. Up to 4205 conditions per place. [2024-06-27 19:50:37,394 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 257 selfloop transitions, 80 changer transitions 0/342 dead transitions. [2024-06-27 19:50:37,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 342 transitions, 4511 flow [2024-06-27 19:50:37,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:50:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:50:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 19:50:37,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2024-06-27 19:50:37,395 INFO L175 Difference]: Start difference. First operand has 227 places, 333 transitions, 3813 flow. Second operand 7 states and 129 transitions. [2024-06-27 19:50:37,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 342 transitions, 4511 flow [2024-06-27 19:50:37,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 342 transitions, 4265 flow, removed 49 selfloop flow, removed 4 redundant places. [2024-06-27 19:50:37,881 INFO L231 Difference]: Finished difference. Result has 230 places, 333 transitions, 3735 flow [2024-06-27 19:50:37,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3567, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3735, PETRI_PLACES=230, PETRI_TRANSITIONS=333} [2024-06-27 19:50:37,882 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 187 predicate places. [2024-06-27 19:50:37,882 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 333 transitions, 3735 flow [2024-06-27 19:50:37,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:37,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:37,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:37,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 19:50:37,883 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:37,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:37,883 INFO L85 PathProgramCache]: Analyzing trace with hash 493160595, now seen corresponding path program 2 times [2024-06-27 19:50:37,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:37,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716796621] [2024-06-27 19:50:37,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:37,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:38,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:38,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716796621] [2024-06-27 19:50:38,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716796621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:38,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:38,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:50:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204579627] [2024-06-27 19:50:38,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:38,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:50:38,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:38,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:50:38,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:50:39,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:39,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 333 transitions, 3735 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:39,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:39,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:39,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:40,382 INFO L124 PetriNetUnfolderBase]: 3006/4865 cut-off events. [2024-06-27 19:50:40,383 INFO L125 PetriNetUnfolderBase]: For 380455/380455 co-relation queries the response was YES. [2024-06-27 19:50:40,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38642 conditions, 4865 events. 3006/4865 cut-off events. For 380455/380455 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 29215 event pairs, 704 based on Foata normal form. 12/4874 useless extension candidates. Maximal degree in co-relation 38530. Up to 3934 conditions per place. [2024-06-27 19:50:40,434 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 270 selfloop transitions, 114 changer transitions 0/389 dead transitions. [2024-06-27 19:50:40,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 389 transitions, 4820 flow [2024-06-27 19:50:40,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 19:50:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 19:50:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2024-06-27 19:50:40,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-27 19:50:40,436 INFO L175 Difference]: Start difference. First operand has 230 places, 333 transitions, 3735 flow. Second operand 12 states and 230 transitions. [2024-06-27 19:50:40,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 389 transitions, 4820 flow [2024-06-27 19:50:40,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 389 transitions, 4626 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 19:50:40,970 INFO L231 Difference]: Finished difference. Result has 237 places, 340 transitions, 3893 flow [2024-06-27 19:50:40,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3541, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3893, PETRI_PLACES=237, PETRI_TRANSITIONS=340} [2024-06-27 19:50:40,971 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 194 predicate places. [2024-06-27 19:50:40,971 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 340 transitions, 3893 flow [2024-06-27 19:50:40,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:40,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:40,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:40,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 19:50:40,972 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:40,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1241555389, now seen corresponding path program 3 times [2024-06-27 19:50:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:40,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428627677] [2024-06-27 19:50:40,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:40,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:41,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:41,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428627677] [2024-06-27 19:50:41,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428627677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:41,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:41,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:50:41,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967846868] [2024-06-27 19:50:41,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:41,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:50:41,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:41,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:50:41,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:50:42,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:42,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 340 transitions, 3893 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:42,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:42,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:42,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:43,333 INFO L124 PetriNetUnfolderBase]: 3123/5093 cut-off events. [2024-06-27 19:50:43,333 INFO L125 PetriNetUnfolderBase]: For 397128/397128 co-relation queries the response was YES. [2024-06-27 19:50:43,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40453 conditions, 5093 events. 3123/5093 cut-off events. For 397128/397128 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 31178 event pairs, 699 based on Foata normal form. 12/5102 useless extension candidates. Maximal degree in co-relation 40338. Up to 4123 conditions per place. [2024-06-27 19:50:43,388 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 272 selfloop transitions, 131 changer transitions 0/408 dead transitions. [2024-06-27 19:50:43,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 408 transitions, 5119 flow [2024-06-27 19:50:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 19:50:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 19:50:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 247 transitions. [2024-06-27 19:50:43,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 19:50:43,390 INFO L175 Difference]: Start difference. First operand has 237 places, 340 transitions, 3893 flow. Second operand 13 states and 247 transitions. [2024-06-27 19:50:43,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 408 transitions, 5119 flow [2024-06-27 19:50:43,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 408 transitions, 4852 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-27 19:50:43,840 INFO L231 Difference]: Finished difference. Result has 244 places, 353 transitions, 4113 flow [2024-06-27 19:50:43,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3646, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4113, PETRI_PLACES=244, PETRI_TRANSITIONS=353} [2024-06-27 19:50:43,841 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places. [2024-06-27 19:50:43,841 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 353 transitions, 4113 flow [2024-06-27 19:50:43,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:43,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:43,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:43,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 19:50:43,842 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:43,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:43,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1720071921, now seen corresponding path program 4 times [2024-06-27 19:50:43,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:43,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706740277] [2024-06-27 19:50:43,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:43,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:44,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:44,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706740277] [2024-06-27 19:50:44,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706740277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:44,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:44,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:50:44,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677506005] [2024-06-27 19:50:44,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:44,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:50:44,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:44,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:50:44,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:50:44,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:44,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 353 transitions, 4113 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:44,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:44,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:44,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:46,302 INFO L124 PetriNetUnfolderBase]: 3144/5142 cut-off events. [2024-06-27 19:50:46,302 INFO L125 PetriNetUnfolderBase]: For 394104/394104 co-relation queries the response was YES. [2024-06-27 19:50:46,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40496 conditions, 5142 events. 3144/5142 cut-off events. For 394104/394104 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 31543 event pairs, 641 based on Foata normal form. 12/5151 useless extension candidates. Maximal degree in co-relation 40378. Up to 3345 conditions per place. [2024-06-27 19:50:46,360 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 259 selfloop transitions, 143 changer transitions 0/407 dead transitions. [2024-06-27 19:50:46,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 407 transitions, 5279 flow [2024-06-27 19:50:46,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 19:50:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 19:50:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 232 transitions. [2024-06-27 19:50:46,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-27 19:50:46,361 INFO L175 Difference]: Start difference. First operand has 244 places, 353 transitions, 4113 flow. Second operand 12 states and 232 transitions. [2024-06-27 19:50:46,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 407 transitions, 5279 flow [2024-06-27 19:50:46,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 407 transitions, 5039 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-27 19:50:46,859 INFO L231 Difference]: Finished difference. Result has 250 places, 354 transitions, 4229 flow [2024-06-27 19:50:46,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3877, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4229, PETRI_PLACES=250, PETRI_TRANSITIONS=354} [2024-06-27 19:50:46,860 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 207 predicate places. [2024-06-27 19:50:46,860 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 354 transitions, 4229 flow [2024-06-27 19:50:46,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:46,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:46,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:46,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 19:50:46,861 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:46,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1682834485, now seen corresponding path program 5 times [2024-06-27 19:50:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:46,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136502395] [2024-06-27 19:50:46,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:46,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:47,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-06-27 19:50:47,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:47,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136502395] [2024-06-27 19:50:47,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136502395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:47,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:47,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:50:47,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142635653] [2024-06-27 19:50:47,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:47,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:50:47,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:50:47,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:50:47,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:47,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 354 transitions, 4229 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:47,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:47,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:47,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:49,227 INFO L124 PetriNetUnfolderBase]: 3124/5104 cut-off events. [2024-06-27 19:50:49,227 INFO L125 PetriNetUnfolderBase]: For 388956/388956 co-relation queries the response was YES. [2024-06-27 19:50:49,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39788 conditions, 5104 events. 3124/5104 cut-off events. For 388956/388956 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 31307 event pairs, 695 based on Foata normal form. 12/5113 useless extension candidates. Maximal degree in co-relation 39668. Up to 4130 conditions per place. [2024-06-27 19:50:49,285 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 274 selfloop transitions, 127 changer transitions 0/406 dead transitions. [2024-06-27 19:50:49,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 406 transitions, 5186 flow [2024-06-27 19:50:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 19:50:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 19:50:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 248 transitions. [2024-06-27 19:50:49,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542124542124542 [2024-06-27 19:50:49,287 INFO L175 Difference]: Start difference. First operand has 250 places, 354 transitions, 4229 flow. Second operand 13 states and 248 transitions. [2024-06-27 19:50:49,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 406 transitions, 5186 flow [2024-06-27 19:50:49,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 406 transitions, 4844 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-06-27 19:50:49,901 INFO L231 Difference]: Finished difference. Result has 252 places, 353 transitions, 4075 flow [2024-06-27 19:50:49,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3817, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4075, PETRI_PLACES=252, PETRI_TRANSITIONS=353} [2024-06-27 19:50:49,916 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 209 predicate places. [2024-06-27 19:50:49,916 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 353 transitions, 4075 flow [2024-06-27 19:50:49,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:49,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:49,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:49,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 19:50:49,917 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:49,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:49,917 INFO L85 PathProgramCache]: Analyzing trace with hash 153739632, now seen corresponding path program 5 times [2024-06-27 19:50:49,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:49,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297677261] [2024-06-27 19:50:49,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:50,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:50,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297677261] [2024-06-27 19:50:50,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297677261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:50,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:50,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:50:50,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224246573] [2024-06-27 19:50:50,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:50,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:50:50,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:50,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:50:50,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:50:50,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:50,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 353 transitions, 4075 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:50,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:50,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:50,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:51,797 INFO L124 PetriNetUnfolderBase]: 3152/5153 cut-off events. [2024-06-27 19:50:51,797 INFO L125 PetriNetUnfolderBase]: For 390745/390747 co-relation queries the response was YES. [2024-06-27 19:50:51,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39834 conditions, 5153 events. 3152/5153 cut-off events. For 390745/390747 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 31740 event pairs, 728 based on Foata normal form. 4/5154 useless extension candidates. Maximal degree in co-relation 39714. Up to 4441 conditions per place. [2024-06-27 19:50:51,856 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 265 selfloop transitions, 114 changer transitions 0/384 dead transitions. [2024-06-27 19:50:51,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 384 transitions, 5475 flow [2024-06-27 19:50:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:50:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:50:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 19:50:51,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-27 19:50:51,858 INFO L175 Difference]: Start difference. First operand has 252 places, 353 transitions, 4075 flow. Second operand 8 states and 147 transitions. [2024-06-27 19:50:51,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 384 transitions, 5475 flow [2024-06-27 19:50:52,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 384 transitions, 4975 flow, removed 12 selfloop flow, removed 16 redundant places. [2024-06-27 19:50:52,403 INFO L231 Difference]: Finished difference. Result has 246 places, 370 transitions, 4171 flow [2024-06-27 19:50:52,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3575, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4171, PETRI_PLACES=246, PETRI_TRANSITIONS=370} [2024-06-27 19:50:52,404 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places. [2024-06-27 19:50:52,404 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 370 transitions, 4171 flow [2024-06-27 19:50:52,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:52,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:52,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:52,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 19:50:52,404 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:52,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:52,405 INFO L85 PathProgramCache]: Analyzing trace with hash 153740066, now seen corresponding path program 3 times [2024-06-27 19:50:52,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:52,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210023940] [2024-06-27 19:50:52,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:52,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:53,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:53,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210023940] [2024-06-27 19:50:53,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210023940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:53,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:53,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:50:53,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975781638] [2024-06-27 19:50:53,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:53,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:50:53,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:53,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:50:53,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:50:53,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:50:53,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 370 transitions, 4171 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:53,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:53,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:50:53,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:54,261 INFO L124 PetriNetUnfolderBase]: 3086/5067 cut-off events. [2024-06-27 19:50:54,261 INFO L125 PetriNetUnfolderBase]: For 419018/419032 co-relation queries the response was YES. [2024-06-27 19:50:54,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39321 conditions, 5067 events. 3086/5067 cut-off events. For 419018/419032 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 31673 event pairs, 948 based on Foata normal form. 15/5041 useless extension candidates. Maximal degree in co-relation 39202. Up to 4471 conditions per place. [2024-06-27 19:50:54,318 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 285 selfloop transitions, 61 changer transitions 0/394 dead transitions. [2024-06-27 19:50:54,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 394 transitions, 5445 flow [2024-06-27 19:50:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:50:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:50:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 19:50:54,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-27 19:50:54,319 INFO L175 Difference]: Start difference. First operand has 246 places, 370 transitions, 4171 flow. Second operand 8 states and 150 transitions. [2024-06-27 19:50:54,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 394 transitions, 5445 flow [2024-06-27 19:50:54,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 394 transitions, 5230 flow, removed 64 selfloop flow, removed 3 redundant places. [2024-06-27 19:50:54,892 INFO L231 Difference]: Finished difference. Result has 251 places, 379 transitions, 4348 flow [2024-06-27 19:50:54,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3956, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4348, PETRI_PLACES=251, PETRI_TRANSITIONS=379} [2024-06-27 19:50:54,893 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 208 predicate places. [2024-06-27 19:50:54,893 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 379 transitions, 4348 flow [2024-06-27 19:50:54,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:54,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:54,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:54,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 19:50:54,894 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:54,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash 154215296, now seen corresponding path program 4 times [2024-06-27 19:50:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:54,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395799382] [2024-06-27 19:50:54,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:54,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:55,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:55,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395799382] [2024-06-27 19:50:55,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395799382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:55,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:55,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:50:55,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530995506] [2024-06-27 19:50:55,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:55,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:50:55,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:55,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:50:55,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:50:55,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:50:55,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 379 transitions, 4348 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:55,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:55,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:50:55,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:56,990 INFO L124 PetriNetUnfolderBase]: 3081/5057 cut-off events. [2024-06-27 19:50:56,990 INFO L125 PetriNetUnfolderBase]: For 429030/429055 co-relation queries the response was YES. [2024-06-27 19:50:57,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39122 conditions, 5057 events. 3081/5057 cut-off events. For 429030/429055 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 31731 event pairs, 1183 based on Foata normal form. 25/5040 useless extension candidates. Maximal degree in co-relation 39001. Up to 4557 conditions per place. [2024-06-27 19:50:57,054 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 326 selfloop transitions, 18 changer transitions 0/392 dead transitions. [2024-06-27 19:50:57,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 392 transitions, 5156 flow [2024-06-27 19:50:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:50:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:50:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-27 19:50:57,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-27 19:50:57,056 INFO L175 Difference]: Start difference. First operand has 251 places, 379 transitions, 4348 flow. Second operand 8 states and 140 transitions. [2024-06-27 19:50:57,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 392 transitions, 5156 flow [2024-06-27 19:50:57,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 392 transitions, 5023 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-27 19:50:57,688 INFO L231 Difference]: Finished difference. Result has 256 places, 382 transitions, 4357 flow [2024-06-27 19:50:57,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4225, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4357, PETRI_PLACES=256, PETRI_TRANSITIONS=382} [2024-06-27 19:50:57,689 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places. [2024-06-27 19:50:57,689 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 382 transitions, 4357 flow [2024-06-27 19:50:57,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:57,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:50:57,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:50:57,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 19:50:57,689 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:50:57,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:50:57,690 INFO L85 PathProgramCache]: Analyzing trace with hash 139930062, now seen corresponding path program 6 times [2024-06-27 19:50:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:50:57,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205183720] [2024-06-27 19:50:57,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:50:57,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:50:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:50:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:50:58,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:50:58,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205183720] [2024-06-27 19:50:58,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205183720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:50:58,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:50:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:50:58,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285285123] [2024-06-27 19:50:58,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:50:58,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:50:58,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:50:58,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:50:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:50:58,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:50:58,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 382 transitions, 4357 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:50:58,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:50:58,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:50:58,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:50:59,643 INFO L124 PetriNetUnfolderBase]: 3187/5215 cut-off events. [2024-06-27 19:50:59,643 INFO L125 PetriNetUnfolderBase]: For 429778/429780 co-relation queries the response was YES. [2024-06-27 19:50:59,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40296 conditions, 5215 events. 3187/5215 cut-off events. For 429778/429780 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 32261 event pairs, 730 based on Foata normal form. 4/5216 useless extension candidates. Maximal degree in co-relation 40173. Up to 4602 conditions per place. [2024-06-27 19:50:59,697 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 308 selfloop transitions, 87 changer transitions 0/400 dead transitions. [2024-06-27 19:50:59,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 400 transitions, 5499 flow [2024-06-27 19:50:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:50:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:50:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-27 19:50:59,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2024-06-27 19:50:59,698 INFO L175 Difference]: Start difference. First operand has 256 places, 382 transitions, 4357 flow. Second operand 8 states and 145 transitions. [2024-06-27 19:50:59,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 400 transitions, 5499 flow [2024-06-27 19:51:00,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 400 transitions, 5393 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-27 19:51:00,143 INFO L231 Difference]: Finished difference. Result has 259 places, 388 transitions, 4595 flow [2024-06-27 19:51:00,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4251, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4595, PETRI_PLACES=259, PETRI_TRANSITIONS=388} [2024-06-27 19:51:00,144 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 216 predicate places. [2024-06-27 19:51:00,144 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 388 transitions, 4595 flow [2024-06-27 19:51:00,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:00,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:00,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:00,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 19:51:00,145 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:00,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:00,145 INFO L85 PathProgramCache]: Analyzing trace with hash 213666600, now seen corresponding path program 5 times [2024-06-27 19:51:00,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:00,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465845754] [2024-06-27 19:51:00,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:00,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:00,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:00,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465845754] [2024-06-27 19:51:00,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465845754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:00,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:00,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:51:00,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614834706] [2024-06-27 19:51:00,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:00,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:51:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:00,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:51:00,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:51:01,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:51:01,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 388 transitions, 4595 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:01,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:01,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:51:01,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:01,918 INFO L124 PetriNetUnfolderBase]: 3092/5081 cut-off events. [2024-06-27 19:51:01,918 INFO L125 PetriNetUnfolderBase]: For 447106/447120 co-relation queries the response was YES. [2024-06-27 19:51:01,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39923 conditions, 5081 events. 3092/5081 cut-off events. For 447106/447120 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 31837 event pairs, 948 based on Foata normal form. 14/5054 useless extension candidates. Maximal degree in co-relation 39798. Up to 4536 conditions per place. [2024-06-27 19:51:01,980 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 315 selfloop transitions, 37 changer transitions 0/401 dead transitions. [2024-06-27 19:51:01,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 401 transitions, 5413 flow [2024-06-27 19:51:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:51:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:51:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 19:51:01,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 19:51:01,981 INFO L175 Difference]: Start difference. First operand has 259 places, 388 transitions, 4595 flow. Second operand 8 states and 144 transitions. [2024-06-27 19:51:01,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 401 transitions, 5413 flow [2024-06-27 19:51:02,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 401 transitions, 5228 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-27 19:51:02,543 INFO L231 Difference]: Finished difference. Result has 263 places, 391 transitions, 4584 flow [2024-06-27 19:51:02,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4410, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4584, PETRI_PLACES=263, PETRI_TRANSITIONS=391} [2024-06-27 19:51:02,544 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 220 predicate places. [2024-06-27 19:51:02,544 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 391 transitions, 4584 flow [2024-06-27 19:51:02,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:02,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:02,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:02,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 19:51:02,545 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:02,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash 139917972, now seen corresponding path program 7 times [2024-06-27 19:51:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:02,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474135269] [2024-06-27 19:51:02,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:02,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:03,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:03,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474135269] [2024-06-27 19:51:03,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474135269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:03,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:03,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:03,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397600866] [2024-06-27 19:51:03,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:03,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:03,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:03,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:03,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:03,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:51:03,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 391 transitions, 4584 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:03,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:03,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:51:03,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:04,320 INFO L124 PetriNetUnfolderBase]: 3186/5214 cut-off events. [2024-06-27 19:51:04,320 INFO L125 PetriNetUnfolderBase]: For 449228/449230 co-relation queries the response was YES. [2024-06-27 19:51:04,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40868 conditions, 5214 events. 3186/5214 cut-off events. For 449228/449230 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 32266 event pairs, 730 based on Foata normal form. 4/5215 useless extension candidates. Maximal degree in co-relation 40741. Up to 4630 conditions per place. [2024-06-27 19:51:04,386 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 314 selfloop transitions, 86 changer transitions 0/405 dead transitions. [2024-06-27 19:51:04,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 405 transitions, 5504 flow [2024-06-27 19:51:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:51:04,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:51:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 19:51:04,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-27 19:51:04,388 INFO L175 Difference]: Start difference. First operand has 263 places, 391 transitions, 4584 flow. Second operand 8 states and 143 transitions. [2024-06-27 19:51:04,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 405 transitions, 5504 flow [2024-06-27 19:51:04,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 405 transitions, 5356 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-27 19:51:04,971 INFO L231 Difference]: Finished difference. Result has 265 places, 395 transitions, 4717 flow [2024-06-27 19:51:04,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4436, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4717, PETRI_PLACES=265, PETRI_TRANSITIONS=395} [2024-06-27 19:51:04,971 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 222 predicate places. [2024-06-27 19:51:04,972 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 395 transitions, 4717 flow [2024-06-27 19:51:04,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:04,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:04,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:04,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 19:51:04,972 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:04,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:04,973 INFO L85 PathProgramCache]: Analyzing trace with hash 201017792, now seen corresponding path program 1 times [2024-06-27 19:51:04,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:04,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895109037] [2024-06-27 19:51:04,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:04,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:05,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:05,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895109037] [2024-06-27 19:51:05,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895109037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:05,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:05,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:05,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657613337] [2024-06-27 19:51:05,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:05,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:05,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:05,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:05,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:05,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:51:05,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 395 transitions, 4717 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:05,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:05,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:51:05,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:06,893 INFO L124 PetriNetUnfolderBase]: 3097/5126 cut-off events. [2024-06-27 19:51:06,894 INFO L125 PetriNetUnfolderBase]: For 459154/459154 co-relation queries the response was YES. [2024-06-27 19:51:06,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40645 conditions, 5126 events. 3097/5126 cut-off events. For 459154/459154 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 32234 event pairs, 1184 based on Foata normal form. 1/5126 useless extension candidates. Maximal degree in co-relation 40517. Up to 4637 conditions per place. [2024-06-27 19:51:06,959 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 375 selfloop transitions, 19 changer transitions 0/417 dead transitions. [2024-06-27 19:51:06,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 417 transitions, 5623 flow [2024-06-27 19:51:06,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:51:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:51:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-27 19:51:06,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-27 19:51:06,961 INFO L175 Difference]: Start difference. First operand has 265 places, 395 transitions, 4717 flow. Second operand 9 states and 161 transitions. [2024-06-27 19:51:06,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 417 transitions, 5623 flow [2024-06-27 19:51:07,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 417 transitions, 5388 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-27 19:51:07,579 INFO L231 Difference]: Finished difference. Result has 268 places, 398 transitions, 4594 flow [2024-06-27 19:51:07,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4482, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4594, PETRI_PLACES=268, PETRI_TRANSITIONS=398} [2024-06-27 19:51:07,580 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 225 predicate places. [2024-06-27 19:51:07,580 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 398 transitions, 4594 flow [2024-06-27 19:51:07,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:07,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:07,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:07,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 19:51:07,581 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:07,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:07,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1896551260, now seen corresponding path program 1 times [2024-06-27 19:51:07,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:07,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125248269] [2024-06-27 19:51:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:07,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125248269] [2024-06-27 19:51:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125248269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:08,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:08,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395612532] [2024-06-27 19:51:08,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:08,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:08,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:08,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:08,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:51:08,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 398 transitions, 4594 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:08,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:08,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:51:08,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:09,375 INFO L124 PetriNetUnfolderBase]: 3122/5163 cut-off events. [2024-06-27 19:51:09,376 INFO L125 PetriNetUnfolderBase]: For 483219/483219 co-relation queries the response was YES. [2024-06-27 19:51:09,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41170 conditions, 5163 events. 3122/5163 cut-off events. For 483219/483219 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 32454 event pairs, 1182 based on Foata normal form. 6/5168 useless extension candidates. Maximal degree in co-relation 41041. Up to 4664 conditions per place. [2024-06-27 19:51:09,436 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 378 selfloop transitions, 19 changer transitions 0/420 dead transitions. [2024-06-27 19:51:09,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 420 transitions, 5516 flow [2024-06-27 19:51:09,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:51:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:51:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 19:51:09,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-27 19:51:09,438 INFO L175 Difference]: Start difference. First operand has 268 places, 398 transitions, 4594 flow. Second operand 8 states and 149 transitions. [2024-06-27 19:51:09,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 420 transitions, 5516 flow [2024-06-27 19:51:10,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 420 transitions, 5414 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-27 19:51:10,108 INFO L231 Difference]: Finished difference. Result has 269 places, 402 transitions, 4605 flow [2024-06-27 19:51:10,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4492, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4605, PETRI_PLACES=269, PETRI_TRANSITIONS=402} [2024-06-27 19:51:10,108 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 226 predicate places. [2024-06-27 19:51:10,108 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 402 transitions, 4605 flow [2024-06-27 19:51:10,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:10,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:10,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:10,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 19:51:10,109 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:10,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1891903120, now seen corresponding path program 2 times [2024-06-27 19:51:10,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:10,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007414057] [2024-06-27 19:51:10,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:10,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:10,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:10,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007414057] [2024-06-27 19:51:10,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007414057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:10,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:10,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:10,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462365247] [2024-06-27 19:51:10,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:10,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:10,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:10,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:10,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:51:10,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 402 transitions, 4605 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:10,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:10,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:51:10,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:11,989 INFO L124 PetriNetUnfolderBase]: 3172/5228 cut-off events. [2024-06-27 19:51:11,989 INFO L125 PetriNetUnfolderBase]: For 505526/505526 co-relation queries the response was YES. [2024-06-27 19:51:12,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42890 conditions, 5228 events. 3172/5228 cut-off events. For 505526/505526 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 32740 event pairs, 1185 based on Foata normal form. 3/5230 useless extension candidates. Maximal degree in co-relation 42762. Up to 4683 conditions per place. [2024-06-27 19:51:12,159 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 366 selfloop transitions, 37 changer transitions 0/426 dead transitions. [2024-06-27 19:51:12,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 426 transitions, 5753 flow [2024-06-27 19:51:12,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:51:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:51:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 19:51:12,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-27 19:51:12,160 INFO L175 Difference]: Start difference. First operand has 269 places, 402 transitions, 4605 flow. Second operand 8 states and 151 transitions. [2024-06-27 19:51:12,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 426 transitions, 5753 flow [2024-06-27 19:51:12,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 426 transitions, 5672 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-27 19:51:12,960 INFO L231 Difference]: Finished difference. Result has 272 places, 409 transitions, 4754 flow [2024-06-27 19:51:12,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4524, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4754, PETRI_PLACES=272, PETRI_TRANSITIONS=409} [2024-06-27 19:51:12,960 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 229 predicate places. [2024-06-27 19:51:12,960 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 409 transitions, 4754 flow [2024-06-27 19:51:12,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:12,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:12,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:12,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 19:51:12,961 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:12,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1891909630, now seen corresponding path program 3 times [2024-06-27 19:51:12,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:12,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349531598] [2024-06-27 19:51:12,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:12,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:13,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:13,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349531598] [2024-06-27 19:51:13,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349531598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:13,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:13,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527428087] [2024-06-27 19:51:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:13,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:13,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:13,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:13,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:13,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:51:13,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 409 transitions, 4754 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:13,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:13,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:51:13,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:14,835 INFO L124 PetriNetUnfolderBase]: 3160/5222 cut-off events. [2024-06-27 19:51:14,835 INFO L125 PetriNetUnfolderBase]: For 513735/513735 co-relation queries the response was YES. [2024-06-27 19:51:14,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43362 conditions, 5222 events. 3160/5222 cut-off events. For 513735/513735 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 32846 event pairs, 1183 based on Foata normal form. 4/5225 useless extension candidates. Maximal degree in co-relation 43232. Up to 4714 conditions per place. [2024-06-27 19:51:14,901 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 381 selfloop transitions, 24 changer transitions 0/428 dead transitions. [2024-06-27 19:51:14,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 428 transitions, 5709 flow [2024-06-27 19:51:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:51:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:51:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 19:51:14,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 19:51:14,903 INFO L175 Difference]: Start difference. First operand has 272 places, 409 transitions, 4754 flow. Second operand 8 states and 148 transitions. [2024-06-27 19:51:14,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 428 transitions, 5709 flow [2024-06-27 19:51:15,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 428 transitions, 5626 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-27 19:51:15,786 INFO L231 Difference]: Finished difference. Result has 276 places, 413 transitions, 4815 flow [2024-06-27 19:51:15,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4679, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4815, PETRI_PLACES=276, PETRI_TRANSITIONS=413} [2024-06-27 19:51:15,787 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 233 predicate places. [2024-06-27 19:51:15,787 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 413 transitions, 4815 flow [2024-06-27 19:51:15,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:15,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:15,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:15,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 19:51:15,788 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:15,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash 930986512, now seen corresponding path program 4 times [2024-06-27 19:51:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:15,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062599704] [2024-06-27 19:51:15,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:15,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:16,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062599704] [2024-06-27 19:51:16,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062599704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:16,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:16,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209246085] [2024-06-27 19:51:16,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:16,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:16,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:16,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:16,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:16,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:51:16,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 413 transitions, 4815 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:16,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:16,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:51:16,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:17,686 INFO L124 PetriNetUnfolderBase]: 3185/5260 cut-off events. [2024-06-27 19:51:17,686 INFO L125 PetriNetUnfolderBase]: For 530368/530370 co-relation queries the response was YES. [2024-06-27 19:51:17,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43921 conditions, 5260 events. 3185/5260 cut-off events. For 530368/530370 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 33113 event pairs, 1192 based on Foata normal form. 6/5265 useless extension candidates. Maximal degree in co-relation 43789. Up to 4729 conditions per place. [2024-06-27 19:51:17,754 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 376 selfloop transitions, 31 changer transitions 0/430 dead transitions. [2024-06-27 19:51:17,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 430 transitions, 5777 flow [2024-06-27 19:51:17,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:51:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:51:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 19:51:17,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 19:51:17,756 INFO L175 Difference]: Start difference. First operand has 276 places, 413 transitions, 4815 flow. Second operand 8 states and 148 transitions. [2024-06-27 19:51:17,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 430 transitions, 5777 flow [2024-06-27 19:51:18,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 430 transitions, 5678 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-27 19:51:18,665 INFO L231 Difference]: Finished difference. Result has 278 places, 417 transitions, 4871 flow [2024-06-27 19:51:18,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4716, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4871, PETRI_PLACES=278, PETRI_TRANSITIONS=417} [2024-06-27 19:51:18,666 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 235 predicate places. [2024-06-27 19:51:18,666 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 417 transitions, 4871 flow [2024-06-27 19:51:18,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:18,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:18,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:18,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 19:51:18,667 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:18,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash 219386224, now seen corresponding path program 5 times [2024-06-27 19:51:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:18,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667599594] [2024-06-27 19:51:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:18,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:19,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:19,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667599594] [2024-06-27 19:51:19,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667599594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:19,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:19,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:19,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689669999] [2024-06-27 19:51:19,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:19,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:19,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:19,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:19,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:19,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:51:19,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 417 transitions, 4871 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:19,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:19,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:51:19,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:20,717 INFO L124 PetriNetUnfolderBase]: 3200/5281 cut-off events. [2024-06-27 19:51:20,717 INFO L125 PetriNetUnfolderBase]: For 538231/538233 co-relation queries the response was YES. [2024-06-27 19:51:20,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44795 conditions, 5281 events. 3200/5281 cut-off events. For 538231/538233 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 33239 event pairs, 1192 based on Foata normal form. 3/5283 useless extension candidates. Maximal degree in co-relation 44662. Up to 4731 conditions per place. [2024-06-27 19:51:20,785 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 373 selfloop transitions, 38 changer transitions 0/434 dead transitions. [2024-06-27 19:51:20,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 434 transitions, 5849 flow [2024-06-27 19:51:20,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:51:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:51:20,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 19:51:20,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-27 19:51:20,787 INFO L175 Difference]: Start difference. First operand has 278 places, 417 transitions, 4871 flow. Second operand 8 states and 151 transitions. [2024-06-27 19:51:20,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 434 transitions, 5849 flow [2024-06-27 19:51:21,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 434 transitions, 5726 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-27 19:51:21,862 INFO L231 Difference]: Finished difference. Result has 280 places, 420 transitions, 4903 flow [2024-06-27 19:51:21,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4748, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4903, PETRI_PLACES=280, PETRI_TRANSITIONS=420} [2024-06-27 19:51:21,862 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 237 predicate places. [2024-06-27 19:51:21,862 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 420 transitions, 4903 flow [2024-06-27 19:51:21,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:21,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:21,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:21,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 19:51:21,863 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:21,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:21,863 INFO L85 PathProgramCache]: Analyzing trace with hash 153924330, now seen corresponding path program 6 times [2024-06-27 19:51:21,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:21,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032723577] [2024-06-27 19:51:21,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:21,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:22,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:22,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032723577] [2024-06-27 19:51:22,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032723577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:22,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:22,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928801487] [2024-06-27 19:51:22,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:22,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:22,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:22,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:22,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:22,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:51:22,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 420 transitions, 4903 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:22,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:22,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:51:22,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:23,746 INFO L124 PetriNetUnfolderBase]: 3191/5269 cut-off events. [2024-06-27 19:51:23,747 INFO L125 PetriNetUnfolderBase]: For 541472/541474 co-relation queries the response was YES. [2024-06-27 19:51:23,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44801 conditions, 5269 events. 3191/5269 cut-off events. For 541472/541474 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 33162 event pairs, 1190 based on Foata normal form. 3/5271 useless extension candidates. Maximal degree in co-relation 44667. Up to 4648 conditions per place. [2024-06-27 19:51:23,815 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 347 selfloop transitions, 68 changer transitions 0/438 dead transitions. [2024-06-27 19:51:23,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 438 transitions, 6053 flow [2024-06-27 19:51:23,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:51:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:51:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 19:51:23,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 19:51:23,830 INFO L175 Difference]: Start difference. First operand has 280 places, 420 transitions, 4903 flow. Second operand 8 states and 152 transitions. [2024-06-27 19:51:23,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 438 transitions, 6053 flow [2024-06-27 19:51:24,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 438 transitions, 5926 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-27 19:51:24,997 INFO L231 Difference]: Finished difference. Result has 282 places, 423 transitions, 4997 flow [2024-06-27 19:51:24,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4776, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4997, PETRI_PLACES=282, PETRI_TRANSITIONS=423} [2024-06-27 19:51:24,998 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 239 predicate places. [2024-06-27 19:51:24,998 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 423 transitions, 4997 flow [2024-06-27 19:51:24,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:24,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:24,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:24,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 19:51:24,998 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:24,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash 227968264, now seen corresponding path program 1 times [2024-06-27 19:51:24,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:24,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713835362] [2024-06-27 19:51:24,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:24,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:26,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-06-27 19:51:26,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:26,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713835362] [2024-06-27 19:51:26,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713835362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:26,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:26,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:51:26,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909952481] [2024-06-27 19:51:26,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:26,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:51:26,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:26,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:51:26,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:51:26,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:51:26,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 423 transitions, 4997 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:26,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:26,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:51:26,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:27,667 INFO L124 PetriNetUnfolderBase]: 3195/5224 cut-off events. [2024-06-27 19:51:27,667 INFO L125 PetriNetUnfolderBase]: For 558267/558292 co-relation queries the response was YES. [2024-06-27 19:51:27,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44822 conditions, 5224 events. 3195/5224 cut-off events. For 558267/558292 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 32710 event pairs, 1182 based on Foata normal form. 26/5208 useless extension candidates. Maximal degree in co-relation 44687. Up to 4710 conditions per place. [2024-06-27 19:51:27,733 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 367 selfloop transitions, 20 changer transitions 0/437 dead transitions. [2024-06-27 19:51:27,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 437 transitions, 5889 flow [2024-06-27 19:51:27,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:51:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:51:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 19:51:27,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41005291005291006 [2024-06-27 19:51:27,735 INFO L175 Difference]: Start difference. First operand has 282 places, 423 transitions, 4997 flow. Second operand 9 states and 155 transitions. [2024-06-27 19:51:27,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 437 transitions, 5889 flow [2024-06-27 19:51:28,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 437 transitions, 5696 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-27 19:51:28,668 INFO L231 Difference]: Finished difference. Result has 285 places, 425 transitions, 4941 flow [2024-06-27 19:51:28,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4804, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4941, PETRI_PLACES=285, PETRI_TRANSITIONS=425} [2024-06-27 19:51:28,669 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 242 predicate places. [2024-06-27 19:51:28,669 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 425 transitions, 4941 flow [2024-06-27 19:51:28,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:28,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:28,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:28,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 19:51:28,669 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:28,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:28,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1742892412, now seen corresponding path program 1 times [2024-06-27 19:51:28,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:28,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132188645] [2024-06-27 19:51:28,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:28,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:29,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-06-27 19:51:29,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132188645] [2024-06-27 19:51:29,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132188645] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:29,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:29,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:29,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027290378] [2024-06-27 19:51:29,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:29,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:29,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:29,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:29,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:29,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:51:29,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 425 transitions, 4941 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:29,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:29,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:51:29,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:30,494 INFO L124 PetriNetUnfolderBase]: 3361/5477 cut-off events. [2024-06-27 19:51:30,495 INFO L125 PetriNetUnfolderBase]: For 566588/566592 co-relation queries the response was YES. [2024-06-27 19:51:30,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46365 conditions, 5477 events. 3361/5477 cut-off events. For 566588/566592 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 33982 event pairs, 789 based on Foata normal form. 8/5484 useless extension candidates. Maximal degree in co-relation 46229. Up to 4948 conditions per place. [2024-06-27 19:51:30,566 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 410 selfloop transitions, 52 changer transitions 0/467 dead transitions. [2024-06-27 19:51:30,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 467 transitions, 6141 flow [2024-06-27 19:51:30,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:51:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:51:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-27 19:51:30,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-27 19:51:30,568 INFO L175 Difference]: Start difference. First operand has 285 places, 425 transitions, 4941 flow. Second operand 9 states and 174 transitions. [2024-06-27 19:51:30,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 467 transitions, 6141 flow [2024-06-27 19:51:31,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 467 transitions, 6020 flow, removed 42 selfloop flow, removed 7 redundant places. [2024-06-27 19:51:31,693 INFO L231 Difference]: Finished difference. Result has 289 places, 437 transitions, 5156 flow [2024-06-27 19:51:31,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4820, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5156, PETRI_PLACES=289, PETRI_TRANSITIONS=437} [2024-06-27 19:51:31,694 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 246 predicate places. [2024-06-27 19:51:31,694 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 437 transitions, 5156 flow [2024-06-27 19:51:31,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:31,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:31,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:31,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 19:51:31,695 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:31,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:31,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1397555992, now seen corresponding path program 2 times [2024-06-27 19:51:31,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:31,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940206093] [2024-06-27 19:51:31,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:31,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:32,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-06-27 19:51:32,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:32,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940206093] [2024-06-27 19:51:32,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940206093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:32,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:32,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:32,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848702067] [2024-06-27 19:51:32,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:32,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:32,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:32,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:32,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:32,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:51:32,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 437 transitions, 5156 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:32,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:32,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:51:32,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:33,460 INFO L124 PetriNetUnfolderBase]: 3387/5515 cut-off events. [2024-06-27 19:51:33,461 INFO L125 PetriNetUnfolderBase]: For 579949/579953 co-relation queries the response was YES. [2024-06-27 19:51:33,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47458 conditions, 5515 events. 3387/5515 cut-off events. For 579949/579953 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 34203 event pairs, 812 based on Foata normal form. 8/5522 useless extension candidates. Maximal degree in co-relation 47319. Up to 5016 conditions per place. [2024-06-27 19:51:33,538 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 411 selfloop transitions, 53 changer transitions 0/469 dead transitions. [2024-06-27 19:51:33,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 469 transitions, 6311 flow [2024-06-27 19:51:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:51:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:51:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-27 19:51:33,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2024-06-27 19:51:33,541 INFO L175 Difference]: Start difference. First operand has 289 places, 437 transitions, 5156 flow. Second operand 9 states and 170 transitions. [2024-06-27 19:51:33,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 469 transitions, 6311 flow [2024-06-27 19:51:34,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 469 transitions, 6123 flow, removed 49 selfloop flow, removed 5 redundant places. [2024-06-27 19:51:34,540 INFO L231 Difference]: Finished difference. Result has 294 places, 444 transitions, 5248 flow [2024-06-27 19:51:34,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4968, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5248, PETRI_PLACES=294, PETRI_TRANSITIONS=444} [2024-06-27 19:51:34,540 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 251 predicate places. [2024-06-27 19:51:34,541 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 444 transitions, 5248 flow [2024-06-27 19:51:34,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:34,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:34,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:34,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 19:51:34,545 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:34,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:34,545 INFO L85 PathProgramCache]: Analyzing trace with hash -600640360, now seen corresponding path program 3 times [2024-06-27 19:51:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:34,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220061413] [2024-06-27 19:51:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:35,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:35,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220061413] [2024-06-27 19:51:35,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220061413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:35,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:35,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:35,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563365071] [2024-06-27 19:51:35,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:35,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:35,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:35,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:35,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:51:35,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 444 transitions, 5248 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:35,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:35,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:51:35,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:36,534 INFO L124 PetriNetUnfolderBase]: 3451/5594 cut-off events. [2024-06-27 19:51:36,534 INFO L125 PetriNetUnfolderBase]: For 596449/596453 co-relation queries the response was YES. [2024-06-27 19:51:36,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48212 conditions, 5594 events. 3451/5594 cut-off events. For 596449/596453 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 34518 event pairs, 643 based on Foata normal form. 8/5601 useless extension candidates. Maximal degree in co-relation 48071. Up to 4989 conditions per place. [2024-06-27 19:51:36,612 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 419 selfloop transitions, 61 changer transitions 0/485 dead transitions. [2024-06-27 19:51:36,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 485 transitions, 6469 flow [2024-06-27 19:51:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:51:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:51:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-27 19:51:36,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576719576719577 [2024-06-27 19:51:36,613 INFO L175 Difference]: Start difference. First operand has 294 places, 444 transitions, 5248 flow. Second operand 9 states and 173 transitions. [2024-06-27 19:51:36,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 485 transitions, 6469 flow [2024-06-27 19:51:37,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 485 transitions, 6272 flow, removed 50 selfloop flow, removed 6 redundant places. [2024-06-27 19:51:37,729 INFO L231 Difference]: Finished difference. Result has 298 places, 455 transitions, 5372 flow [2024-06-27 19:51:37,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5051, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5372, PETRI_PLACES=298, PETRI_TRANSITIONS=455} [2024-06-27 19:51:37,730 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 255 predicate places. [2024-06-27 19:51:37,730 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 455 transitions, 5372 flow [2024-06-27 19:51:37,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:37,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:37,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:37,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 19:51:37,731 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:37,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:37,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1397567896, now seen corresponding path program 1 times [2024-06-27 19:51:37,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:37,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481264034] [2024-06-27 19:51:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:37,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:38,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-06-27 19:51:38,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:38,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481264034] [2024-06-27 19:51:38,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481264034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:38,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:38,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:51:38,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338034546] [2024-06-27 19:51:38,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:38,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:51:38,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:51:38,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:51:38,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:51:38,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 455 transitions, 5372 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:38,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:38,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:51:38,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:39,800 INFO L124 PetriNetUnfolderBase]: 3481/5661 cut-off events. [2024-06-27 19:51:39,800 INFO L125 PetriNetUnfolderBase]: For 610001/610005 co-relation queries the response was YES. [2024-06-27 19:51:39,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49114 conditions, 5661 events. 3481/5661 cut-off events. For 610001/610005 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 35241 event pairs, 826 based on Foata normal form. 8/5668 useless extension candidates. Maximal degree in co-relation 48971. Up to 5152 conditions per place. [2024-06-27 19:51:39,867 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 426 selfloop transitions, 58 changer transitions 0/489 dead transitions. [2024-06-27 19:51:39,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 489 transitions, 6594 flow [2024-06-27 19:51:39,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:51:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:51:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-27 19:51:39,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-27 19:51:39,868 INFO L175 Difference]: Start difference. First operand has 298 places, 455 transitions, 5372 flow. Second operand 10 states and 186 transitions. [2024-06-27 19:51:39,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 489 transitions, 6594 flow [2024-06-27 19:51:41,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 489 transitions, 6371 flow, removed 54 selfloop flow, removed 7 redundant places. [2024-06-27 19:51:41,245 INFO L231 Difference]: Finished difference. Result has 302 places, 463 transitions, 5447 flow [2024-06-27 19:51:41,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5149, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5447, PETRI_PLACES=302, PETRI_TRANSITIONS=463} [2024-06-27 19:51:41,246 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 259 predicate places. [2024-06-27 19:51:41,246 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 463 transitions, 5447 flow [2024-06-27 19:51:41,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:41,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:41,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:41,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 19:51:41,247 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:41,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1910623792, now seen corresponding path program 4 times [2024-06-27 19:51:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:41,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387219510] [2024-06-27 19:51:41,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:41,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:41,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387219510] [2024-06-27 19:51:41,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387219510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:41,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:41,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:41,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949978373] [2024-06-27 19:51:41,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:41,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:41,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:41,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:41,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:42,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:51:42,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 463 transitions, 5447 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:42,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:42,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:51:42,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:43,252 INFO L124 PetriNetUnfolderBase]: 3622/5884 cut-off events. [2024-06-27 19:51:43,253 INFO L125 PetriNetUnfolderBase]: For 625778/625782 co-relation queries the response was YES. [2024-06-27 19:51:43,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50684 conditions, 5884 events. 3622/5884 cut-off events. For 625778/625782 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 36891 event pairs, 737 based on Foata normal form. 8/5891 useless extension candidates. Maximal degree in co-relation 50540. Up to 5264 conditions per place. [2024-06-27 19:51:43,331 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 444 selfloop transitions, 66 changer transitions 0/515 dead transitions. [2024-06-27 19:51:43,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 515 transitions, 6884 flow [2024-06-27 19:51:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:51:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:51:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-27 19:51:43,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576719576719577 [2024-06-27 19:51:43,333 INFO L175 Difference]: Start difference. First operand has 302 places, 463 transitions, 5447 flow. Second operand 9 states and 173 transitions. [2024-06-27 19:51:43,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 515 transitions, 6884 flow [2024-06-27 19:51:44,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 515 transitions, 6662 flow, removed 52 selfloop flow, removed 7 redundant places. [2024-06-27 19:51:44,537 INFO L231 Difference]: Finished difference. Result has 307 places, 487 transitions, 5788 flow [2024-06-27 19:51:44,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5237, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5788, PETRI_PLACES=307, PETRI_TRANSITIONS=487} [2024-06-27 19:51:44,537 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 264 predicate places. [2024-06-27 19:51:44,538 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 487 transitions, 5788 flow [2024-06-27 19:51:44,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:44,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:44,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:44,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 19:51:44,538 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:44,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:44,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2125120276, now seen corresponding path program 5 times [2024-06-27 19:51:44,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:44,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237208991] [2024-06-27 19:51:44,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:44,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:45,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:45,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237208991] [2024-06-27 19:51:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237208991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:45,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:45,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:45,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089680398] [2024-06-27 19:51:45,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:45,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:45,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:45,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:45,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:45,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:51:45,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 487 transitions, 5788 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:45,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:45,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:51:45,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:46,479 INFO L124 PetriNetUnfolderBase]: 3664/5946 cut-off events. [2024-06-27 19:51:46,479 INFO L125 PetriNetUnfolderBase]: For 642784/642788 co-relation queries the response was YES. [2024-06-27 19:51:46,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51762 conditions, 5946 events. 3664/5946 cut-off events. For 642784/642788 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 37315 event pairs, 761 based on Foata normal form. 8/5953 useless extension candidates. Maximal degree in co-relation 51614. Up to 5412 conditions per place. [2024-06-27 19:51:46,561 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 454 selfloop transitions, 62 changer transitions 0/521 dead transitions. [2024-06-27 19:51:46,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 521 transitions, 7097 flow [2024-06-27 19:51:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:51:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:51:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 19:51:46,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470899470899471 [2024-06-27 19:51:46,562 INFO L175 Difference]: Start difference. First operand has 307 places, 487 transitions, 5788 flow. Second operand 9 states and 169 transitions. [2024-06-27 19:51:46,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 521 transitions, 7097 flow [2024-06-27 19:51:48,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 521 transitions, 6898 flow, removed 52 selfloop flow, removed 5 redundant places. [2024-06-27 19:51:48,198 INFO L231 Difference]: Finished difference. Result has 312 places, 498 transitions, 5958 flow [2024-06-27 19:51:48,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5589, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5958, PETRI_PLACES=312, PETRI_TRANSITIONS=498} [2024-06-27 19:51:48,199 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 269 predicate places. [2024-06-27 19:51:48,199 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 498 transitions, 5958 flow [2024-06-27 19:51:48,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:48,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:48,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:48,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 19:51:48,200 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:48,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1854360330, now seen corresponding path program 6 times [2024-06-27 19:51:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016800549] [2024-06-27 19:51:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:48,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:48,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:48,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016800549] [2024-06-27 19:51:48,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016800549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:48,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:48,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:48,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808283311] [2024-06-27 19:51:48,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:48,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:48,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:48,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:48,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:48,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:51:48,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 498 transitions, 5958 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:48,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:48,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:51:48,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:50,203 INFO L124 PetriNetUnfolderBase]: 3680/5967 cut-off events. [2024-06-27 19:51:50,203 INFO L125 PetriNetUnfolderBase]: For 658814/658816 co-relation queries the response was YES. [2024-06-27 19:51:50,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52320 conditions, 5967 events. 3680/5967 cut-off events. For 658814/658816 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 37418 event pairs, 762 based on Foata normal form. 6/5972 useless extension candidates. Maximal degree in co-relation 52170. Up to 5397 conditions per place. [2024-06-27 19:51:50,285 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 444 selfloop transitions, 72 changer transitions 0/521 dead transitions. [2024-06-27 19:51:50,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 521 transitions, 7188 flow [2024-06-27 19:51:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:51:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:51:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 19:51:50,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-27 19:51:50,286 INFO L175 Difference]: Start difference. First operand has 312 places, 498 transitions, 5958 flow. Second operand 9 states and 166 transitions. [2024-06-27 19:51:50,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 521 transitions, 7188 flow [2024-06-27 19:51:51,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 521 transitions, 6966 flow, removed 58 selfloop flow, removed 6 redundant places. [2024-06-27 19:51:51,529 INFO L231 Difference]: Finished difference. Result has 315 places, 501 transitions, 6026 flow [2024-06-27 19:51:51,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5736, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6026, PETRI_PLACES=315, PETRI_TRANSITIONS=501} [2024-06-27 19:51:51,530 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 272 predicate places. [2024-06-27 19:51:51,530 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 501 transitions, 6026 flow [2024-06-27 19:51:51,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:51,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:51,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:51,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 19:51:51,530 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:51,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:51,531 INFO L85 PathProgramCache]: Analyzing trace with hash 361927952, now seen corresponding path program 1 times [2024-06-27 19:51:51,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:51,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341008091] [2024-06-27 19:51:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:51,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:52,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:52,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341008091] [2024-06-27 19:51:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341008091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:52,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:52,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644347341] [2024-06-27 19:51:52,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:52,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:52,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:52,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:52,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:52,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:51:52,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 501 transitions, 6026 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:52,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:52,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:51:52,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:53,585 INFO L124 PetriNetUnfolderBase]: 3700/5994 cut-off events. [2024-06-27 19:51:53,585 INFO L125 PetriNetUnfolderBase]: For 672346/672348 co-relation queries the response was YES. [2024-06-27 19:51:53,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52800 conditions, 5994 events. 3700/5994 cut-off events. For 672346/672348 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 37646 event pairs, 746 based on Foata normal form. 4/5997 useless extension candidates. Maximal degree in co-relation 52649. Up to 5335 conditions per place. [2024-06-27 19:51:53,665 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 455 selfloop transitions, 88 changer transitions 0/548 dead transitions. [2024-06-27 19:51:53,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 548 transitions, 7496 flow [2024-06-27 19:51:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:51:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:51:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 19:51:53,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 19:51:53,666 INFO L175 Difference]: Start difference. First operand has 315 places, 501 transitions, 6026 flow. Second operand 9 states and 175 transitions. [2024-06-27 19:51:53,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 548 transitions, 7496 flow [2024-06-27 19:51:54,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 548 transitions, 7228 flow, removed 64 selfloop flow, removed 7 redundant places. [2024-06-27 19:51:54,733 INFO L231 Difference]: Finished difference. Result has 319 places, 519 transitions, 6282 flow [2024-06-27 19:51:54,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5758, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6282, PETRI_PLACES=319, PETRI_TRANSITIONS=519} [2024-06-27 19:51:54,733 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 276 predicate places. [2024-06-27 19:51:54,733 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 519 transitions, 6282 flow [2024-06-27 19:51:54,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:54,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:54,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:54,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 19:51:54,734 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:54,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2060890638, now seen corresponding path program 2 times [2024-06-27 19:51:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:54,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431965930] [2024-06-27 19:51:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:55,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:55,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431965930] [2024-06-27 19:51:55,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431965930] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:55,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:55,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:55,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626958681] [2024-06-27 19:51:55,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:55,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:55,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:55,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:55,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:55,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:51:55,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 519 transitions, 6282 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:55,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:55,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:51:55,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:51:56,739 INFO L124 PetriNetUnfolderBase]: 3730/6039 cut-off events. [2024-06-27 19:51:56,739 INFO L125 PetriNetUnfolderBase]: For 692842/692844 co-relation queries the response was YES. [2024-06-27 19:51:56,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54478 conditions, 6039 events. 3730/6039 cut-off events. For 692842/692844 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 37947 event pairs, 747 based on Foata normal form. 4/6042 useless extension candidates. Maximal degree in co-relation 54324. Up to 5359 conditions per place. [2024-06-27 19:51:56,825 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 454 selfloop transitions, 95 changer transitions 0/554 dead transitions. [2024-06-27 19:51:56,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 554 transitions, 7705 flow [2024-06-27 19:51:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:51:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:51:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 19:51:56,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 19:51:56,827 INFO L175 Difference]: Start difference. First operand has 319 places, 519 transitions, 6282 flow. Second operand 9 states and 175 transitions. [2024-06-27 19:51:56,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 554 transitions, 7705 flow [2024-06-27 19:51:58,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 554 transitions, 7491 flow, removed 63 selfloop flow, removed 4 redundant places. [2024-06-27 19:51:58,253 INFO L231 Difference]: Finished difference. Result has 325 places, 527 transitions, 6459 flow [2024-06-27 19:51:58,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6068, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6459, PETRI_PLACES=325, PETRI_TRANSITIONS=527} [2024-06-27 19:51:58,254 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 282 predicate places. [2024-06-27 19:51:58,254 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 527 transitions, 6459 flow [2024-06-27 19:51:58,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:58,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:51:58,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:51:58,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 19:51:58,255 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:51:58,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:51:58,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2060890421, now seen corresponding path program 1 times [2024-06-27 19:51:58,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:51:58,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385694307] [2024-06-27 19:51:58,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:51:58,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:51:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:51:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:51:58,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:51:58,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385694307] [2024-06-27 19:51:58,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385694307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:51:58,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:51:58,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:51:58,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196790190] [2024-06-27 19:51:58,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:51:58,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:51:58,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:51:58,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:51:58,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:51:59,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:51:59,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 527 transitions, 6459 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:51:59,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:51:59,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:51:59,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:00,405 INFO L124 PetriNetUnfolderBase]: 3740/6053 cut-off events. [2024-06-27 19:52:00,405 INFO L125 PetriNetUnfolderBase]: For 705958/705960 co-relation queries the response was YES. [2024-06-27 19:52:00,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55179 conditions, 6053 events. 3740/6053 cut-off events. For 705958/705960 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 37992 event pairs, 738 based on Foata normal form. 4/6056 useless extension candidates. Maximal degree in co-relation 55023. Up to 5544 conditions per place. [2024-06-27 19:52:00,493 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 493 selfloop transitions, 55 changer transitions 0/553 dead transitions. [2024-06-27 19:52:00,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 553 transitions, 7713 flow [2024-06-27 19:52:00,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:52:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:52:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 19:52:00,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 19:52:00,495 INFO L175 Difference]: Start difference. First operand has 325 places, 527 transitions, 6459 flow. Second operand 9 states and 168 transitions. [2024-06-27 19:52:00,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 553 transitions, 7713 flow [2024-06-27 19:52:01,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 553 transitions, 7430 flow, removed 54 selfloop flow, removed 6 redundant places. [2024-06-27 19:52:01,949 INFO L231 Difference]: Finished difference. Result has 328 places, 531 transitions, 6383 flow [2024-06-27 19:52:01,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6176, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6383, PETRI_PLACES=328, PETRI_TRANSITIONS=531} [2024-06-27 19:52:01,949 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 285 predicate places. [2024-06-27 19:52:01,950 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 531 transitions, 6383 flow [2024-06-27 19:52:01,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:01,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:01,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:01,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 19:52:01,950 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:01,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1831282140, now seen corresponding path program 3 times [2024-06-27 19:52:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:01,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389701871] [2024-06-27 19:52:01,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:01,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:52:02,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:02,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389701871] [2024-06-27 19:52:02,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389701871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:02,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:02,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:52:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460925951] [2024-06-27 19:52:02,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:02,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:52:02,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:02,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:52:02,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:52:02,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:52:02,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 531 transitions, 6383 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:02,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:02,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:52:02,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:03,946 INFO L124 PetriNetUnfolderBase]: 3792/6130 cut-off events. [2024-06-27 19:52:03,947 INFO L125 PetriNetUnfolderBase]: For 745971/745973 co-relation queries the response was YES. [2024-06-27 19:52:04,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56354 conditions, 6130 events. 3792/6130 cut-off events. For 745971/745973 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 38552 event pairs, 757 based on Foata normal form. 4/6133 useless extension candidates. Maximal degree in co-relation 56197. Up to 5310 conditions per place. [2024-06-27 19:52:04,041 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 445 selfloop transitions, 114 changer transitions 0/564 dead transitions. [2024-06-27 19:52:04,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 564 transitions, 8084 flow [2024-06-27 19:52:04,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:52:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:52:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-27 19:52:04,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576719576719577 [2024-06-27 19:52:04,043 INFO L175 Difference]: Start difference. First operand has 328 places, 531 transitions, 6383 flow. Second operand 9 states and 173 transitions. [2024-06-27 19:52:04,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 564 transitions, 8084 flow [2024-06-27 19:52:05,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 564 transitions, 7949 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-27 19:52:05,870 INFO L231 Difference]: Finished difference. Result has 331 places, 538 transitions, 6705 flow [2024-06-27 19:52:05,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6248, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6705, PETRI_PLACES=331, PETRI_TRANSITIONS=538} [2024-06-27 19:52:05,870 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 288 predicate places. [2024-06-27 19:52:05,870 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 538 transitions, 6705 flow [2024-06-27 19:52:05,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:05,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:05,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:05,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 19:52:05,871 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:05,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1856615565, now seen corresponding path program 2 times [2024-06-27 19:52:05,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:05,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340148681] [2024-06-27 19:52:05,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:05,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:52:06,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:06,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340148681] [2024-06-27 19:52:06,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340148681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:06,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:06,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:52:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64654717] [2024-06-27 19:52:06,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:06,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:52:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:06,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:52:06,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:52:06,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:52:06,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 538 transitions, 6705 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:06,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:06,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:52:06,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:08,003 INFO L124 PetriNetUnfolderBase]: 3802/6151 cut-off events. [2024-06-27 19:52:08,004 INFO L125 PetriNetUnfolderBase]: For 761728/761730 co-relation queries the response was YES. [2024-06-27 19:52:08,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57462 conditions, 6151 events. 3802/6151 cut-off events. For 761728/761730 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 38662 event pairs, 747 based on Foata normal form. 4/6154 useless extension candidates. Maximal degree in co-relation 57304. Up to 5569 conditions per place. [2024-06-27 19:52:08,101 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 479 selfloop transitions, 77 changer transitions 0/561 dead transitions. [2024-06-27 19:52:08,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 561 transitions, 7969 flow [2024-06-27 19:52:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:52:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:52:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 19:52:08,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-27 19:52:08,102 INFO L175 Difference]: Start difference. First operand has 331 places, 538 transitions, 6705 flow. Second operand 9 states and 166 transitions. [2024-06-27 19:52:08,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 561 transitions, 7969 flow [2024-06-27 19:52:09,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 561 transitions, 7760 flow, removed 61 selfloop flow, removed 4 redundant places. [2024-06-27 19:52:09,859 INFO L231 Difference]: Finished difference. Result has 336 places, 542 transitions, 6755 flow [2024-06-27 19:52:09,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6496, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6755, PETRI_PLACES=336, PETRI_TRANSITIONS=542} [2024-06-27 19:52:09,860 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 293 predicate places. [2024-06-27 19:52:09,860 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 542 transitions, 6755 flow [2024-06-27 19:52:09,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:09,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:09,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:09,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 19:52:09,861 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:09,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:09,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1587602227, now seen corresponding path program 3 times [2024-06-27 19:52:09,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:09,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706538640] [2024-06-27 19:52:09,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:52:10,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:10,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706538640] [2024-06-27 19:52:10,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706538640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:10,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:10,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:52:10,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535262084] [2024-06-27 19:52:10,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:10,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:52:10,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:10,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:52:10,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:52:10,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:52:10,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 542 transitions, 6755 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:10,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:10,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:52:10,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:12,035 INFO L124 PetriNetUnfolderBase]: 3850/6212 cut-off events. [2024-06-27 19:52:12,036 INFO L125 PetriNetUnfolderBase]: For 782594/782596 co-relation queries the response was YES. [2024-06-27 19:52:12,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58368 conditions, 6212 events. 3850/6212 cut-off events. For 782594/782596 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 39040 event pairs, 743 based on Foata normal form. 4/6215 useless extension candidates. Maximal degree in co-relation 58208. Up to 5563 conditions per place. [2024-06-27 19:52:12,126 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 474 selfloop transitions, 99 changer transitions 0/578 dead transitions. [2024-06-27 19:52:12,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 578 transitions, 8415 flow [2024-06-27 19:52:12,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:52:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:52:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 19:52:12,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 19:52:12,127 INFO L175 Difference]: Start difference. First operand has 336 places, 542 transitions, 6755 flow. Second operand 9 states and 168 transitions. [2024-06-27 19:52:12,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 578 transitions, 8415 flow [2024-06-27 19:52:13,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 578 transitions, 8243 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-27 19:52:13,667 INFO L231 Difference]: Finished difference. Result has 340 places, 557 transitions, 7093 flow [2024-06-27 19:52:13,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6583, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7093, PETRI_PLACES=340, PETRI_TRANSITIONS=557} [2024-06-27 19:52:13,667 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 297 predicate places. [2024-06-27 19:52:13,667 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 557 transitions, 7093 flow [2024-06-27 19:52:13,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:13,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:13,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:13,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 19:52:13,668 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:13,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash -673002900, now seen corresponding path program 2 times [2024-06-27 19:52:13,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:13,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339838444] [2024-06-27 19:52:13,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:52:14,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:14,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339838444] [2024-06-27 19:52:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339838444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:14,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:14,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:52:14,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555637763] [2024-06-27 19:52:14,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:14,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:52:14,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:14,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:52:14,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:52:14,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:52:14,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 557 transitions, 7093 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:14,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:14,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:52:14,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:16,026 INFO L124 PetriNetUnfolderBase]: 3900/6285 cut-off events. [2024-06-27 19:52:16,027 INFO L125 PetriNetUnfolderBase]: For 808209/808213 co-relation queries the response was YES. [2024-06-27 19:52:16,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59363 conditions, 6285 events. 3900/6285 cut-off events. For 808209/808213 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 39513 event pairs, 744 based on Foata normal form. 8/6292 useless extension candidates. Maximal degree in co-relation 59201. Up to 5731 conditions per place. [2024-06-27 19:52:16,115 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 516 selfloop transitions, 72 changer transitions 0/593 dead transitions. [2024-06-27 19:52:16,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 593 transitions, 8586 flow [2024-06-27 19:52:16,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:52:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:52:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-27 19:52:16,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 19:52:16,118 INFO L175 Difference]: Start difference. First operand has 340 places, 557 transitions, 7093 flow. Second operand 10 states and 185 transitions. [2024-06-27 19:52:16,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 593 transitions, 8586 flow [2024-06-27 19:52:17,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 593 transitions, 8427 flow, removed 38 selfloop flow, removed 5 redundant places. [2024-06-27 19:52:17,920 INFO L231 Difference]: Finished difference. Result has 346 places, 569 transitions, 7351 flow [2024-06-27 19:52:17,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6934, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7351, PETRI_PLACES=346, PETRI_TRANSITIONS=569} [2024-06-27 19:52:17,921 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 303 predicate places. [2024-06-27 19:52:17,921 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 569 transitions, 7351 flow [2024-06-27 19:52:17,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:17,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:17,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:17,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 19:52:17,921 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:17,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1856727010, now seen corresponding path program 3 times [2024-06-27 19:52:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:17,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801497702] [2024-06-27 19:52:17,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:17,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:52:18,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:18,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801497702] [2024-06-27 19:52:18,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801497702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:18,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:18,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:52:18,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655817008] [2024-06-27 19:52:18,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:18,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:52:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:18,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:52:18,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:52:18,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:52:18,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 569 transitions, 7351 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:18,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:18,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:52:18,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:20,384 INFO L124 PetriNetUnfolderBase]: 3920/6310 cut-off events. [2024-06-27 19:52:20,384 INFO L125 PetriNetUnfolderBase]: For 828713/828715 co-relation queries the response was YES. [2024-06-27 19:52:20,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60582 conditions, 6310 events. 3920/6310 cut-off events. For 828713/828715 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 39590 event pairs, 743 based on Foata normal form. 6/6315 useless extension candidates. Maximal degree in co-relation 60417. Up to 5722 conditions per place. [2024-06-27 19:52:20,472 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 508 selfloop transitions, 81 changer transitions 0/594 dead transitions. [2024-06-27 19:52:20,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 594 transitions, 8763 flow [2024-06-27 19:52:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:52:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:52:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-27 19:52:20,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-27 19:52:20,473 INFO L175 Difference]: Start difference. First operand has 346 places, 569 transitions, 7351 flow. Second operand 10 states and 182 transitions. [2024-06-27 19:52:20,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 594 transitions, 8763 flow [2024-06-27 19:52:21,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 594 transitions, 8517 flow, removed 61 selfloop flow, removed 7 redundant places. [2024-06-27 19:52:21,842 INFO L231 Difference]: Finished difference. Result has 349 places, 573 transitions, 7436 flow [2024-06-27 19:52:21,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7105, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7436, PETRI_PLACES=349, PETRI_TRANSITIONS=573} [2024-06-27 19:52:21,842 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 306 predicate places. [2024-06-27 19:52:21,843 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 573 transitions, 7436 flow [2024-06-27 19:52:21,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:21,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:21,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:21,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 19:52:21,843 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:21,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:21,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1856352220, now seen corresponding path program 4 times [2024-06-27 19:52:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:21,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907261141] [2024-06-27 19:52:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:21,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:52:22,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907261141] [2024-06-27 19:52:22,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907261141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:22,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:22,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:52:22,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129048530] [2024-06-27 19:52:22,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:22,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:52:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:22,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:52:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:52:22,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:52:22,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 573 transitions, 7436 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:22,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:22,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:52:22,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:24,236 INFO L124 PetriNetUnfolderBase]: 4016/6454 cut-off events. [2024-06-27 19:52:24,236 INFO L125 PetriNetUnfolderBase]: For 891819/891821 co-relation queries the response was YES. [2024-06-27 19:52:24,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63783 conditions, 6454 events. 4016/6454 cut-off events. For 891819/891821 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 40615 event pairs, 741 based on Foata normal form. 6/6459 useless extension candidates. Maximal degree in co-relation 63617. Up to 5624 conditions per place. [2024-06-27 19:52:24,330 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 489 selfloop transitions, 120 changer transitions 0/614 dead transitions. [2024-06-27 19:52:24,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 614 transitions, 9734 flow [2024-06-27 19:52:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:52:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:52:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-27 19:52:24,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 19:52:24,332 INFO L175 Difference]: Start difference. First operand has 349 places, 573 transitions, 7436 flow. Second operand 10 states and 189 transitions. [2024-06-27 19:52:24,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 614 transitions, 9734 flow [2024-06-27 19:52:26,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 614 transitions, 9439 flow, removed 69 selfloop flow, removed 8 redundant places. [2024-06-27 19:52:26,172 INFO L231 Difference]: Finished difference. Result has 352 places, 588 transitions, 8001 flow [2024-06-27 19:52:26,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7141, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8001, PETRI_PLACES=352, PETRI_TRANSITIONS=588} [2024-06-27 19:52:26,172 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 309 predicate places. [2024-06-27 19:52:26,172 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 588 transitions, 8001 flow [2024-06-27 19:52:26,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:26,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:26,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:26,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 19:52:26,173 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:26,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:26,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1853960151, now seen corresponding path program 1 times [2024-06-27 19:52:26,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:26,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220833276] [2024-06-27 19:52:26,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:26,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:52:27,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:27,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220833276] [2024-06-27 19:52:27,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220833276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:27,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:27,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:52:27,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835204184] [2024-06-27 19:52:27,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:27,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:52:27,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:27,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:52:27,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:52:27,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:52:27,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 588 transitions, 8001 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:27,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:27,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:52:27,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:28,862 INFO L124 PetriNetUnfolderBase]: 3872/6277 cut-off events. [2024-06-27 19:52:28,862 INFO L125 PetriNetUnfolderBase]: For 904345/904354 co-relation queries the response was YES. [2024-06-27 19:52:28,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62938 conditions, 6277 events. 3872/6277 cut-off events. For 904345/904354 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 40244 event pairs, 1025 based on Foata normal form. 10/6252 useless extension candidates. Maximal degree in co-relation 62770. Up to 5590 conditions per place. [2024-06-27 19:52:28,957 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 486 selfloop transitions, 39 changer transitions 0/609 dead transitions. [2024-06-27 19:52:28,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 609 transitions, 9161 flow [2024-06-27 19:52:28,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:52:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:52:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-27 19:52:28,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 19:52:28,958 INFO L175 Difference]: Start difference. First operand has 352 places, 588 transitions, 8001 flow. Second operand 10 states and 180 transitions. [2024-06-27 19:52:28,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 609 transitions, 9161 flow [2024-06-27 19:52:30,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 609 transitions, 8872 flow, removed 103 selfloop flow, removed 5 redundant places. [2024-06-27 19:52:30,948 INFO L231 Difference]: Finished difference. Result has 357 places, 589 transitions, 7845 flow [2024-06-27 19:52:30,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7712, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7845, PETRI_PLACES=357, PETRI_TRANSITIONS=589} [2024-06-27 19:52:30,948 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 314 predicate places. [2024-06-27 19:52:30,948 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 589 transitions, 7845 flow [2024-06-27 19:52:30,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:30,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:30,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:30,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 19:52:30,949 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:30,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:30,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1856339200, now seen corresponding path program 5 times [2024-06-27 19:52:30,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:30,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774195019] [2024-06-27 19:52:30,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:30,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:31,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-06-27 19:52:31,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:31,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774195019] [2024-06-27 19:52:31,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774195019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:31,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:31,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:52:31,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623207350] [2024-06-27 19:52:31,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:31,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:52:31,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:31,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:52:31,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:52:31,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:52:31,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 589 transitions, 7845 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:31,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:31,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:52:31,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:33,405 INFO L124 PetriNetUnfolderBase]: 4005/6439 cut-off events. [2024-06-27 19:52:33,405 INFO L125 PetriNetUnfolderBase]: For 896802/896804 co-relation queries the response was YES. [2024-06-27 19:52:33,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63495 conditions, 6439 events. 4005/6439 cut-off events. For 896802/896804 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 40508 event pairs, 744 based on Foata normal form. 6/6444 useless extension candidates. Maximal degree in co-relation 63325. Up to 5620 conditions per place. [2024-06-27 19:52:33,499 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 486 selfloop transitions, 122 changer transitions 0/613 dead transitions. [2024-06-27 19:52:33,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 613 transitions, 9545 flow [2024-06-27 19:52:33,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:52:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:52:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-27 19:52:33,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4452380952380952 [2024-06-27 19:52:33,501 INFO L175 Difference]: Start difference. First operand has 357 places, 589 transitions, 7845 flow. Second operand 10 states and 187 transitions. [2024-06-27 19:52:33,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 613 transitions, 9545 flow [2024-06-27 19:52:35,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 613 transitions, 9286 flow, removed 93 selfloop flow, removed 8 redundant places. [2024-06-27 19:52:35,717 INFO L231 Difference]: Finished difference. Result has 359 places, 589 transitions, 7840 flow [2024-06-27 19:52:35,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7586, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7840, PETRI_PLACES=359, PETRI_TRANSITIONS=589} [2024-06-27 19:52:35,718 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 316 predicate places. [2024-06-27 19:52:35,732 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 589 transitions, 7840 flow [2024-06-27 19:52:35,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:35,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:35,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:35,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 19:52:35,733 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:35,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1741837616, now seen corresponding path program 7 times [2024-06-27 19:52:35,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:35,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962903780] [2024-06-27 19:52:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:35,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:52:36,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:36,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962903780] [2024-06-27 19:52:36,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962903780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:36,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:36,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:52:36,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128718557] [2024-06-27 19:52:36,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:36,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:52:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:36,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:52:36,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:52:36,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:52:36,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 589 transitions, 7840 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:36,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:36,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:52:36,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:38,150 INFO L124 PetriNetUnfolderBase]: 4021/6466 cut-off events. [2024-06-27 19:52:38,150 INFO L125 PetriNetUnfolderBase]: For 922104/922108 co-relation queries the response was YES. [2024-06-27 19:52:38,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64161 conditions, 6466 events. 4021/6466 cut-off events. For 922104/922108 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 40608 event pairs, 657 based on Foata normal form. 8/6473 useless extension candidates. Maximal degree in co-relation 63990. Up to 5662 conditions per place. [2024-06-27 19:52:38,243 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 523 selfloop transitions, 89 changer transitions 0/617 dead transitions. [2024-06-27 19:52:38,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 617 transitions, 9310 flow [2024-06-27 19:52:38,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:52:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:52:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-27 19:52:38,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 19:52:38,245 INFO L175 Difference]: Start difference. First operand has 359 places, 589 transitions, 7840 flow. Second operand 8 states and 154 transitions. [2024-06-27 19:52:38,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 617 transitions, 9310 flow [2024-06-27 19:52:40,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 617 transitions, 9095 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-27 19:52:40,242 INFO L231 Difference]: Finished difference. Result has 360 places, 592 transitions, 7996 flow [2024-06-27 19:52:40,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7625, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7996, PETRI_PLACES=360, PETRI_TRANSITIONS=592} [2024-06-27 19:52:40,243 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 317 predicate places. [2024-06-27 19:52:40,243 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 592 transitions, 7996 flow [2024-06-27 19:52:40,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:40,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:40,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:40,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 19:52:40,244 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:40,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash 274333634, now seen corresponding path program 8 times [2024-06-27 19:52:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:40,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889597083] [2024-06-27 19:52:40,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:52:40,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:40,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889597083] [2024-06-27 19:52:40,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889597083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:40,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:40,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:52:40,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627635424] [2024-06-27 19:52:40,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:40,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:52:40,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:40,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:52:40,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:52:41,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:52:41,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 592 transitions, 7996 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:41,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:41,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:52:41,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:42,988 INFO L124 PetriNetUnfolderBase]: 4037/6490 cut-off events. [2024-06-27 19:52:42,988 INFO L125 PetriNetUnfolderBase]: For 945537/945541 co-relation queries the response was YES. [2024-06-27 19:52:43,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65063 conditions, 6490 events. 4037/6490 cut-off events. For 945537/945541 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 40907 event pairs, 846 based on Foata normal form. 8/6497 useless extension candidates. Maximal degree in co-relation 64891. Up to 5902 conditions per place. [2024-06-27 19:52:43,083 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 534 selfloop transitions, 77 changer transitions 0/616 dead transitions. [2024-06-27 19:52:43,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 616 transitions, 9454 flow [2024-06-27 19:52:43,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:52:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:52:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 19:52:43,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-27 19:52:43,087 INFO L175 Difference]: Start difference. First operand has 360 places, 592 transitions, 7996 flow. Second operand 8 states and 151 transitions. [2024-06-27 19:52:43,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 616 transitions, 9454 flow [2024-06-27 19:52:45,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 616 transitions, 9169 flow, removed 67 selfloop flow, removed 6 redundant places. [2024-06-27 19:52:45,496 INFO L231 Difference]: Finished difference. Result has 362 places, 595 transitions, 8053 flow [2024-06-27 19:52:45,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7711, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8053, PETRI_PLACES=362, PETRI_TRANSITIONS=595} [2024-06-27 19:52:45,497 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 319 predicate places. [2024-06-27 19:52:45,497 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 595 transitions, 8053 flow [2024-06-27 19:52:45,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:45,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:45,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:45,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 19:52:45,497 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:45,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1416827726, now seen corresponding path program 9 times [2024-06-27 19:52:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:45,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592924729] [2024-06-27 19:52:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:45,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:52:46,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:46,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592924729] [2024-06-27 19:52:46,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592924729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:46,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:46,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:52:46,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405489481] [2024-06-27 19:52:46,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:46,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:52:46,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:46,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:52:46,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:52:46,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:52:46,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 595 transitions, 8053 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:46,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:46,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:52:46,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:47,898 INFO L124 PetriNetUnfolderBase]: 4053/6511 cut-off events. [2024-06-27 19:52:47,898 INFO L125 PetriNetUnfolderBase]: For 964981/964983 co-relation queries the response was YES. [2024-06-27 19:52:47,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65521 conditions, 6511 events. 4053/6511 cut-off events. For 964981/964983 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 41016 event pairs, 751 based on Foata normal form. 6/6516 useless extension candidates. Maximal degree in co-relation 65348. Up to 5871 conditions per place. [2024-06-27 19:52:47,988 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 515 selfloop transitions, 94 changer transitions 0/614 dead transitions. [2024-06-27 19:52:47,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 614 transitions, 9493 flow [2024-06-27 19:52:47,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:52:47,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:52:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 19:52:47,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2024-06-27 19:52:47,989 INFO L175 Difference]: Start difference. First operand has 362 places, 595 transitions, 8053 flow. Second operand 8 states and 146 transitions. [2024-06-27 19:52:47,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 614 transitions, 9493 flow [2024-06-27 19:52:49,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 614 transitions, 9209 flow, removed 73 selfloop flow, removed 6 redundant places. [2024-06-27 19:52:49,966 INFO L231 Difference]: Finished difference. Result has 364 places, 598 transitions, 8143 flow [2024-06-27 19:52:49,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7769, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8143, PETRI_PLACES=364, PETRI_TRANSITIONS=598} [2024-06-27 19:52:49,967 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 321 predicate places. [2024-06-27 19:52:49,967 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 598 transitions, 8143 flow [2024-06-27 19:52:49,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:49,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:49,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:49,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 19:52:49,968 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:49,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1623363614, now seen corresponding path program 4 times [2024-06-27 19:52:49,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:49,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061130801] [2024-06-27 19:52:49,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:49,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:52:50,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:50,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061130801] [2024-06-27 19:52:50,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061130801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:50,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:50,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:52:50,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294299063] [2024-06-27 19:52:50,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:50,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:52:50,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:50,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:52:50,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:52:50,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:52:50,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 598 transitions, 8143 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:50,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:50,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:52:50,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:52,576 INFO L124 PetriNetUnfolderBase]: 4093/6571 cut-off events. [2024-06-27 19:52:52,576 INFO L125 PetriNetUnfolderBase]: For 1004682/1004684 co-relation queries the response was YES. [2024-06-27 19:52:52,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66492 conditions, 6571 events. 4093/6571 cut-off events. For 1004682/1004684 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 41498 event pairs, 759 based on Foata normal form. 8/6578 useless extension candidates. Maximal degree in co-relation 66318. Up to 5865 conditions per place. [2024-06-27 19:52:52,670 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 528 selfloop transitions, 96 changer transitions 0/629 dead transitions. [2024-06-27 19:52:52,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 629 transitions, 9760 flow [2024-06-27 19:52:52,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:52:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:52:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-27 19:52:52,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 19:52:52,671 INFO L175 Difference]: Start difference. First operand has 364 places, 598 transitions, 8143 flow. Second operand 8 states and 154 transitions. [2024-06-27 19:52:52,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 629 transitions, 9760 flow [2024-06-27 19:52:55,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 629 transitions, 9422 flow, removed 79 selfloop flow, removed 6 redundant places. [2024-06-27 19:52:55,023 INFO L231 Difference]: Finished difference. Result has 366 places, 605 transitions, 8263 flow [2024-06-27 19:52:55,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7805, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8263, PETRI_PLACES=366, PETRI_TRANSITIONS=605} [2024-06-27 19:52:55,024 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 323 predicate places. [2024-06-27 19:52:55,024 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 605 transitions, 8263 flow [2024-06-27 19:52:55,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:55,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:52:55,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:52:55,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 19:52:55,025 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:52:55,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:52:55,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1623358034, now seen corresponding path program 5 times [2024-06-27 19:52:55,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:52:55,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419965380] [2024-06-27 19:52:55,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:52:55,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:52:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:52:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:52:55,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:52:55,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419965380] [2024-06-27 19:52:55,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419965380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:52:55,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:52:55,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:52:55,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164158980] [2024-06-27 19:52:55,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:52:55,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:52:55,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:52:55,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:52:55,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:52:55,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:52:55,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 605 transitions, 8263 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:52:55,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:52:55,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:52:55,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:52:57,582 INFO L124 PetriNetUnfolderBase]: 4133/6635 cut-off events. [2024-06-27 19:52:57,582 INFO L125 PetriNetUnfolderBase]: For 1031502/1031504 co-relation queries the response was YES. [2024-06-27 19:52:57,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67989 conditions, 6635 events. 4133/6635 cut-off events. For 1031502/1031504 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 41945 event pairs, 755 based on Foata normal form. 8/6642 useless extension candidates. Maximal degree in co-relation 67814. Up to 5867 conditions per place. [2024-06-27 19:52:57,679 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 513 selfloop transitions, 116 changer transitions 0/634 dead transitions. [2024-06-27 19:52:57,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 634 transitions, 9914 flow [2024-06-27 19:52:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:52:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:52:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-27 19:52:57,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 19:52:57,680 INFO L175 Difference]: Start difference. First operand has 366 places, 605 transitions, 8263 flow. Second operand 8 states and 154 transitions. [2024-06-27 19:52:57,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 634 transitions, 9914 flow [2024-06-27 19:53:00,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 634 transitions, 9613 flow, removed 92 selfloop flow, removed 5 redundant places. [2024-06-27 19:53:00,170 INFO L231 Difference]: Finished difference. Result has 369 places, 612 transitions, 8474 flow [2024-06-27 19:53:00,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7962, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8474, PETRI_PLACES=369, PETRI_TRANSITIONS=612} [2024-06-27 19:53:00,184 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 326 predicate places. [2024-06-27 19:53:00,184 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 612 transitions, 8474 flow [2024-06-27 19:53:00,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:00,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:53:00,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:53:00,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-27 19:53:00,185 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:53:00,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:53:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash 535736427, now seen corresponding path program 4 times [2024-06-27 19:53:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:53:00,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726525245] [2024-06-27 19:53:00,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:53:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:53:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:53:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:53:01,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:53:01,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726525245] [2024-06-27 19:53:01,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726525245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:53:01,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:53:01,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:53:01,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056337143] [2024-06-27 19:53:01,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:53:01,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:53:01,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:53:01,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:53:01,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:53:01,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:53:01,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 612 transitions, 8474 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:01,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:53:01,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:53:01,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:53:02,935 INFO L124 PetriNetUnfolderBase]: 4145/6651 cut-off events. [2024-06-27 19:53:02,935 INFO L125 PetriNetUnfolderBase]: For 1027753/1027755 co-relation queries the response was YES. [2024-06-27 19:53:03,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68488 conditions, 6651 events. 4145/6651 cut-off events. For 1027753/1027755 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 42035 event pairs, 748 based on Foata normal form. 6/6656 useless extension candidates. Maximal degree in co-relation 68312. Up to 6091 conditions per place. [2024-06-27 19:53:03,044 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 563 selfloop transitions, 70 changer transitions 0/638 dead transitions. [2024-06-27 19:53:03,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 638 transitions, 10026 flow [2024-06-27 19:53:03,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:53:03,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:53:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 19:53:03,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 19:53:03,045 INFO L175 Difference]: Start difference. First operand has 369 places, 612 transitions, 8474 flow. Second operand 8 states and 148 transitions. [2024-06-27 19:53:03,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 638 transitions, 10026 flow [2024-06-27 19:53:05,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 638 transitions, 9610 flow, removed 99 selfloop flow, removed 6 redundant places. [2024-06-27 19:53:05,802 INFO L231 Difference]: Finished difference. Result has 371 places, 619 transitions, 8432 flow [2024-06-27 19:53:05,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8058, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8432, PETRI_PLACES=371, PETRI_TRANSITIONS=619} [2024-06-27 19:53:05,803 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 328 predicate places. [2024-06-27 19:53:05,803 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 619 transitions, 8432 flow [2024-06-27 19:53:05,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:05,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:53:05,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:53:05,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-27 19:53:05,804 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:53:05,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:53:05,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1375780789, now seen corresponding path program 5 times [2024-06-27 19:53:05,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:53:05,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16038693] [2024-06-27 19:53:05,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:53:05,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:53:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:53:06,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-06-27 19:53:06,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:53:06,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16038693] [2024-06-27 19:53:06,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16038693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:53:06,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:53:06,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:53:06,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053163471] [2024-06-27 19:53:06,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:53:06,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:53:06,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:53:06,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:53:06,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:53:06,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:53:06,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 619 transitions, 8432 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:06,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:53:06,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:53:06,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:53:08,342 INFO L124 PetriNetUnfolderBase]: 4155/6670 cut-off events. [2024-06-27 19:53:08,343 INFO L125 PetriNetUnfolderBase]: For 1026833/1026835 co-relation queries the response was YES. [2024-06-27 19:53:08,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68069 conditions, 6670 events. 4155/6670 cut-off events. For 1026833/1026835 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 42232 event pairs, 751 based on Foata normal form. 4/6673 useless extension candidates. Maximal degree in co-relation 67892. Up to 5901 conditions per place. [2024-06-27 19:53:08,439 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 495 selfloop transitions, 139 changer transitions 0/639 dead transitions. [2024-06-27 19:53:08,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 639 transitions, 10074 flow [2024-06-27 19:53:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:53:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:53:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 19:53:08,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 19:53:08,440 INFO L175 Difference]: Start difference. First operand has 371 places, 619 transitions, 8432 flow. Second operand 8 states and 148 transitions. [2024-06-27 19:53:08,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 639 transitions, 10074 flow [2024-06-27 19:53:10,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 639 transitions, 9799 flow, removed 75 selfloop flow, removed 6 redundant places. [2024-06-27 19:53:10,686 INFO L231 Difference]: Finished difference. Result has 373 places, 623 transitions, 8576 flow [2024-06-27 19:53:10,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8167, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8576, PETRI_PLACES=373, PETRI_TRANSITIONS=623} [2024-06-27 19:53:10,687 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 330 predicate places. [2024-06-27 19:53:10,687 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 623 transitions, 8576 flow [2024-06-27 19:53:10,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:10,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:53:10,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:53:10,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-27 19:53:10,687 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:53:10,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:53:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash 589943673, now seen corresponding path program 6 times [2024-06-27 19:53:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:53:10,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748711846] [2024-06-27 19:53:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:53:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:53:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:53:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:53:11,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:53:11,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748711846] [2024-06-27 19:53:11,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748711846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:53:11,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:53:11,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:53:11,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399508706] [2024-06-27 19:53:11,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:53:11,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:53:11,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:53:11,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:53:11,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:53:11,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:53:11,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 623 transitions, 8576 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:11,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:53:11,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:53:11,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:53:13,172 INFO L124 PetriNetUnfolderBase]: 4157/6673 cut-off events. [2024-06-27 19:53:13,173 INFO L125 PetriNetUnfolderBase]: For 1022177/1022179 co-relation queries the response was YES. [2024-06-27 19:53:13,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68053 conditions, 6673 events. 4157/6673 cut-off events. For 1022177/1022179 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 42183 event pairs, 749 based on Foata normal form. 4/6676 useless extension candidates. Maximal degree in co-relation 67875. Up to 6029 conditions per place. [2024-06-27 19:53:13,279 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 541 selfloop transitions, 95 changer transitions 0/641 dead transitions. [2024-06-27 19:53:13,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 641 transitions, 9992 flow [2024-06-27 19:53:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:53:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:53:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 19:53:13,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2024-06-27 19:53:13,280 INFO L175 Difference]: Start difference. First operand has 373 places, 623 transitions, 8576 flow. Second operand 8 states and 146 transitions. [2024-06-27 19:53:13,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 641 transitions, 9992 flow [2024-06-27 19:53:15,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 641 transitions, 9736 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-27 19:53:15,803 INFO L231 Difference]: Finished difference. Result has 376 places, 626 transitions, 8622 flow [2024-06-27 19:53:15,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8322, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8622, PETRI_PLACES=376, PETRI_TRANSITIONS=626} [2024-06-27 19:53:15,803 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 333 predicate places. [2024-06-27 19:53:15,804 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 626 transitions, 8622 flow [2024-06-27 19:53:15,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:15,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:53:15,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:53:15,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-27 19:53:15,804 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:53:15,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:53:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash 589943456, now seen corresponding path program 6 times [2024-06-27 19:53:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:53:15,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638450996] [2024-06-27 19:53:15,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:53:15,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:53:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:53:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:53:16,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:53:16,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638450996] [2024-06-27 19:53:16,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638450996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:53:16,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:53:16,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:53:16,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035569295] [2024-06-27 19:53:16,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:53:16,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:53:16,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:53:16,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:53:16,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:53:16,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:53:16,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 626 transitions, 8622 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:16,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:53:16,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:53:16,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:53:18,156 INFO L124 PetriNetUnfolderBase]: 4209/6759 cut-off events. [2024-06-27 19:53:18,156 INFO L125 PetriNetUnfolderBase]: For 1078120/1078122 co-relation queries the response was YES. [2024-06-27 19:53:18,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69821 conditions, 6759 events. 4209/6759 cut-off events. For 1078120/1078122 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 42840 event pairs, 772 based on Foata normal form. 4/6762 useless extension candidates. Maximal degree in co-relation 69642. Up to 5752 conditions per place. [2024-06-27 19:53:18,267 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 505 selfloop transitions, 142 changer transitions 0/652 dead transitions. [2024-06-27 19:53:18,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 652 transitions, 10560 flow [2024-06-27 19:53:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:53:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:53:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 19:53:18,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 19:53:18,269 INFO L175 Difference]: Start difference. First operand has 376 places, 626 transitions, 8622 flow. Second operand 8 states and 152 transitions. [2024-06-27 19:53:18,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 652 transitions, 10560 flow [2024-06-27 19:53:20,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 652 transitions, 10316 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-27 19:53:20,833 INFO L231 Difference]: Finished difference. Result has 378 places, 633 transitions, 8964 flow [2024-06-27 19:53:20,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8378, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8964, PETRI_PLACES=378, PETRI_TRANSITIONS=633} [2024-06-27 19:53:20,834 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 335 predicate places. [2024-06-27 19:53:20,834 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 633 transitions, 8964 flow [2024-06-27 19:53:20,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:20,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:53:20,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:53:20,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-27 19:53:20,835 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:53:20,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:53:20,835 INFO L85 PathProgramCache]: Analyzing trace with hash 274345538, now seen corresponding path program 6 times [2024-06-27 19:53:20,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:53:20,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767113552] [2024-06-27 19:53:20,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:53:20,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:53:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:53:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:53:21,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:53:21,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767113552] [2024-06-27 19:53:21,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767113552] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:53:21,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:53:21,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:53:21,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804534991] [2024-06-27 19:53:21,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:53:21,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:53:21,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:53:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:53:21,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:53:21,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:53:21,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 633 transitions, 8964 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:21,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:53:21,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:53:21,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:53:23,406 INFO L124 PetriNetUnfolderBase]: 4219/6782 cut-off events. [2024-06-27 19:53:23,406 INFO L125 PetriNetUnfolderBase]: For 1089261/1089265 co-relation queries the response was YES. [2024-06-27 19:53:23,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71052 conditions, 6782 events. 4219/6782 cut-off events. For 1089261/1089265 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 43081 event pairs, 846 based on Foata normal form. 6/6787 useless extension candidates. Maximal degree in co-relation 70872. Up to 6158 conditions per place. [2024-06-27 19:53:23,521 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 568 selfloop transitions, 94 changer transitions 0/667 dead transitions. [2024-06-27 19:53:23,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 667 transitions, 10640 flow [2024-06-27 19:53:23,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:53:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:53:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 19:53:23,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-27 19:53:23,522 INFO L175 Difference]: Start difference. First operand has 378 places, 633 transitions, 8964 flow. Second operand 9 states and 166 transitions. [2024-06-27 19:53:23,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 667 transitions, 10640 flow [2024-06-27 19:53:26,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 667 transitions, 10388 flow, removed 80 selfloop flow, removed 4 redundant places. [2024-06-27 19:53:26,361 INFO L231 Difference]: Finished difference. Result has 383 places, 646 transitions, 9225 flow [2024-06-27 19:53:26,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8714, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9225, PETRI_PLACES=383, PETRI_TRANSITIONS=646} [2024-06-27 19:53:26,364 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 340 predicate places. [2024-06-27 19:53:26,364 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 646 transitions, 9225 flow [2024-06-27 19:53:26,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:26,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:53:26,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:53:26,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-27 19:53:26,365 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:53:26,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:53:26,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2117683918, now seen corresponding path program 7 times [2024-06-27 19:53:26,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:53:26,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082614959] [2024-06-27 19:53:26,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:53:26,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:53:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:53:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:53:27,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:53:27,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082614959] [2024-06-27 19:53:27,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082614959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:53:27,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:53:27,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:53:27,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527090713] [2024-06-27 19:53:27,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:53:27,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:53:27,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:53:27,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:53:27,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:53:27,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:53:27,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 646 transitions, 9225 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:27,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:53:27,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:53:27,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:53:29,019 INFO L124 PetriNetUnfolderBase]: 4229/6785 cut-off events. [2024-06-27 19:53:29,020 INFO L125 PetriNetUnfolderBase]: For 1099967/1099969 co-relation queries the response was YES. [2024-06-27 19:53:29,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71416 conditions, 6785 events. 4229/6785 cut-off events. For 1099967/1099969 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 42965 event pairs, 751 based on Foata normal form. 4/6788 useless extension candidates. Maximal degree in co-relation 71234. Up to 6117 conditions per place. [2024-06-27 19:53:29,132 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 561 selfloop transitions, 103 changer transitions 0/669 dead transitions. [2024-06-27 19:53:29,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 669 transitions, 10817 flow [2024-06-27 19:53:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:53:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:53:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-27 19:53:29,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-27 19:53:29,133 INFO L175 Difference]: Start difference. First operand has 383 places, 646 transitions, 9225 flow. Second operand 9 states and 161 transitions. [2024-06-27 19:53:29,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 669 transitions, 10817 flow [2024-06-27 19:53:32,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 669 transitions, 10472 flow, removed 87 selfloop flow, removed 7 redundant places. [2024-06-27 19:53:32,410 INFO L231 Difference]: Finished difference. Result has 385 places, 653 transitions, 9323 flow [2024-06-27 19:53:32,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8880, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9323, PETRI_PLACES=385, PETRI_TRANSITIONS=653} [2024-06-27 19:53:32,411 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 342 predicate places. [2024-06-27 19:53:32,411 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 653 transitions, 9323 flow [2024-06-27 19:53:32,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:32,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:53:32,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:53:32,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-27 19:53:32,412 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:53:32,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:53:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash 590220038, now seen corresponding path program 8 times [2024-06-27 19:53:32,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:53:32,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508523066] [2024-06-27 19:53:32,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:53:32,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:53:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:53:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:53:33,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:53:33,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508523066] [2024-06-27 19:53:33,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508523066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:53:33,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:53:33,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:53:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673288611] [2024-06-27 19:53:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:53:33,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:53:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:53:33,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:53:33,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:53:33,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:53:33,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 653 transitions, 9323 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:33,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:53:33,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:53:33,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:53:35,267 INFO L124 PetriNetUnfolderBase]: 4311/6904 cut-off events. [2024-06-27 19:53:35,268 INFO L125 PetriNetUnfolderBase]: For 1190840/1190842 co-relation queries the response was YES. [2024-06-27 19:53:35,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74671 conditions, 6904 events. 4311/6904 cut-off events. For 1190840/1190842 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 43848 event pairs, 753 based on Foata normal form. 6/6909 useless extension candidates. Maximal degree in co-relation 74488. Up to 5851 conditions per place. [2024-06-27 19:53:35,399 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 502 selfloop transitions, 178 changer transitions 0/685 dead transitions. [2024-06-27 19:53:35,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 685 transitions, 11753 flow [2024-06-27 19:53:35,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:53:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:53:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 19:53:35,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417989417989418 [2024-06-27 19:53:35,401 INFO L175 Difference]: Start difference. First operand has 385 places, 653 transitions, 9323 flow. Second operand 9 states and 167 transitions. [2024-06-27 19:53:35,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 685 transitions, 11753 flow [2024-06-27 19:53:38,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 685 transitions, 11360 flow, removed 98 selfloop flow, removed 7 redundant places. [2024-06-27 19:53:38,592 INFO L231 Difference]: Finished difference. Result has 388 places, 663 transitions, 9799 flow [2024-06-27 19:53:38,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8930, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9799, PETRI_PLACES=388, PETRI_TRANSITIONS=663} [2024-06-27 19:53:38,593 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 345 predicate places. [2024-06-27 19:53:38,593 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 663 transitions, 9799 flow [2024-06-27 19:53:38,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:38,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:53:38,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:53:38,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-27 19:53:38,594 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:53:38,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:53:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1416427547, now seen corresponding path program 2 times [2024-06-27 19:53:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:53:38,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458925398] [2024-06-27 19:53:38,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:53:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:53:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:53:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:53:39,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:53:39,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458925398] [2024-06-27 19:53:39,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458925398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:53:39,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:53:39,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:53:39,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110597986] [2024-06-27 19:53:39,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:53:39,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:53:39,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:53:39,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:53:39,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:53:39,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:53:39,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 663 transitions, 9799 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:39,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:53:39,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:53:39,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:53:41,386 INFO L124 PetriNetUnfolderBase]: 4157/6722 cut-off events. [2024-06-27 19:53:41,386 INFO L125 PetriNetUnfolderBase]: For 1205718/1205727 co-relation queries the response was YES. [2024-06-27 19:53:41,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73787 conditions, 6722 events. 4157/6722 cut-off events. For 1205718/1205727 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 43486 event pairs, 1041 based on Foata normal form. 10/6691 useless extension candidates. Maximal degree in co-relation 73602. Up to 5943 conditions per place. [2024-06-27 19:53:41,514 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 532 selfloop transitions, 49 changer transitions 0/680 dead transitions. [2024-06-27 19:53:41,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 680 transitions, 11061 flow [2024-06-27 19:53:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:53:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:53:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-27 19:53:41,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-27 19:53:41,516 INFO L175 Difference]: Start difference. First operand has 388 places, 663 transitions, 9799 flow. Second operand 9 states and 161 transitions. [2024-06-27 19:53:41,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 680 transitions, 11061 flow [2024-06-27 19:53:44,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 680 transitions, 10681 flow, removed 106 selfloop flow, removed 6 redundant places. [2024-06-27 19:53:44,414 INFO L231 Difference]: Finished difference. Result has 391 places, 664 transitions, 9578 flow [2024-06-27 19:53:44,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9419, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9578, PETRI_PLACES=391, PETRI_TRANSITIONS=664} [2024-06-27 19:53:44,414 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 348 predicate places. [2024-06-27 19:53:44,415 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 664 transitions, 9578 flow [2024-06-27 19:53:44,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:44,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:53:44,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:53:44,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-27 19:53:44,415 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:53:44,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:53:44,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1416441032, now seen corresponding path program 9 times [2024-06-27 19:53:44,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:53:44,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427166498] [2024-06-27 19:53:44,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:53:44,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:53:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:53:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:53:45,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:53:45,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427166498] [2024-06-27 19:53:45,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427166498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:53:45,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:53:45,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:53:45,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921157385] [2024-06-27 19:53:45,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:53:45,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:53:45,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:53:45,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:53:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:53:45,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:53:45,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 664 transitions, 9578 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:45,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:53:45,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:53:45,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:53:47,111 INFO L124 PetriNetUnfolderBase]: 4322/6917 cut-off events. [2024-06-27 19:53:47,111 INFO L125 PetriNetUnfolderBase]: For 1198993/1198995 co-relation queries the response was YES. [2024-06-27 19:53:47,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75087 conditions, 6917 events. 4322/6917 cut-off events. For 1198993/1198995 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 43824 event pairs, 755 based on Foata normal form. 6/6922 useless extension candidates. Maximal degree in co-relation 74901. Up to 5866 conditions per place. [2024-06-27 19:53:47,235 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 505 selfloop transitions, 179 changer transitions 0/689 dead transitions. [2024-06-27 19:53:47,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 689 transitions, 11543 flow [2024-06-27 19:53:47,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:53:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:53:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 19:53:47,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 19:53:47,236 INFO L175 Difference]: Start difference. First operand has 391 places, 664 transitions, 9578 flow. Second operand 9 states and 168 transitions. [2024-06-27 19:53:47,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 689 transitions, 11543 flow [2024-06-27 19:53:50,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 689 transitions, 11376 flow, removed 39 selfloop flow, removed 7 redundant places. [2024-06-27 19:53:50,024 INFO L231 Difference]: Finished difference. Result has 393 places, 668 transitions, 9970 flow [2024-06-27 19:53:50,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9413, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9970, PETRI_PLACES=393, PETRI_TRANSITIONS=668} [2024-06-27 19:53:50,025 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 350 predicate places. [2024-06-27 19:53:50,025 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 668 transitions, 9970 flow [2024-06-27 19:53:50,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:50,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:53:50,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:53:50,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-27 19:53:50,026 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:53:50,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:53:50,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1966668622, now seen corresponding path program 10 times [2024-06-27 19:53:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:53:50,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269265812] [2024-06-27 19:53:50,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:53:50,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:53:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:53:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:53:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:53:50,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269265812] [2024-06-27 19:53:50,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269265812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:53:50,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:53:50,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:53:50,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413365892] [2024-06-27 19:53:50,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:53:50,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:53:50,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:53:50,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:53:50,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:53:50,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:53:50,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 668 transitions, 9970 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:50,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:53:50,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:53:50,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:53:52,571 INFO L124 PetriNetUnfolderBase]: 4325/6933 cut-off events. [2024-06-27 19:53:52,572 INFO L125 PetriNetUnfolderBase]: For 1197828/1197830 co-relation queries the response was YES. [2024-06-27 19:53:52,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75576 conditions, 6933 events. 4325/6933 cut-off events. For 1197828/1197830 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 44009 event pairs, 782 based on Foata normal form. 6/6936 useless extension candidates. Maximal degree in co-relation 75389. Up to 6230 conditions per place. [2024-06-27 19:53:52,695 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 577 selfloop transitions, 100 changer transitions 0/682 dead transitions. [2024-06-27 19:53:52,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 682 transitions, 11550 flow [2024-06-27 19:53:52,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:53:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:53:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 19:53:52,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-27 19:53:52,696 INFO L175 Difference]: Start difference. First operand has 393 places, 668 transitions, 9970 flow. Second operand 8 states and 143 transitions. [2024-06-27 19:53:52,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 682 transitions, 11550 flow [2024-06-27 19:53:55,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 682 transitions, 11156 flow, removed 71 selfloop flow, removed 7 redundant places. [2024-06-27 19:53:55,806 INFO L231 Difference]: Finished difference. Result has 394 places, 671 transitions, 9982 flow [2024-06-27 19:53:55,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9576, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9982, PETRI_PLACES=394, PETRI_TRANSITIONS=671} [2024-06-27 19:53:55,814 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 351 predicate places. [2024-06-27 19:53:55,814 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 671 transitions, 9982 flow [2024-06-27 19:53:55,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:55,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:53:55,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:53:55,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-27 19:53:55,814 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:53:55,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:53:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1924340650, now seen corresponding path program 7 times [2024-06-27 19:53:55,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:53:55,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603552456] [2024-06-27 19:53:55,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:53:55,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:53:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:53:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:53:56,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:53:56,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603552456] [2024-06-27 19:53:56,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603552456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:53:56,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:53:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:53:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656338086] [2024-06-27 19:53:56,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:53:56,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:53:56,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:53:56,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:53:56,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:53:56,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:53:56,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 671 transitions, 9982 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:53:56,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:53:56,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:53:56,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:53:58,622 INFO L124 PetriNetUnfolderBase]: 4345/6952 cut-off events. [2024-06-27 19:53:58,622 INFO L125 PetriNetUnfolderBase]: For 1199961/1199961 co-relation queries the response was YES. [2024-06-27 19:53:58,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75679 conditions, 6952 events. 4345/6952 cut-off events. For 1199961/1199961 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 44095 event pairs, 778 based on Foata normal form. 4/6953 useless extension candidates. Maximal degree in co-relation 75492. Up to 6242 conditions per place. [2024-06-27 19:53:58,737 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 597 selfloop transitions, 95 changer transitions 0/697 dead transitions. [2024-06-27 19:53:58,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 697 transitions, 11698 flow [2024-06-27 19:53:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:53:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:53:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 19:53:58,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-27 19:53:58,738 INFO L175 Difference]: Start difference. First operand has 394 places, 671 transitions, 9982 flow. Second operand 8 states and 151 transitions. [2024-06-27 19:53:58,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 697 transitions, 11698 flow [2024-06-27 19:54:01,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 697 transitions, 11314 flow, removed 94 selfloop flow, removed 6 redundant places. [2024-06-27 19:54:01,497 INFO L231 Difference]: Finished difference. Result has 396 places, 676 transitions, 10027 flow [2024-06-27 19:54:01,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9598, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10027, PETRI_PLACES=396, PETRI_TRANSITIONS=676} [2024-06-27 19:54:01,498 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 353 predicate places. [2024-06-27 19:54:01,498 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 676 transitions, 10027 flow [2024-06-27 19:54:01,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:01,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:54:01,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:54:01,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-27 19:54:01,499 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:54:01,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:54:01,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1968391014, now seen corresponding path program 8 times [2024-06-27 19:54:01,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:54:01,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765475722] [2024-06-27 19:54:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:54:01,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:54:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:54:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:54:02,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:54:02,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765475722] [2024-06-27 19:54:02,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765475722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:54:02,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:54:02,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:54:02,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942010158] [2024-06-27 19:54:02,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:54:02,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:54:02,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:54:02,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:54:02,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:54:02,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:54:02,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 676 transitions, 10027 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:02,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:54:02,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:54:02,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:54:04,368 INFO L124 PetriNetUnfolderBase]: 4387/7023 cut-off events. [2024-06-27 19:54:04,368 INFO L125 PetriNetUnfolderBase]: For 1236549/1236549 co-relation queries the response was YES. [2024-06-27 19:54:04,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77261 conditions, 7023 events. 4387/7023 cut-off events. For 1236549/1236549 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 44739 event pairs, 782 based on Foata normal form. 2/7022 useless extension candidates. Maximal degree in co-relation 77073. Up to 6232 conditions per place. [2024-06-27 19:54:04,500 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 583 selfloop transitions, 116 changer transitions 0/704 dead transitions. [2024-06-27 19:54:04,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 704 transitions, 12137 flow [2024-06-27 19:54:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:54:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:54:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 19:54:04,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 19:54:04,501 INFO L175 Difference]: Start difference. First operand has 396 places, 676 transitions, 10027 flow. Second operand 8 states and 152 transitions. [2024-06-27 19:54:04,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 704 transitions, 12137 flow [2024-06-27 19:54:07,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 704 transitions, 11783 flow, removed 95 selfloop flow, removed 6 redundant places. [2024-06-27 19:54:07,798 INFO L231 Difference]: Finished difference. Result has 399 places, 684 transitions, 10331 flow [2024-06-27 19:54:07,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9673, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10331, PETRI_PLACES=399, PETRI_TRANSITIONS=684} [2024-06-27 19:54:07,798 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 356 predicate places. [2024-06-27 19:54:07,798 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 684 transitions, 10331 flow [2024-06-27 19:54:07,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:07,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:54:07,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:54:07,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-27 19:54:07,799 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:54:07,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:54:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1096158412, now seen corresponding path program 9 times [2024-06-27 19:54:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:54:07,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102304951] [2024-06-27 19:54:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:54:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:54:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:54:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:54:08,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:54:08,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102304951] [2024-06-27 19:54:08,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102304951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:54:08,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:54:08,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:54:08,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100564971] [2024-06-27 19:54:08,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:54:08,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:54:08,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:54:08,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:54:08,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:54:08,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:54:08,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 684 transitions, 10331 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:08,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:54:08,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:54:08,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:54:10,514 INFO L124 PetriNetUnfolderBase]: 4375/7009 cut-off events. [2024-06-27 19:54:10,514 INFO L125 PetriNetUnfolderBase]: For 1244846/1244846 co-relation queries the response was YES. [2024-06-27 19:54:10,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76889 conditions, 7009 events. 4375/7009 cut-off events. For 1244846/1244846 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 44667 event pairs, 786 based on Foata normal form. 4/7010 useless extension candidates. Maximal degree in co-relation 76698. Up to 6284 conditions per place. [2024-06-27 19:54:10,638 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 609 selfloop transitions, 92 changer transitions 0/706 dead transitions. [2024-06-27 19:54:10,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 706 transitions, 11868 flow [2024-06-27 19:54:10,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:54:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:54:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 19:54:10,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-27 19:54:10,639 INFO L175 Difference]: Start difference. First operand has 399 places, 684 transitions, 10331 flow. Second operand 8 states and 151 transitions. [2024-06-27 19:54:10,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 706 transitions, 11868 flow [2024-06-27 19:54:14,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 706 transitions, 11469 flow, removed 143 selfloop flow, removed 4 redundant places. [2024-06-27 19:54:14,569 INFO L231 Difference]: Finished difference. Result has 403 places, 684 transitions, 10125 flow [2024-06-27 19:54:14,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9932, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10125, PETRI_PLACES=403, PETRI_TRANSITIONS=684} [2024-06-27 19:54:14,570 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 360 predicate places. [2024-06-27 19:54:14,570 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 684 transitions, 10125 flow [2024-06-27 19:54:14,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:14,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:54:14,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:54:14,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-27 19:54:14,570 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:54:14,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:54:14,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1096308142, now seen corresponding path program 10 times [2024-06-27 19:54:14,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:54:14,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74934289] [2024-06-27 19:54:14,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:54:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:54:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:54:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:54:15,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:54:15,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74934289] [2024-06-27 19:54:15,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74934289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:54:15,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:54:15,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:54:15,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702573333] [2024-06-27 19:54:15,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:54:15,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:54:15,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:54:15,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:54:15,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:54:15,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:54:15,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 684 transitions, 10125 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:15,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:54:15,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:54:15,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:54:17,105 INFO L124 PetriNetUnfolderBase]: 4363/6983 cut-off events. [2024-06-27 19:54:17,105 INFO L125 PetriNetUnfolderBase]: For 1233499/1233499 co-relation queries the response was YES. [2024-06-27 19:54:17,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75959 conditions, 6983 events. 4363/6983 cut-off events. For 1233499/1233499 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 44415 event pairs, 775 based on Foata normal form. 4/6984 useless extension candidates. Maximal degree in co-relation 75766. Up to 6238 conditions per place. [2024-06-27 19:54:17,239 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 598 selfloop transitions, 106 changer transitions 0/709 dead transitions. [2024-06-27 19:54:17,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 709 transitions, 11914 flow [2024-06-27 19:54:17,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:54:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:54:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 19:54:17,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-27 19:54:17,240 INFO L175 Difference]: Start difference. First operand has 403 places, 684 transitions, 10125 flow. Second operand 8 states and 150 transitions. [2024-06-27 19:54:17,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 709 transitions, 11914 flow [2024-06-27 19:54:20,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 709 transitions, 11667 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-27 19:54:20,873 INFO L231 Difference]: Finished difference. Result has 404 places, 689 transitions, 10349 flow [2024-06-27 19:54:20,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9878, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10349, PETRI_PLACES=404, PETRI_TRANSITIONS=689} [2024-06-27 19:54:20,874 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 361 predicate places. [2024-06-27 19:54:20,874 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 689 transitions, 10349 flow [2024-06-27 19:54:20,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:20,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:54:20,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:54:20,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-27 19:54:20,875 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:54:20,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:54:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1417062005, now seen corresponding path program 7 times [2024-06-27 19:54:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:54:20,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880095507] [2024-06-27 19:54:20,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:54:20,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:54:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:54:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:54:21,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:54:21,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880095507] [2024-06-27 19:54:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880095507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:54:21,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:54:21,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:54:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112380693] [2024-06-27 19:54:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:54:21,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:54:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:54:21,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:54:21,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:54:21,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:54:21,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 689 transitions, 10349 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:21,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:54:21,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:54:21,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:54:23,545 INFO L124 PetriNetUnfolderBase]: 4345/6956 cut-off events. [2024-06-27 19:54:23,545 INFO L125 PetriNetUnfolderBase]: For 1230219/1230219 co-relation queries the response was YES. [2024-06-27 19:54:23,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75727 conditions, 6956 events. 4345/6956 cut-off events. For 1230219/1230219 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 44190 event pairs, 774 based on Foata normal form. 2/6955 useless extension candidates. Maximal degree in co-relation 75533. Up to 6395 conditions per place. [2024-06-27 19:54:23,658 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 641 selfloop transitions, 59 changer transitions 0/705 dead transitions. [2024-06-27 19:54:23,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 705 transitions, 11818 flow [2024-06-27 19:54:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:54:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:54:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 19:54:23,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 19:54:23,659 INFO L175 Difference]: Start difference. First operand has 404 places, 689 transitions, 10349 flow. Second operand 8 states and 144 transitions. [2024-06-27 19:54:23,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 705 transitions, 11818 flow [2024-06-27 19:54:27,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 705 transitions, 11351 flow, removed 131 selfloop flow, removed 6 redundant places. [2024-06-27 19:54:27,437 INFO L231 Difference]: Finished difference. Result has 406 places, 689 transitions, 10010 flow [2024-06-27 19:54:27,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9882, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10010, PETRI_PLACES=406, PETRI_TRANSITIONS=689} [2024-06-27 19:54:27,437 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 363 predicate places. [2024-06-27 19:54:27,438 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 689 transitions, 10010 flow [2024-06-27 19:54:27,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:27,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:54:27,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:54:27,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-27 19:54:27,451 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:54:27,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:54:27,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1480538789, now seen corresponding path program 8 times [2024-06-27 19:54:27,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:54:27,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444711507] [2024-06-27 19:54:27,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:54:27,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:54:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:54:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:54:28,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:54:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444711507] [2024-06-27 19:54:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444711507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:54:28,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:54:28,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:54:28,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287732787] [2024-06-27 19:54:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:54:28,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:54:28,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:54:28,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:54:28,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:54:28,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:54:28,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 689 transitions, 10010 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:28,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:54:28,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:54:28,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:54:30,318 INFO L124 PetriNetUnfolderBase]: 4358/6976 cut-off events. [2024-06-27 19:54:30,319 INFO L125 PetriNetUnfolderBase]: For 1240884/1240884 co-relation queries the response was YES. [2024-06-27 19:54:30,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75499 conditions, 6976 events. 4358/6976 cut-off events. For 1240884/1240884 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 44256 event pairs, 770 based on Foata normal form. 1/6974 useless extension candidates. Maximal degree in co-relation 75304. Up to 6361 conditions per place. [2024-06-27 19:54:30,426 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 609 selfloop transitions, 96 changer transitions 0/710 dead transitions. [2024-06-27 19:54:30,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 710 transitions, 11843 flow [2024-06-27 19:54:30,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:54:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:54:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 19:54:30,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2024-06-27 19:54:30,427 INFO L175 Difference]: Start difference. First operand has 406 places, 689 transitions, 10010 flow. Second operand 8 states and 146 transitions. [2024-06-27 19:54:30,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 710 transitions, 11843 flow [2024-06-27 19:54:34,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 710 transitions, 11514 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-27 19:54:34,083 INFO L231 Difference]: Finished difference. Result has 407 places, 696 transitions, 10075 flow [2024-06-27 19:54:34,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9681, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10075, PETRI_PLACES=407, PETRI_TRANSITIONS=696} [2024-06-27 19:54:34,085 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 364 predicate places. [2024-06-27 19:54:34,085 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 696 transitions, 10075 flow [2024-06-27 19:54:34,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:34,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:54:34,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:54:34,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-27 19:54:34,090 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:54:34,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:54:34,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1405956162, now seen corresponding path program 11 times [2024-06-27 19:54:34,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:54:34,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516042378] [2024-06-27 19:54:34,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:54:34,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:54:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:54:34,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-06-27 19:54:34,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:54:34,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516042378] [2024-06-27 19:54:34,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516042378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:54:34,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:54:34,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:54:34,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788107926] [2024-06-27 19:54:34,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:54:34,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:54:34,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:54:34,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:54:34,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:54:34,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:54:34,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 696 transitions, 10075 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:34,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:54:34,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:54:34,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:54:36,672 INFO L124 PetriNetUnfolderBase]: 4384/7020 cut-off events. [2024-06-27 19:54:36,673 INFO L125 PetriNetUnfolderBase]: For 1283886/1283886 co-relation queries the response was YES. [2024-06-27 19:54:36,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76716 conditions, 7020 events. 4384/7020 cut-off events. For 1283886/1283886 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 44664 event pairs, 777 based on Foata normal form. 2/7019 useless extension candidates. Maximal degree in co-relation 76519. Up to 6133 conditions per place. [2024-06-27 19:54:36,803 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 558 selfloop transitions, 157 changer transitions 0/720 dead transitions. [2024-06-27 19:54:36,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 720 transitions, 12167 flow [2024-06-27 19:54:36,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:54:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:54:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 19:54:36,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 19:54:36,804 INFO L175 Difference]: Start difference. First operand has 407 places, 696 transitions, 10075 flow. Second operand 8 states and 152 transitions. [2024-06-27 19:54:36,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 720 transitions, 12167 flow [2024-06-27 19:54:40,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 720 transitions, 11948 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-27 19:54:40,856 INFO L231 Difference]: Finished difference. Result has 410 places, 702 transitions, 10490 flow [2024-06-27 19:54:40,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9860, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10490, PETRI_PLACES=410, PETRI_TRANSITIONS=702} [2024-06-27 19:54:40,856 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 367 predicate places. [2024-06-27 19:54:40,856 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 702 transitions, 10490 flow [2024-06-27 19:54:40,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:40,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:54:40,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:54:40,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-27 19:54:40,857 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:54:40,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:54:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1480093102, now seen corresponding path program 12 times [2024-06-27 19:54:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:54:40,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257812963] [2024-06-27 19:54:40,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:54:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:54:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:54:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:54:41,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:54:41,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257812963] [2024-06-27 19:54:41,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257812963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:54:41,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:54:41,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:54:41,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96572970] [2024-06-27 19:54:41,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:54:41,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:54:41,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:54:41,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:54:41,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:54:41,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:54:41,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 702 transitions, 10490 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:41,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:54:41,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:54:41,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:54:43,545 INFO L124 PetriNetUnfolderBase]: 4378/7021 cut-off events. [2024-06-27 19:54:43,545 INFO L125 PetriNetUnfolderBase]: For 1259159/1259159 co-relation queries the response was YES. [2024-06-27 19:54:43,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76807 conditions, 7021 events. 4378/7021 cut-off events. For 1259159/1259159 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 44770 event pairs, 778 based on Foata normal form. 2/7020 useless extension candidates. Maximal degree in co-relation 76609. Up to 6128 conditions per place. [2024-06-27 19:54:43,665 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 561 selfloop transitions, 153 changer transitions 0/719 dead transitions. [2024-06-27 19:54:43,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 719 transitions, 12046 flow [2024-06-27 19:54:43,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:54:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:54:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 19:54:43,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-27 19:54:43,667 INFO L175 Difference]: Start difference. First operand has 410 places, 702 transitions, 10490 flow. Second operand 8 states and 150 transitions. [2024-06-27 19:54:43,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 719 transitions, 12046 flow [2024-06-27 19:54:47,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 719 transitions, 11526 flow, removed 131 selfloop flow, removed 6 redundant places. [2024-06-27 19:54:47,930 INFO L231 Difference]: Finished difference. Result has 412 places, 702 transitions, 10282 flow [2024-06-27 19:54:47,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9970, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10282, PETRI_PLACES=412, PETRI_TRANSITIONS=702} [2024-06-27 19:54:47,931 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 369 predicate places. [2024-06-27 19:54:47,931 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 702 transitions, 10282 flow [2024-06-27 19:54:47,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:47,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:54:47,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:54:47,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-27 19:54:47,931 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:54:47,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:54:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1480093319, now seen corresponding path program 9 times [2024-06-27 19:54:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:54:47,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224841358] [2024-06-27 19:54:47,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:54:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:54:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:54:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:54:48,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:54:48,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224841358] [2024-06-27 19:54:48,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224841358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:54:48,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:54:48,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:54:48,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965814275] [2024-06-27 19:54:48,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:54:48,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:54:48,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:54:48,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:54:48,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:54:48,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:54:48,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 702 transitions, 10282 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:48,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:54:48,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:54:48,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:54:50,524 INFO L124 PetriNetUnfolderBase]: 4375/7018 cut-off events. [2024-06-27 19:54:50,524 INFO L125 PetriNetUnfolderBase]: For 1256696/1256696 co-relation queries the response was YES. [2024-06-27 19:54:50,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76394 conditions, 7018 events. 4375/7018 cut-off events. For 1256696/1256696 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 44709 event pairs, 780 based on Foata normal form. 1/7016 useless extension candidates. Maximal degree in co-relation 76196. Up to 6416 conditions per place. [2024-06-27 19:54:50,649 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 637 selfloop transitions, 73 changer transitions 0/715 dead transitions. [2024-06-27 19:54:50,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 715 transitions, 11746 flow [2024-06-27 19:54:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:54:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:54:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 19:54:50,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-27 19:54:50,651 INFO L175 Difference]: Start difference. First operand has 412 places, 702 transitions, 10282 flow. Second operand 8 states and 143 transitions. [2024-06-27 19:54:50,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 715 transitions, 11746 flow [2024-06-27 19:54:55,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 715 transitions, 11345 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-06-27 19:54:55,325 INFO L231 Difference]: Finished difference. Result has 413 places, 702 transitions, 10033 flow [2024-06-27 19:54:55,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9881, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10033, PETRI_PLACES=413, PETRI_TRANSITIONS=702} [2024-06-27 19:54:55,326 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 370 predicate places. [2024-06-27 19:54:55,326 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 702 transitions, 10033 flow [2024-06-27 19:54:55,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:55,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:54:55,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:54:55,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-27 19:54:55,327 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:54:55,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:54:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash 219971252, now seen corresponding path program 13 times [2024-06-27 19:54:55,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:54:55,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762479880] [2024-06-27 19:54:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:54:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:54:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:54:55,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-06-27 19:54:55,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:54:55,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762479880] [2024-06-27 19:54:55,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762479880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:54:55,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:54:55,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:54:55,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594921058] [2024-06-27 19:54:55,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:54:55,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:54:55,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:54:55,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:54:55,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:54:56,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:54:56,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 702 transitions, 10033 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:54:56,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:54:56,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:54:56,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:54:57,851 INFO L124 PetriNetUnfolderBase]: 4417/7091 cut-off events. [2024-06-27 19:54:57,852 INFO L125 PetriNetUnfolderBase]: For 1318653/1318655 co-relation queries the response was YES. [2024-06-27 19:54:57,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77773 conditions, 7091 events. 4417/7091 cut-off events. For 1318653/1318655 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 45332 event pairs, 834 based on Foata normal form. 2/7090 useless extension candidates. Maximal degree in co-relation 77574. Up to 5888 conditions per place. [2024-06-27 19:54:57,971 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 531 selfloop transitions, 191 changer transitions 0/727 dead transitions. [2024-06-27 19:54:57,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 727 transitions, 12523 flow [2024-06-27 19:54:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:54:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:54:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 19:54:57,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-27 19:54:57,973 INFO L175 Difference]: Start difference. First operand has 413 places, 702 transitions, 10033 flow. Second operand 8 states and 150 transitions. [2024-06-27 19:54:57,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 727 transitions, 12523 flow [2024-06-27 19:55:01,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 727 transitions, 12379 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-27 19:55:01,425 INFO L231 Difference]: Finished difference. Result has 415 places, 712 transitions, 10765 flow [2024-06-27 19:55:01,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9889, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10765, PETRI_PLACES=415, PETRI_TRANSITIONS=712} [2024-06-27 19:55:01,425 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 372 predicate places. [2024-06-27 19:55:01,425 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 712 transitions, 10765 flow [2024-06-27 19:55:01,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:01,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:55:01,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:55:01,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-27 19:55:01,426 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:55:01,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:55:01,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1788968283, now seen corresponding path program 10 times [2024-06-27 19:55:01,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:55:01,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898530858] [2024-06-27 19:55:01,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:55:01,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:55:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:55:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:55:02,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:55:02,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898530858] [2024-06-27 19:55:02,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898530858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:55:02,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:55:02,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:55:02,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416570379] [2024-06-27 19:55:02,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:55:02,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:55:02,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:55:02,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:55:02,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:55:02,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:55:02,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 712 transitions, 10765 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:02,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:55:02,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:55:02,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:55:04,305 INFO L124 PetriNetUnfolderBase]: 4438/7115 cut-off events. [2024-06-27 19:55:04,306 INFO L125 PetriNetUnfolderBase]: For 1357797/1357799 co-relation queries the response was YES. [2024-06-27 19:55:04,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79528 conditions, 7115 events. 4438/7115 cut-off events. For 1357797/1357799 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 45349 event pairs, 794 based on Foata normal form. 3/7115 useless extension candidates. Maximal degree in co-relation 79328. Up to 6371 conditions per place. [2024-06-27 19:55:04,433 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 603 selfloop transitions, 123 changer transitions 0/731 dead transitions. [2024-06-27 19:55:04,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 731 transitions, 12660 flow [2024-06-27 19:55:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:55:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:55:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 19:55:04,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 19:55:04,457 INFO L175 Difference]: Start difference. First operand has 415 places, 712 transitions, 10765 flow. Second operand 8 states and 144 transitions. [2024-06-27 19:55:04,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 731 transitions, 12660 flow [2024-06-27 19:55:07,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 731 transitions, 12282 flow, removed 104 selfloop flow, removed 5 redundant places. [2024-06-27 19:55:07,882 INFO L231 Difference]: Finished difference. Result has 419 places, 720 transitions, 10854 flow [2024-06-27 19:55:07,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10387, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10854, PETRI_PLACES=419, PETRI_TRANSITIONS=720} [2024-06-27 19:55:07,882 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 376 predicate places. [2024-06-27 19:55:07,882 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 720 transitions, 10854 flow [2024-06-27 19:55:07,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:07,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:55:07,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:55:07,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-27 19:55:07,884 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:55:07,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:55:07,884 INFO L85 PathProgramCache]: Analyzing trace with hash 219734102, now seen corresponding path program 14 times [2024-06-27 19:55:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:55:07,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178754441] [2024-06-27 19:55:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:55:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:55:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:55:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:55:08,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:55:08,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178754441] [2024-06-27 19:55:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178754441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:55:08,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:55:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:55:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479157480] [2024-06-27 19:55:08,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:55:08,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:55:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:55:08,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:55:08,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:55:08,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:55:08,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 720 transitions, 10854 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:08,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:55:08,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:55:08,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:55:10,762 INFO L124 PetriNetUnfolderBase]: 4448/7132 cut-off events. [2024-06-27 19:55:10,762 INFO L125 PetriNetUnfolderBase]: For 1362639/1362641 co-relation queries the response was YES. [2024-06-27 19:55:10,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78876 conditions, 7132 events. 4448/7132 cut-off events. For 1362639/1362641 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 45553 event pairs, 832 based on Foata normal form. 2/7131 useless extension candidates. Maximal degree in co-relation 78675. Up to 5923 conditions per place. [2024-06-27 19:55:10,882 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 543 selfloop transitions, 191 changer transitions 0/739 dead transitions. [2024-06-27 19:55:10,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 739 transitions, 13052 flow [2024-06-27 19:55:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:55:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:55:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 19:55:10,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-27 19:55:10,884 INFO L175 Difference]: Start difference. First operand has 419 places, 720 transitions, 10854 flow. Second operand 8 states and 151 transitions. [2024-06-27 19:55:10,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 739 transitions, 13052 flow [2024-06-27 19:55:14,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 739 transitions, 12762 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-27 19:55:14,105 INFO L231 Difference]: Finished difference. Result has 422 places, 723 transitions, 11084 flow [2024-06-27 19:55:14,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10564, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11084, PETRI_PLACES=422, PETRI_TRANSITIONS=723} [2024-06-27 19:55:14,105 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 379 predicate places. [2024-06-27 19:55:14,106 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 723 transitions, 11084 flow [2024-06-27 19:55:14,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:14,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:55:14,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:55:14,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-27 19:55:14,106 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:55:14,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:55:14,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1789413753, now seen corresponding path program 11 times [2024-06-27 19:55:14,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:55:14,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466502844] [2024-06-27 19:55:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:55:14,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:55:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:55:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:55:14,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:55:14,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466502844] [2024-06-27 19:55:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466502844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:55:14,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:55:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:55:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673755722] [2024-06-27 19:55:14,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:55:14,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:55:14,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:55:14,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:55:14,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:55:15,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:55:15,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 723 transitions, 11084 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:15,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:55:15,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:55:15,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:55:17,069 INFO L124 PetriNetUnfolderBase]: 4453/7134 cut-off events. [2024-06-27 19:55:17,069 INFO L125 PetriNetUnfolderBase]: For 1378851/1378853 co-relation queries the response was YES. [2024-06-27 19:55:17,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79406 conditions, 7134 events. 4453/7134 cut-off events. For 1378851/1378853 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 45445 event pairs, 792 based on Foata normal form. 3/7134 useless extension candidates. Maximal degree in co-relation 79204. Up to 6417 conditions per place. [2024-06-27 19:55:17,187 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 622 selfloop transitions, 109 changer transitions 0/736 dead transitions. [2024-06-27 19:55:17,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 736 transitions, 12650 flow [2024-06-27 19:55:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:55:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:55:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 19:55:17,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2024-06-27 19:55:17,188 INFO L175 Difference]: Start difference. First operand has 422 places, 723 transitions, 11084 flow. Second operand 8 states and 141 transitions. [2024-06-27 19:55:17,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 736 transitions, 12650 flow [2024-06-27 19:55:20,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 736 transitions, 12325 flow, removed 57 selfloop flow, removed 4 redundant places. [2024-06-27 19:55:20,523 INFO L231 Difference]: Finished difference. Result has 426 places, 726 transitions, 11063 flow [2024-06-27 19:55:20,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10759, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11063, PETRI_PLACES=426, PETRI_TRANSITIONS=726} [2024-06-27 19:55:20,524 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 383 predicate places. [2024-06-27 19:55:20,524 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 726 transitions, 11063 flow [2024-06-27 19:55:20,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:20,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:55:20,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:55:20,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-27 19:55:20,527 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:55:20,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:55:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash 626949155, now seen corresponding path program 12 times [2024-06-27 19:55:20,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:55:20,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600848881] [2024-06-27 19:55:20,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:55:20,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:55:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:55:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:55:21,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:55:21,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600848881] [2024-06-27 19:55:21,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600848881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:55:21,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:55:21,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:55:21,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519679161] [2024-06-27 19:55:21,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:55:21,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:55:21,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:55:21,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:55:21,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:55:21,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:55:21,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 726 transitions, 11063 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:21,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:55:21,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:55:21,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:55:23,420 INFO L124 PetriNetUnfolderBase]: 4447/7130 cut-off events. [2024-06-27 19:55:23,421 INFO L125 PetriNetUnfolderBase]: For 1390217/1390219 co-relation queries the response was YES. [2024-06-27 19:55:23,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78851 conditions, 7130 events. 4447/7130 cut-off events. For 1390217/1390219 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 45524 event pairs, 794 based on Foata normal form. 4/7131 useless extension candidates. Maximal degree in co-relation 78648. Up to 6406 conditions per place. [2024-06-27 19:55:23,531 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 632 selfloop transitions, 99 changer transitions 0/736 dead transitions. [2024-06-27 19:55:23,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 736 transitions, 12555 flow [2024-06-27 19:55:23,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:55:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:55:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 19:55:23,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-27 19:55:23,535 INFO L175 Difference]: Start difference. First operand has 426 places, 726 transitions, 11063 flow. Second operand 8 states and 143 transitions. [2024-06-27 19:55:23,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 736 transitions, 12555 flow [2024-06-27 19:55:27,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 736 transitions, 12235 flow, removed 53 selfloop flow, removed 6 redundant places. [2024-06-27 19:55:27,038 INFO L231 Difference]: Finished difference. Result has 428 places, 726 transitions, 10948 flow [2024-06-27 19:55:27,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10743, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10948, PETRI_PLACES=428, PETRI_TRANSITIONS=726} [2024-06-27 19:55:27,045 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 385 predicate places. [2024-06-27 19:55:27,045 INFO L495 AbstractCegarLoop]: Abstraction has has 428 places, 726 transitions, 10948 flow [2024-06-27 19:55:27,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:27,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:55:27,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:55:27,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-27 19:55:27,048 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:55:27,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:55:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash 227122239, now seen corresponding path program 13 times [2024-06-27 19:55:27,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:55:27,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147013617] [2024-06-27 19:55:27,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:55:27,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:55:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:55:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:55:27,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:55:27,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147013617] [2024-06-27 19:55:27,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147013617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:55:27,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:55:27,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:55:27,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306781878] [2024-06-27 19:55:27,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:55:27,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:55:27,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:55:27,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:55:27,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:55:27,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:55:27,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 726 transitions, 10948 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:27,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:55:27,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:55:27,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:55:29,675 INFO L124 PetriNetUnfolderBase]: 4449/7133 cut-off events. [2024-06-27 19:55:29,675 INFO L125 PetriNetUnfolderBase]: For 1402145/1402147 co-relation queries the response was YES. [2024-06-27 19:55:29,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78837 conditions, 7133 events. 4449/7133 cut-off events. For 1402145/1402147 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 45540 event pairs, 790 based on Foata normal form. 4/7134 useless extension candidates. Maximal degree in co-relation 78633. Up to 6192 conditions per place. [2024-06-27 19:55:30,011 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 551 selfloop transitions, 185 changer transitions 0/741 dead transitions. [2024-06-27 19:55:30,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 741 transitions, 13008 flow [2024-06-27 19:55:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:55:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:55:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 19:55:30,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-27 19:55:30,013 INFO L175 Difference]: Start difference. First operand has 428 places, 726 transitions, 10948 flow. Second operand 8 states and 147 transitions. [2024-06-27 19:55:30,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 741 transitions, 13008 flow [2024-06-27 19:55:33,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 741 transitions, 12807 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 19:55:33,502 INFO L231 Difference]: Finished difference. Result has 430 places, 729 transitions, 11201 flow [2024-06-27 19:55:33,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10747, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11201, PETRI_PLACES=430, PETRI_TRANSITIONS=729} [2024-06-27 19:55:33,503 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 387 predicate places. [2024-06-27 19:55:33,503 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 729 transitions, 11201 flow [2024-06-27 19:55:33,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:33,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:55:33,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:55:33,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-27 19:55:33,503 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:55:33,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:55:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash 42869709, now seen corresponding path program 14 times [2024-06-27 19:55:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:55:33,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951270056] [2024-06-27 19:55:33,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:55:33,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:55:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:55:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:55:34,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:55:34,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951270056] [2024-06-27 19:55:34,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951270056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:55:34,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:55:34,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:55:34,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244789336] [2024-06-27 19:55:34,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:55:34,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:55:34,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:55:34,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:55:34,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:55:34,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:55:34,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 729 transitions, 11201 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:34,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:55:34,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:55:34,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:55:36,283 INFO L124 PetriNetUnfolderBase]: 4441/7123 cut-off events. [2024-06-27 19:55:36,283 INFO L125 PetriNetUnfolderBase]: For 1406213/1406215 co-relation queries the response was YES. [2024-06-27 19:55:36,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78929 conditions, 7123 events. 4441/7123 cut-off events. For 1406213/1406215 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 45478 event pairs, 796 based on Foata normal form. 4/7124 useless extension candidates. Maximal degree in co-relation 78724. Up to 6363 conditions per place. [2024-06-27 19:55:36,412 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 621 selfloop transitions, 113 changer transitions 0/739 dead transitions. [2024-06-27 19:55:36,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 739 transitions, 12699 flow [2024-06-27 19:55:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:55:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:55:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 19:55:36,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 19:55:36,413 INFO L175 Difference]: Start difference. First operand has 430 places, 729 transitions, 11201 flow. Second operand 8 states and 144 transitions. [2024-06-27 19:55:36,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 739 transitions, 12699 flow [2024-06-27 19:55:40,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 739 transitions, 12244 flow, removed 54 selfloop flow, removed 5 redundant places. [2024-06-27 19:55:40,544 INFO L231 Difference]: Finished difference. Result has 433 places, 729 transitions, 10981 flow [2024-06-27 19:55:40,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10746, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10981, PETRI_PLACES=433, PETRI_TRANSITIONS=729} [2024-06-27 19:55:40,545 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 390 predicate places. [2024-06-27 19:55:40,545 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 729 transitions, 10981 flow [2024-06-27 19:55:40,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:40,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:55:40,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:55:40,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-27 19:55:40,546 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:55:40,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:55:40,546 INFO L85 PathProgramCache]: Analyzing trace with hash 476680299, now seen corresponding path program 15 times [2024-06-27 19:55:40,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:55:40,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925348101] [2024-06-27 19:55:40,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:55:40,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:55:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:55:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:55:41,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:55:41,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925348101] [2024-06-27 19:55:41,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925348101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:55:41,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:55:41,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:55:41,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828977140] [2024-06-27 19:55:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:55:41,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:55:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:55:41,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:55:41,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:55:41,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:55:41,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 729 transitions, 10981 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:41,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:55:41,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:55:41,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:55:43,299 INFO L124 PetriNetUnfolderBase]: 4436/7109 cut-off events. [2024-06-27 19:55:43,299 INFO L125 PetriNetUnfolderBase]: For 1413765/1413767 co-relation queries the response was YES. [2024-06-27 19:55:43,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78576 conditions, 7109 events. 4436/7109 cut-off events. For 1413765/1413767 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 45268 event pairs, 790 based on Foata normal form. 3/7109 useless extension candidates. Maximal degree in co-relation 78370. Up to 6179 conditions per place. [2024-06-27 19:55:43,429 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 533 selfloop transitions, 201 changer transitions 0/739 dead transitions. [2024-06-27 19:55:43,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 739 transitions, 12479 flow [2024-06-27 19:55:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:55:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:55:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 19:55:43,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 19:55:43,430 INFO L175 Difference]: Start difference. First operand has 433 places, 729 transitions, 10981 flow. Second operand 8 states and 144 transitions. [2024-06-27 19:55:43,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 739 transitions, 12479 flow [2024-06-27 19:55:48,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 739 transitions, 12167 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-27 19:55:48,079 INFO L231 Difference]: Finished difference. Result has 434 places, 729 transitions, 11077 flow [2024-06-27 19:55:48,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10669, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11077, PETRI_PLACES=434, PETRI_TRANSITIONS=729} [2024-06-27 19:55:48,080 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 391 predicate places. [2024-06-27 19:55:48,080 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 729 transitions, 11077 flow [2024-06-27 19:55:48,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:48,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:55:48,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:55:48,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-27 19:55:48,081 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:55:48,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:55:48,081 INFO L85 PathProgramCache]: Analyzing trace with hash 42602582, now seen corresponding path program 15 times [2024-06-27 19:55:48,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:55:48,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398666692] [2024-06-27 19:55:48,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:55:48,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:55:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:55:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:55:48,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:55:48,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398666692] [2024-06-27 19:55:48,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398666692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:55:48,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:55:48,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:55:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612615598] [2024-06-27 19:55:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:55:48,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:55:48,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:55:48,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:55:48,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:55:48,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:55:48,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 729 transitions, 11077 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:48,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:55:48,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:55:48,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:55:50,617 INFO L124 PetriNetUnfolderBase]: 4424/7100 cut-off events. [2024-06-27 19:55:50,617 INFO L125 PetriNetUnfolderBase]: For 1427337/1427339 co-relation queries the response was YES. [2024-06-27 19:55:50,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78163 conditions, 7100 events. 4424/7100 cut-off events. For 1427337/1427339 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 45388 event pairs, 823 based on Foata normal form. 4/7101 useless extension candidates. Maximal degree in co-relation 77956. Up to 5899 conditions per place. [2024-06-27 19:55:50,741 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 561 selfloop transitions, 178 changer transitions 0/744 dead transitions. [2024-06-27 19:55:50,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 744 transitions, 13153 flow [2024-06-27 19:55:50,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:55:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:55:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 19:55:50,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-27 19:55:50,743 INFO L175 Difference]: Start difference. First operand has 434 places, 729 transitions, 11077 flow. Second operand 8 states and 151 transitions. [2024-06-27 19:55:50,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 744 transitions, 13153 flow [2024-06-27 19:55:54,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 744 transitions, 12542 flow, removed 79 selfloop flow, removed 9 redundant places. [2024-06-27 19:55:54,242 INFO L231 Difference]: Finished difference. Result has 433 places, 729 transitions, 10829 flow [2024-06-27 19:55:54,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10466, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10829, PETRI_PLACES=433, PETRI_TRANSITIONS=729} [2024-06-27 19:55:54,243 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 390 predicate places. [2024-06-27 19:55:54,243 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 729 transitions, 10829 flow [2024-06-27 19:55:54,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:54,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:55:54,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:55:54,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-27 19:55:54,243 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:55:54,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:55:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash 470975834, now seen corresponding path program 10 times [2024-06-27 19:55:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:55:54,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298641841] [2024-06-27 19:55:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:55:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:55:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:55:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:55:54,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:55:54,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298641841] [2024-06-27 19:55:54,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298641841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:55:54,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:55:54,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:55:54,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663779307] [2024-06-27 19:55:54,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:55:54,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:55:54,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:55:54,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:55:54,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:55:55,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:55:55,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 729 transitions, 10829 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:55:55,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:55:55,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:55:55,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:55:57,084 INFO L124 PetriNetUnfolderBase]: 4544/7265 cut-off events. [2024-06-27 19:55:57,084 INFO L125 PetriNetUnfolderBase]: For 1551310/1551312 co-relation queries the response was YES. [2024-06-27 19:55:57,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82772 conditions, 7265 events. 4544/7265 cut-off events. For 1551310/1551312 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 46328 event pairs, 781 based on Foata normal form. 6/7268 useless extension candidates. Maximal degree in co-relation 82566. Up to 5831 conditions per place. [2024-06-27 19:55:57,210 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 534 selfloop transitions, 227 changer transitions 0/766 dead transitions. [2024-06-27 19:55:57,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 766 transitions, 14241 flow [2024-06-27 19:55:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:55:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:55:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-27 19:55:57,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2024-06-27 19:55:57,211 INFO L175 Difference]: Start difference. First operand has 433 places, 729 transitions, 10829 flow. Second operand 9 states and 170 transitions. [2024-06-27 19:55:57,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 766 transitions, 14241 flow [2024-06-27 19:56:01,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 766 transitions, 13726 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-27 19:56:01,557 INFO L231 Difference]: Finished difference. Result has 435 places, 743 transitions, 11449 flow [2024-06-27 19:56:01,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10314, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11449, PETRI_PLACES=435, PETRI_TRANSITIONS=743} [2024-06-27 19:56:01,564 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 392 predicate places. [2024-06-27 19:56:01,565 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 743 transitions, 11449 flow [2024-06-27 19:56:01,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:01,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:56:01,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:56:01,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-27 19:56:01,565 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:56:01,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:56:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash 470962814, now seen corresponding path program 11 times [2024-06-27 19:56:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:56:01,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747134760] [2024-06-27 19:56:01,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:56:01,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:56:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:56:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:56:02,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:56:02,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747134760] [2024-06-27 19:56:02,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747134760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:56:02,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:56:02,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:56:02,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220754902] [2024-06-27 19:56:02,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:56:02,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:56:02,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:56:02,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:56:02,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:56:02,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:56:02,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 743 transitions, 11449 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:02,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:56:02,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:56:02,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:56:04,640 INFO L124 PetriNetUnfolderBase]: 4554/7283 cut-off events. [2024-06-27 19:56:04,640 INFO L125 PetriNetUnfolderBase]: For 1568471/1568473 co-relation queries the response was YES. [2024-06-27 19:56:04,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83392 conditions, 7283 events. 4554/7283 cut-off events. For 1568471/1568473 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 46515 event pairs, 770 based on Foata normal form. 4/7284 useless extension candidates. Maximal degree in co-relation 83185. Up to 6088 conditions per place. [2024-06-27 19:56:04,770 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 584 selfloop transitions, 215 changer transitions 0/804 dead transitions. [2024-06-27 19:56:04,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 804 transitions, 15578 flow [2024-06-27 19:56:04,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:56:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:56:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 19:56:04,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-27 19:56:04,771 INFO L175 Difference]: Start difference. First operand has 435 places, 743 transitions, 11449 flow. Second operand 9 states and 166 transitions. [2024-06-27 19:56:04,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 804 transitions, 15578 flow [2024-06-27 19:56:08,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 804 transitions, 14936 flow, removed 269 selfloop flow, removed 3 redundant places. [2024-06-27 19:56:08,200 INFO L231 Difference]: Finished difference. Result has 444 places, 781 transitions, 12894 flow [2024-06-27 19:56:08,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11075, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12894, PETRI_PLACES=444, PETRI_TRANSITIONS=781} [2024-06-27 19:56:08,201 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 401 predicate places. [2024-06-27 19:56:08,201 INFO L495 AbstractCegarLoop]: Abstraction has has 444 places, 781 transitions, 12894 flow [2024-06-27 19:56:08,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:08,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:56:08,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:56:08,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-27 19:56:08,201 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:56:08,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:56:08,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1966281928, now seen corresponding path program 12 times [2024-06-27 19:56:08,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:56:08,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434581782] [2024-06-27 19:56:08,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:56:08,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:56:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:56:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:56:09,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:56:09,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434581782] [2024-06-27 19:56:09,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434581782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:56:09,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:56:09,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:56:09,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776509142] [2024-06-27 19:56:09,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:56:09,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:56:09,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:56:09,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:56:09,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:56:09,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:56:09,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 781 transitions, 12894 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:09,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:56:09,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:56:09,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:56:11,287 INFO L124 PetriNetUnfolderBase]: 4606/7367 cut-off events. [2024-06-27 19:56:11,287 INFO L125 PetriNetUnfolderBase]: For 1635672/1635674 co-relation queries the response was YES. [2024-06-27 19:56:11,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85825 conditions, 7367 events. 4606/7367 cut-off events. For 1635672/1635674 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 47127 event pairs, 792 based on Foata normal form. 6/7370 useless extension candidates. Maximal degree in co-relation 85613. Up to 6490 conditions per place. [2024-06-27 19:56:11,415 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 676 selfloop transitions, 130 changer transitions 0/811 dead transitions. [2024-06-27 19:56:11,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 811 transitions, 15895 flow [2024-06-27 19:56:11,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:56:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:56:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 19:56:11,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-27 19:56:11,416 INFO L175 Difference]: Start difference. First operand has 444 places, 781 transitions, 12894 flow. Second operand 9 states and 166 transitions. [2024-06-27 19:56:11,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 811 transitions, 15895 flow [2024-06-27 19:56:15,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 811 transitions, 15573 flow, removed 109 selfloop flow, removed 3 redundant places. [2024-06-27 19:56:15,306 INFO L231 Difference]: Finished difference. Result has 452 places, 794 transitions, 13583 flow [2024-06-27 19:56:15,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12572, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13583, PETRI_PLACES=452, PETRI_TRANSITIONS=794} [2024-06-27 19:56:15,306 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 409 predicate places. [2024-06-27 19:56:15,306 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 794 transitions, 13583 flow [2024-06-27 19:56:15,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:15,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:56:15,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:56:15,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-27 19:56:15,307 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:56:15,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:56:15,307 INFO L85 PathProgramCache]: Analyzing trace with hash 471408284, now seen corresponding path program 13 times [2024-06-27 19:56:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:56:15,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666001185] [2024-06-27 19:56:15,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:56:15,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:56:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:56:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:56:16,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:56:16,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666001185] [2024-06-27 19:56:16,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666001185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:56:16,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:56:16,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:56:16,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945576325] [2024-06-27 19:56:16,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:56:16,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:56:16,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:56:16,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:56:16,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:56:16,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:56:16,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 794 transitions, 13583 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:16,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:56:16,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:56:16,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:56:18,549 INFO L124 PetriNetUnfolderBase]: 4608/7376 cut-off events. [2024-06-27 19:56:18,549 INFO L125 PetriNetUnfolderBase]: For 1642407/1642409 co-relation queries the response was YES. [2024-06-27 19:56:18,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86207 conditions, 7376 events. 4608/7376 cut-off events. For 1642407/1642409 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 47372 event pairs, 1400 based on Foata normal form. 6/7381 useless extension candidates. Maximal degree in co-relation 85991. Up to 6811 conditions per place. [2024-06-27 19:56:18,686 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 748 selfloop transitions, 62 changer transitions 0/815 dead transitions. [2024-06-27 19:56:18,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 815 transitions, 16090 flow [2024-06-27 19:56:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:56:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:56:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 19:56:18,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-27 19:56:18,687 INFO L175 Difference]: Start difference. First operand has 452 places, 794 transitions, 13583 flow. Second operand 9 states and 159 transitions. [2024-06-27 19:56:18,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 815 transitions, 16090 flow [2024-06-27 19:56:22,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 815 transitions, 15046 flow, removed 272 selfloop flow, removed 7 redundant places. [2024-06-27 19:56:22,865 INFO L231 Difference]: Finished difference. Result has 455 places, 799 transitions, 12992 flow [2024-06-27 19:56:22,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12559, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12992, PETRI_PLACES=455, PETRI_TRANSITIONS=799} [2024-06-27 19:56:22,865 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 412 predicate places. [2024-06-27 19:56:22,866 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 799 transitions, 12992 flow [2024-06-27 19:56:22,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:22,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:56:22,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:56:22,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-27 19:56:22,866 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:56:22,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:56:22,867 INFO L85 PathProgramCache]: Analyzing trace with hash 42879629, now seen corresponding path program 3 times [2024-06-27 19:56:22,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:56:22,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934558985] [2024-06-27 19:56:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:56:22,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:56:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:56:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:56:23,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:56:23,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934558985] [2024-06-27 19:56:23,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934558985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:56:23,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:56:23,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:56:23,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989620621] [2024-06-27 19:56:23,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:56:23,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:56:23,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:56:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:56:23,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:56:23,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:56:23,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 799 transitions, 12992 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:23,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:56:23,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:56:23,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:56:25,997 INFO L124 PetriNetUnfolderBase]: 4452/7183 cut-off events. [2024-06-27 19:56:25,998 INFO L125 PetriNetUnfolderBase]: For 1641383/1641394 co-relation queries the response was YES. [2024-06-27 19:56:26,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82800 conditions, 7183 events. 4452/7183 cut-off events. For 1641383/1641394 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 46819 event pairs, 1058 based on Foata normal form. 12/7150 useless extension candidates. Maximal degree in co-relation 82583. Up to 6312 conditions per place. [2024-06-27 19:56:26,147 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 642 selfloop transitions, 38 changer transitions 0/810 dead transitions. [2024-06-27 19:56:26,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 810 transitions, 14384 flow [2024-06-27 19:56:26,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:56:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:56:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-27 19:56:26,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41534391534391535 [2024-06-27 19:56:26,148 INFO L175 Difference]: Start difference. First operand has 455 places, 799 transitions, 12992 flow. Second operand 9 states and 157 transitions. [2024-06-27 19:56:26,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 810 transitions, 14384 flow [2024-06-27 19:56:30,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 810 transitions, 13575 flow, removed 163 selfloop flow, removed 9 redundant places. [2024-06-27 19:56:30,568 INFO L231 Difference]: Finished difference. Result has 455 places, 799 transitions, 12265 flow [2024-06-27 19:56:30,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12183, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=761, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12265, PETRI_PLACES=455, PETRI_TRANSITIONS=799} [2024-06-27 19:56:30,569 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 412 predicate places. [2024-06-27 19:56:30,569 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 799 transitions, 12265 flow [2024-06-27 19:56:30,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:30,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:56:30,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:56:30,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-27 19:56:30,570 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:56:30,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:56:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash 471408749, now seen corresponding path program 4 times [2024-06-27 19:56:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:56:30,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922768125] [2024-06-27 19:56:30,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:56:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:56:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:56:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:56:31,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:56:31,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922768125] [2024-06-27 19:56:31,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922768125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:56:31,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:56:31,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:56:31,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184656118] [2024-06-27 19:56:31,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:56:31,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:56:31,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:56:31,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:56:31,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:56:31,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:56:31,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 799 transitions, 12265 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:31,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:56:31,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:56:31,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:56:33,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L792-->L803: Formula: (and (= |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_2| |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_1|) (= |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_2| |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|) (= v_~y$r_buff0_thd2~0_87 v_~y$r_buff1_thd2~0_83) (= v_~y$r_buff0_thd3~0_89 v_~y$r_buff1_thd3~0_77) (= v_~y$w_buff0_used~0_167 1) (= v_~y$w_buff1~0_111 v_~y$w_buff0~0_109) (= v_~y$r_buff0_thd3~0_88 1) (= v_~y$w_buff0_used~0_168 v_~y$w_buff1_used~0_142) (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_45) (= v_~y$w_buff0~0_108 1) (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff1_thd0~0_63) (not (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_167 256) 0)) (not (= (mod v_~y$w_buff1_used~0_142 256) 0)))) 1 0) 0))) InVars {P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_168, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_87, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|} OutVars{P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_2|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_167, P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_2|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_83, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_45, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_88, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_87, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_1|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_1|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_142} AuxVars[] AssignedVars[P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][621], [Black: 2046#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2047#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2045#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 515#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1537#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1031#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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$w_buff0_used~0 0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1019#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 2061#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 2062#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 529#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 2022#true, Black: 1553#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 2082#true, Black: 2078#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1047#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1569#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1049#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 544#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 1583#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 57#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 565#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), 24#L766true, Black: 1074#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1601#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 77#(and (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1100#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1099#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 588#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1617#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 88#(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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1114#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1633#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1126#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 36#P0EXITtrue, Black: 610#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 618#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1647#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1139#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1140#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 64#true, Black: 1152#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1661#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 632#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 638#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1162#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 136#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1676#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 143#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 654#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 653#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1174#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~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) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1693#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 672#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 165#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1192#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 684#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1707#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1708#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 696#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1207#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1208#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1489#true, Black: 1724#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 707#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1223#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~x~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 167#true, Black: 1739#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 722#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1237#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1753#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 2069#true, Black: 1249#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 735#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 0)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 228#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), 29#L803true, Black: 1765#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 748#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1261#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 677#true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 759#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1274#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1783#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1782#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 770#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 769#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1283#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1285#(and (= ~z~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) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1286#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 267#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1800#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 783#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1447#true, Black: 1299#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1300#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 287#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1818#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 795#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 132#true, Black: 1311#(and (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1313#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 810#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1834#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 297#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1327#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1326#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~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) (= ~y$r_buff1_thd1~0 0)), 1857#true, Black: 314#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 825#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1850#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1339#(and (= ~z~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) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1340#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1342#(and (= ~__unbuffered_cnt~0 0) (= ~z~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$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1344#(and (= ~__unbuffered_cnt~0 0) (= ~z~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$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 325#(and (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), 1899#true, 665#true, Black: 1865#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1356#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1357#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 1092#true, Black: 840#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 338#(and (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 841#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1879#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1372#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 352#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 867#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 866#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1893#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 763#true, Black: 364#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1386#(and (= ~__unbuffered_cnt~0 0) (= ~z~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$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1384#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1380#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 879#(and (= ~__unbuffered_cnt~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 881#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1907#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 374#(and (= ~__unbuffered_cnt~0 0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1401#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1402#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 895#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1919#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~x~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 891#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 894#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 386#(and (= ~__unbuffered_cnt~0 0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 893#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1106#true, 2008#true, Black: 1417#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1932#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 909#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 910#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 0)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 398#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 908#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 906#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0)), Black: 1431#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 318#true, Black: 1944#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 925#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 412#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1443#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1956#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 938#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1454#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1968#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 430#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1980#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0)) (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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p2_EAX~0 1))) (= ~y$r_buff1_thd2~0 0) (= 2 ~x~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1468#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1469#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 445#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 20#L852true, Black: 966#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1992#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1423#true, Black: 1485#(and (= ~__unbuffered_cnt~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 461#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 977#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 2004#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1496#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2017#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2016#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 478#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1512#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 991#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 990#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 2031#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2030#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2029#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~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) (= ~y$r_buff1_thd1~0 0)), 1200#true, Black: 2028#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 498#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-27 19:56:33,263 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-27 19:56:33,263 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 19:56:33,263 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 19:56:33,264 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 19:56:33,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L766-->L782: Formula: (let ((.cse4 (= (mod v_~y$r_buff1_thd2~0_48 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd2~0_46 256) 0))) (let ((.cse9 (not .cse8)) (.cse11 (= (mod v_~y$w_buff0_used~0_60 256) 0)) (.cse7 (and .cse4 .cse8)) (.cse10 (and (= (mod v_~y$w_buff1_used~0_57 256) 0) .cse8))) (let ((.cse6 (= (mod v_~y$w_buff1_used~0_56 256) 0)) (.cse0 (or .cse11 .cse7 .cse10)) (.cse1 (and .cse9 (not .cse11))) (.cse5 (= (mod v_~y$w_buff0_used~0_59 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_40 256) 0)))) (and (= v_~y~0_59 v_~y$mem_tmp~0_26) (= v_~__unbuffered_p1_EBX~0_22 (ite .cse0 v_~y~0_59 (ite .cse1 v_~y$w_buff0~0_31 v_~y$w_buff1~0_36))) (= 0 v_~y$flush_delayed~0_40) (= (ite .cse2 v_~y$r_buff1_thd2~0_48 (ite (let ((.cse3 (= (mod v_~y$r_buff0_thd2~0_45 256) 0))) (or (and .cse3 .cse4) .cse5 (and .cse3 .cse6))) v_~y$r_buff1_thd2~0_48 0)) v_~y$r_buff1_thd2~0_47) (= (ite .cse2 v_~y$r_buff0_thd2~0_46 (ite (or .cse7 .cse5 (and .cse6 .cse8)) v_~y$r_buff0_thd2~0_46 (ite (and (not .cse5) .cse9) 0 v_~y$r_buff0_thd2~0_46))) v_~y$r_buff0_thd2~0_45) (= v_~y$w_buff0~0_31 v_~y$w_buff0~0_30) (or (= v_~weak$$choice0~0_16 1) (= v_~weak$$choice0~0_16 0)) (or (= v_~weak$$choice2~0_40 0) (= v_~weak$$choice2~0_40 1)) (= (ite .cse2 v_~y$w_buff0_used~0_60 (ite .cse0 v_~y$w_buff0_used~0_60 (ite .cse1 0 v_~y$w_buff0_used~0_60))) v_~y$w_buff0_used~0_59) (= v_~y$w_buff1~0_36 v_~y$w_buff1~0_35) (= v_~y$w_buff1_used~0_56 (ite .cse2 v_~y$w_buff1_used~0_57 (ite (or .cse7 .cse5 .cse10) v_~y$w_buff1_used~0_57 0))) (= v_~y~0_58 (ite .cse2 v_~y$mem_tmp~0_26 v_~__unbuffered_p1_EBX~0_22)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_48, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_60, ~y$w_buff1~0=v_~y$w_buff1~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_31, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} OutVars{P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_59, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_47, ~weak$$choice0~0=v_~weak$$choice0~0_16, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_45, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_56} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet4, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][173], [Black: 2046#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2047#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2045#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 515#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1537#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1031#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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$w_buff0_used~0 0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1019#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 2061#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 2062#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 529#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 2022#true, Black: 1553#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 2082#true, Black: 2078#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1047#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1569#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1049#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 544#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 1583#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 57#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 565#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1074#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1601#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 77#(and (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1100#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1099#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 588#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1617#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 88#(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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1114#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1633#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1126#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 36#P0EXITtrue, Black: 610#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 618#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1647#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1139#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1140#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 64#true, Black: 1152#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1661#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 632#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 638#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1162#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 136#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1676#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 143#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 654#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 653#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1174#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~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) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1693#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 672#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 165#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 684#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1192#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1707#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1708#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 696#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1207#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1489#true, Black: 1208#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1724#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 707#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1223#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~x~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 167#true, Black: 1739#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 722#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1237#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1753#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 2069#true, Black: 735#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 0)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1249#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 228#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1765#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 748#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1261#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 34#$Ultimate##0true, 677#true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 759#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1274#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1783#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1782#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 770#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 769#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1283#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1285#(and (= ~z~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) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1286#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 267#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1800#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 783#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1447#true, Black: 1299#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1300#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 287#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1818#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 795#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 132#true, Black: 1311#(and (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1313#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 810#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1834#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 461#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 297#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1327#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1326#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~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) (= ~y$r_buff1_thd1~0 0)), 1857#true, Black: 314#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 825#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1850#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1339#(and (= ~z~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) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1340#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1342#(and (= ~__unbuffered_cnt~0 0) (= ~z~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$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1344#(and (= ~__unbuffered_cnt~0 0) (= ~z~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$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 325#(and (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), 1899#true, 665#true, Black: 1865#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1356#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1357#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 1092#true, Black: 840#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 338#(and (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 841#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1879#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1372#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 352#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 867#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 866#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1893#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 763#true, Black: 364#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1386#(and (= ~__unbuffered_cnt~0 0) (= ~z~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$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1384#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1380#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 879#(and (= ~__unbuffered_cnt~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 881#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1907#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 374#(and (= ~__unbuffered_cnt~0 0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1401#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1402#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 895#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1919#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~x~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 891#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 894#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 386#(and (= ~__unbuffered_cnt~0 0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 893#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1106#true, 2008#true, Black: 1417#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1932#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 909#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 910#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 0)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 398#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 908#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 906#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0)), Black: 1431#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1944#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 318#true, Black: 925#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 412#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1443#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1956#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 938#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1454#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1968#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 430#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1980#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0)) (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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p2_EAX~0 1))) (= ~y$r_buff1_thd2~0 0) (= 2 ~x~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1468#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1469#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), 20#L852true, Black: 445#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 966#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1992#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1423#true, Black: 1485#(and (= ~__unbuffered_cnt~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 977#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 2004#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1496#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2017#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2016#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 478#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1512#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 991#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 990#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 2031#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2030#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2029#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~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) (= ~y$r_buff1_thd1~0 0)), 1200#true, Black: 2028#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~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) (= ~y$r_buff1_thd1~0 0)), 35#L782true, Black: 498#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-27 19:56:33,267 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-27 19:56:33,267 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 19:56:33,267 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 19:56:33,267 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 19:56:34,090 INFO L124 PetriNetUnfolderBase]: 4464/7191 cut-off events. [2024-06-27 19:56:34,091 INFO L125 PetriNetUnfolderBase]: For 1679926/1679965 co-relation queries the response was YES. [2024-06-27 19:56:34,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81551 conditions, 7191 events. 4464/7191 cut-off events. For 1679926/1679965 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 46894 event pairs, 1344 based on Foata normal form. 32/7168 useless extension candidates. Maximal degree in co-relation 81336. Up to 6362 conditions per place. [2024-06-27 19:56:34,226 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 662 selfloop transitions, 21 changer transitions 0/813 dead transitions. [2024-06-27 19:56:34,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 813 transitions, 13752 flow [2024-06-27 19:56:34,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:56:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:56:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 19:56:34,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41005291005291006 [2024-06-27 19:56:34,227 INFO L175 Difference]: Start difference. First operand has 455 places, 799 transitions, 12265 flow. Second operand 9 states and 155 transitions. [2024-06-27 19:56:34,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 813 transitions, 13752 flow [2024-06-27 19:56:39,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 813 transitions, 13595 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-27 19:56:39,035 INFO L231 Difference]: Finished difference. Result has 455 places, 802 transitions, 12251 flow [2024-06-27 19:56:39,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12108, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12251, PETRI_PLACES=455, PETRI_TRANSITIONS=802} [2024-06-27 19:56:39,036 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 412 predicate places. [2024-06-27 19:56:39,036 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 802 transitions, 12251 flow [2024-06-27 19:56:39,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:39,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:56:39,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:56:39,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-27 19:56:39,037 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:56:39,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:56:39,037 INFO L85 PathProgramCache]: Analyzing trace with hash 486213419, now seen corresponding path program 5 times [2024-06-27 19:56:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:56:39,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695857311] [2024-06-27 19:56:39,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:56:39,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:56:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:56:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:56:39,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:56:39,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695857311] [2024-06-27 19:56:39,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695857311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:56:39,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:56:39,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:56:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356971668] [2024-06-27 19:56:39,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:56:39,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:56:39,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:56:39,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:56:39,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:56:40,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:56:40,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 802 transitions, 12251 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:40,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:56:40,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:56:40,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:56:41,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L792-->L803: Formula: (and (= |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_2| |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_1|) (= |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_2| |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|) (= v_~y$r_buff0_thd2~0_87 v_~y$r_buff1_thd2~0_83) (= v_~y$r_buff0_thd3~0_89 v_~y$r_buff1_thd3~0_77) (= v_~y$w_buff0_used~0_167 1) (= v_~y$w_buff1~0_111 v_~y$w_buff0~0_109) (= v_~y$r_buff0_thd3~0_88 1) (= v_~y$w_buff0_used~0_168 v_~y$w_buff1_used~0_142) (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_45) (= v_~y$w_buff0~0_108 1) (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff1_thd0~0_63) (not (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_167 256) 0)) (not (= (mod v_~y$w_buff1_used~0_142 256) 0)))) 1 0) 0))) InVars {P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_168, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_87, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|} OutVars{P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_2|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_167, P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_2|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_83, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_45, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_88, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_87, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_1|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_1|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_142} AuxVars[] AssignedVars[P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][620], [Black: 2046#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2047#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2045#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 515#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1537#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1031#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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$w_buff0_used~0 0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1019#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 2061#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 2062#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 529#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 2022#true, Black: 1553#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 2082#true, Black: 2078#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1047#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1569#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1049#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 544#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 2091#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 1583#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 57#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 565#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), 24#L766true, Black: 1074#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1601#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 77#(and (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1100#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 588#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1617#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 88#(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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1114#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1633#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1126#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 36#P0EXITtrue, Black: 610#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 618#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1647#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1139#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1140#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 64#true, Black: 1152#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1661#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 632#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 638#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1162#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 136#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1676#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 143#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 654#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 653#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1174#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~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) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1693#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 672#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 165#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1192#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 684#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1707#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1708#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 696#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1207#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1208#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1489#true, Black: 1724#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 707#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1223#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~x~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 167#true, Black: 1739#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 722#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1237#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1753#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1249#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 735#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 0)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 228#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), 29#L803true, Black: 1765#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 748#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1261#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 677#true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 759#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1274#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1783#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1782#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 770#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 769#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1283#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1285#(and (= ~z~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) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1286#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 267#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1800#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 783#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1447#true, Black: 1299#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1300#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 287#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1818#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 795#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 132#true, Black: 1311#(and (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1313#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 810#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1834#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 297#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1327#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1326#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~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) (= ~y$r_buff1_thd1~0 0)), 1857#true, Black: 314#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 825#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1850#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1339#(and (= ~z~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) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1340#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1342#(and (= ~__unbuffered_cnt~0 0) (= ~z~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$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1344#(and (= ~__unbuffered_cnt~0 0) (= ~z~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$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 325#(and (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), 1899#true, 665#true, Black: 1865#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1356#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1357#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 1092#true, Black: 840#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 338#(and (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 841#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1879#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1372#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 352#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 867#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 866#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1893#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 763#true, Black: 364#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1386#(and (= ~__unbuffered_cnt~0 0) (= ~z~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$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1384#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1380#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 879#(and (= ~__unbuffered_cnt~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 881#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1907#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 374#(and (= ~__unbuffered_cnt~0 0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1401#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1402#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 895#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1919#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~x~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 891#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 894#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 386#(and (= ~__unbuffered_cnt~0 0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 893#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1106#true, 2008#true, Black: 1417#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1932#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 909#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 910#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 0)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 398#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 908#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 906#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0)), Black: 1431#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 318#true, Black: 1944#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 925#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 412#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1443#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1956#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 938#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1454#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1968#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 2097#true, Black: 430#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1980#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0)) (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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p2_EAX~0 1))) (= ~y$r_buff1_thd2~0 0) (= 2 ~x~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1468#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1469#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), 20#L852true, Black: 445#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 966#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1992#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1423#true, Black: 1485#(and (= ~__unbuffered_cnt~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 977#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 461#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 2004#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1496#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2017#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2016#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 478#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1512#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 991#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 990#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 2031#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2030#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2029#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~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) (= ~y$r_buff1_thd1~0 0)), 1200#true, Black: 2028#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 498#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-27 19:56:41,426 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-27 19:56:41,426 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 19:56:41,426 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 19:56:41,426 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 19:56:41,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L766-->L782: Formula: (let ((.cse4 (= (mod v_~y$r_buff1_thd2~0_48 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd2~0_46 256) 0))) (let ((.cse9 (not .cse8)) (.cse11 (= (mod v_~y$w_buff0_used~0_60 256) 0)) (.cse7 (and .cse4 .cse8)) (.cse10 (and (= (mod v_~y$w_buff1_used~0_57 256) 0) .cse8))) (let ((.cse6 (= (mod v_~y$w_buff1_used~0_56 256) 0)) (.cse0 (or .cse11 .cse7 .cse10)) (.cse1 (and .cse9 (not .cse11))) (.cse5 (= (mod v_~y$w_buff0_used~0_59 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_40 256) 0)))) (and (= v_~y~0_59 v_~y$mem_tmp~0_26) (= v_~__unbuffered_p1_EBX~0_22 (ite .cse0 v_~y~0_59 (ite .cse1 v_~y$w_buff0~0_31 v_~y$w_buff1~0_36))) (= 0 v_~y$flush_delayed~0_40) (= (ite .cse2 v_~y$r_buff1_thd2~0_48 (ite (let ((.cse3 (= (mod v_~y$r_buff0_thd2~0_45 256) 0))) (or (and .cse3 .cse4) .cse5 (and .cse3 .cse6))) v_~y$r_buff1_thd2~0_48 0)) v_~y$r_buff1_thd2~0_47) (= (ite .cse2 v_~y$r_buff0_thd2~0_46 (ite (or .cse7 .cse5 (and .cse6 .cse8)) v_~y$r_buff0_thd2~0_46 (ite (and (not .cse5) .cse9) 0 v_~y$r_buff0_thd2~0_46))) v_~y$r_buff0_thd2~0_45) (= v_~y$w_buff0~0_31 v_~y$w_buff0~0_30) (or (= v_~weak$$choice0~0_16 1) (= v_~weak$$choice0~0_16 0)) (or (= v_~weak$$choice2~0_40 0) (= v_~weak$$choice2~0_40 1)) (= (ite .cse2 v_~y$w_buff0_used~0_60 (ite .cse0 v_~y$w_buff0_used~0_60 (ite .cse1 0 v_~y$w_buff0_used~0_60))) v_~y$w_buff0_used~0_59) (= v_~y$w_buff1~0_36 v_~y$w_buff1~0_35) (= v_~y$w_buff1_used~0_56 (ite .cse2 v_~y$w_buff1_used~0_57 (ite (or .cse7 .cse5 .cse10) v_~y$w_buff1_used~0_57 0))) (= v_~y~0_58 (ite .cse2 v_~y$mem_tmp~0_26 v_~__unbuffered_p1_EBX~0_22)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_48, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_60, ~y$w_buff1~0=v_~y$w_buff1~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_31, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} OutVars{P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_59, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_47, ~weak$$choice0~0=v_~weak$$choice0~0_16, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_45, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_56} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet4, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][173], [Black: 2046#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2047#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2045#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 515#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1537#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1031#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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$w_buff0_used~0 0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1019#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 2061#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 2062#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 529#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 2022#true, Black: 1553#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 2082#true, Black: 2078#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1047#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1569#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1049#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 544#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 2091#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 1583#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 57#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 565#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1074#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1601#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 77#(and (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1100#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 588#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1617#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 88#(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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1114#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1633#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 102#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1126#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 36#P0EXITtrue, Black: 610#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 618#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1647#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1139#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1140#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 64#true, Black: 1152#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1661#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 632#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 638#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1162#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 136#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1676#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 143#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 654#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 653#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1174#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~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) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1693#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 ~__unbuffered_p2_EAX~0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 672#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 165#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 684#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1192#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1707#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1708#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 696#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1207#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1208#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1489#true, Black: 1724#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 707#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1223#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~x~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 167#true, Black: 1739#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 722#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1237#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1753#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1249#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 735#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 0)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 228#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1765#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 748#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1261#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 34#$Ultimate##0true, 677#true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 759#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1274#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1783#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1782#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 770#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 769#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1283#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1285#(and (= ~z~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) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1286#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 267#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1800#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 783#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1447#true, Black: 1299#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1300#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 287#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1818#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 795#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 132#true, Black: 1311#(and (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1313#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 810#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1834#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 461#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 297#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1327#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1326#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~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) (= ~y$r_buff1_thd1~0 0)), 1857#true, Black: 314#(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) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 825#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1850#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1339#(and (= ~z~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) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1340#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1342#(and (= ~__unbuffered_cnt~0 0) (= ~z~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$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1344#(and (= ~__unbuffered_cnt~0 0) (= ~z~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$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~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) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 325#(and (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), 1899#true, 665#true, Black: 1865#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1356#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1357#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 1092#true, Black: 840#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 338#(and (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~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) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 841#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1879#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1372#(and (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 352#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 867#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 866#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1893#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 763#true, Black: 1386#(and (= ~__unbuffered_cnt~0 0) (= ~z~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$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 364#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1384#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1380#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 879#(and (= ~__unbuffered_cnt~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 881#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 880#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (or (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= |#ghost~multithreaded| 0)) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 0)) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (or (= |#ghost~multithreaded| 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= |#ghost~multithreaded| 0)) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1907#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 374#(and (= ~__unbuffered_cnt~0 0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1401#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1402#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 895#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1919#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= 2 ~x~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 891#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0)), Black: 894#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (and (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 386#(and (= ~__unbuffered_cnt~0 0) (= ~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 893#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1106#true, 2008#true, Black: 1417#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1932#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 909#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 910#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 0)) (and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 398#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 908#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 906#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$r_buff0_thd1~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0)), Black: 1431#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1944#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 318#true, Black: 925#(and (or (and (= ~__unbuffered_p2_EAX~0 1) (= ~y~0 1)) (= ~y~0 0)) (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 412#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1443#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1956#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 938#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1454#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1968#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 2097#true, Black: 430#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 953#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1980#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0)) (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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p2_EAX~0 1))) (= ~y$r_buff1_thd2~0 0) (= 2 ~x~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1468#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 1469#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), 20#L852true, Black: 445#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 966#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1992#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0)), 1423#true, Black: 1485#(and (= ~__unbuffered_cnt~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 977#(and (= ~__unbuffered_cnt~0 0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 2004#(and (= ~__unbuffered_cnt~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= 2 ~x~0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1496#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2017#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2016#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 478#(and (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 1512#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~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) (or (= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p2_EAX~0 0)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 991#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 990#(and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~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) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0)), Black: 2031#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~__unbuffered_p2_EBX~0 1) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2030#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~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) (= ~y$r_buff1_thd1~0 0)), Black: 2029#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~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) (= ~y$r_buff1_thd1~0 0)), 1200#true, Black: 2028#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~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) (= ~y$r_buff1_thd1~0 0)), 35#L782true, Black: 498#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~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) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~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) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= (* 256 (div ~y$r_buff1_thd1~0 256)) ~y$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-27 19:56:41,429 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-27 19:56:41,430 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 19:56:41,430 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 19:56:41,430 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 19:56:42,262 INFO L124 PetriNetUnfolderBase]: 4460/7182 cut-off events. [2024-06-27 19:56:42,262 INFO L125 PetriNetUnfolderBase]: For 1692338/1692377 co-relation queries the response was YES. [2024-06-27 19:56:42,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81356 conditions, 7182 events. 4460/7182 cut-off events. For 1692338/1692377 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 46777 event pairs, 1344 based on Foata normal form. 32/7159 useless extension candidates. Maximal degree in co-relation 81141. Up to 6350 conditions per place. [2024-06-27 19:56:42,408 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 657 selfloop transitions, 25 changer transitions 0/812 dead transitions. [2024-06-27 19:56:42,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 812 transitions, 13645 flow [2024-06-27 19:56:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:56:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:56:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-27 19:56:42,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-27 19:56:42,409 INFO L175 Difference]: Start difference. First operand has 455 places, 802 transitions, 12251 flow. Second operand 8 states and 142 transitions. [2024-06-27 19:56:42,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 812 transitions, 13645 flow [2024-06-27 19:56:47,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 812 transitions, 13475 flow, removed 66 selfloop flow, removed 7 redundant places. [2024-06-27 19:56:47,175 INFO L231 Difference]: Finished difference. Result has 456 places, 802 transitions, 12143 flow [2024-06-27 19:56:47,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12081, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12143, PETRI_PLACES=456, PETRI_TRANSITIONS=802} [2024-06-27 19:56:47,176 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 413 predicate places. [2024-06-27 19:56:47,176 INFO L495 AbstractCegarLoop]: Abstraction has has 456 places, 802 transitions, 12143 flow [2024-06-27 19:56:47,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:47,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:56:47,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:56:47,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-27 19:56:47,177 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:56:47,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:56:47,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1966656718, now seen corresponding path program 14 times [2024-06-27 19:56:47,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:56:47,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351387442] [2024-06-27 19:56:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:56:47,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:56:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:56:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:56:48,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:56:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351387442] [2024-06-27 19:56:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351387442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:56:48,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:56:48,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:56:48,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606646228] [2024-06-27 19:56:48,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:56:48,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:56:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:56:48,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:56:48,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:56:48,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:56:48,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 802 transitions, 12143 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:48,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:56:48,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:56:48,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:56:50,258 INFO L124 PetriNetUnfolderBase]: 4607/7368 cut-off events. [2024-06-27 19:56:50,258 INFO L125 PetriNetUnfolderBase]: For 1679187/1679189 co-relation queries the response was YES. [2024-06-27 19:56:50,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83073 conditions, 7368 events. 4607/7368 cut-off events. For 1679187/1679189 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 47114 event pairs, 793 based on Foata normal form. 4/7369 useless extension candidates. Maximal degree in co-relation 82857. Up to 6624 conditions per place. [2024-06-27 19:56:50,408 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 707 selfloop transitions, 105 changer transitions 0/817 dead transitions. [2024-06-27 19:56:50,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 817 transitions, 14010 flow [2024-06-27 19:56:50,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:56:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:56:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-27 19:56:50,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2024-06-27 19:56:50,410 INFO L175 Difference]: Start difference. First operand has 456 places, 802 transitions, 12143 flow. Second operand 9 states and 158 transitions. [2024-06-27 19:56:50,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 817 transitions, 14010 flow [2024-06-27 19:56:54,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 817 transitions, 13950 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 19:56:54,502 INFO L231 Difference]: Finished difference. Result has 458 places, 806 transitions, 12519 flow [2024-06-27 19:56:54,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12083, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12519, PETRI_PLACES=458, PETRI_TRANSITIONS=806} [2024-06-27 19:56:54,503 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 415 predicate places. [2024-06-27 19:56:54,503 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 806 transitions, 12519 flow [2024-06-27 19:56:54,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:54,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:56:54,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:56:54,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-27 19:56:54,504 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:56:54,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:56:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash 42879164, now seen corresponding path program 15 times [2024-06-27 19:56:54,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:56:54,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912662130] [2024-06-27 19:56:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:56:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:56:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:56:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:56:55,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:56:55,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912662130] [2024-06-27 19:56:55,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912662130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:56:55,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:56:55,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:56:55,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691238201] [2024-06-27 19:56:55,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:56:55,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:56:55,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:56:55,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:56:55,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:56:55,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:56:55,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 806 transitions, 12519 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:56:55,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:56:55,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:56:55,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:56:57,608 INFO L124 PetriNetUnfolderBase]: 4599/7362 cut-off events. [2024-06-27 19:56:57,608 INFO L125 PetriNetUnfolderBase]: For 1665664/1665666 co-relation queries the response was YES. [2024-06-27 19:56:57,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82813 conditions, 7362 events. 4599/7362 cut-off events. For 1665664/1665666 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 47134 event pairs, 786 based on Foata normal form. 6/7365 useless extension candidates. Maximal degree in co-relation 82596. Up to 6493 conditions per place. [2024-06-27 19:56:57,751 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 685 selfloop transitions, 131 changer transitions 0/821 dead transitions. [2024-06-27 19:56:57,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 821 transitions, 14597 flow [2024-06-27 19:56:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:56:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:56:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-27 19:56:57,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312169312169312 [2024-06-27 19:56:57,752 INFO L175 Difference]: Start difference. First operand has 458 places, 806 transitions, 12519 flow. Second operand 9 states and 163 transitions. [2024-06-27 19:56:57,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 821 transitions, 14597 flow [2024-06-27 19:57:02,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 821 transitions, 14004 flow, removed 194 selfloop flow, removed 7 redundant places. [2024-06-27 19:57:02,169 INFO L231 Difference]: Finished difference. Result has 460 places, 806 transitions, 12199 flow [2024-06-27 19:57:02,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11926, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12199, PETRI_PLACES=460, PETRI_TRANSITIONS=806} [2024-06-27 19:57:02,170 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 417 predicate places. [2024-06-27 19:57:02,170 INFO L495 AbstractCegarLoop]: Abstraction has has 460 places, 806 transitions, 12199 flow [2024-06-27 19:57:02,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:02,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:57:02,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:57:02,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-06-27 19:57:02,170 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:57:02,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:57:02,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1936585743, now seen corresponding path program 1 times [2024-06-27 19:57:02,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:57:02,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995819662] [2024-06-27 19:57:02,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:57:02,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:57:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:57:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:57:02,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:57:02,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995819662] [2024-06-27 19:57:02,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995819662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:57:02,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:57:02,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:57:02,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618154773] [2024-06-27 19:57:02,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:57:02,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:57:02,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:57:02,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:57:02,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:57:03,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:57:03,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 806 transitions, 12199 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:03,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:57:03,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:57:03,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:57:05,253 INFO L124 PetriNetUnfolderBase]: 4462/7237 cut-off events. [2024-06-27 19:57:05,253 INFO L125 PetriNetUnfolderBase]: For 1682803/1682805 co-relation queries the response was YES. [2024-06-27 19:57:05,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81873 conditions, 7237 events. 4462/7237 cut-off events. For 1682803/1682805 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 47322 event pairs, 1327 based on Foata normal form. 2/7237 useless extension candidates. Maximal degree in co-relation 81655. Up to 6556 conditions per place. [2024-06-27 19:57:05,385 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 765 selfloop transitions, 21 changer transitions 0/829 dead transitions. [2024-06-27 19:57:05,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 829 transitions, 13941 flow [2024-06-27 19:57:05,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:57:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:57:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-27 19:57:05,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2024-06-27 19:57:05,386 INFO L175 Difference]: Start difference. First operand has 460 places, 806 transitions, 12199 flow. Second operand 9 states and 164 transitions. [2024-06-27 19:57:05,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 829 transitions, 13941 flow [2024-06-27 19:57:10,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 829 transitions, 13649 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-27 19:57:10,208 INFO L231 Difference]: Finished difference. Result has 461 places, 809 transitions, 12057 flow [2024-06-27 19:57:10,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11907, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12057, PETRI_PLACES=461, PETRI_TRANSITIONS=809} [2024-06-27 19:57:10,208 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 418 predicate places. [2024-06-27 19:57:10,209 INFO L495 AbstractCegarLoop]: Abstraction has has 461 places, 809 transitions, 12057 flow [2024-06-27 19:57:10,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:10,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:57:10,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:57:10,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-06-27 19:57:10,209 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:57:10,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:57:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1968405677, now seen corresponding path program 2 times [2024-06-27 19:57:10,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:57:10,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81413892] [2024-06-27 19:57:10,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:57:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:57:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:57:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:57:11,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:57:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81413892] [2024-06-27 19:57:11,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81413892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:57:11,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:57:11,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:57:11,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578525699] [2024-06-27 19:57:11,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:57:11,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:57:11,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:57:11,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:57:11,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:57:11,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:57:11,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 809 transitions, 12057 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:11,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:57:11,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:57:11,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:57:13,500 INFO L124 PetriNetUnfolderBase]: 4481/7269 cut-off events. [2024-06-27 19:57:13,500 INFO L125 PetriNetUnfolderBase]: For 1715932/1715936 co-relation queries the response was YES. [2024-06-27 19:57:13,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82469 conditions, 7269 events. 4481/7269 cut-off events. For 1715932/1715936 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 47605 event pairs, 1325 based on Foata normal form. 2/7269 useless extension candidates. Maximal degree in co-relation 82251. Up to 6569 conditions per place. [2024-06-27 19:57:13,634 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 767 selfloop transitions, 26 changer transitions 0/836 dead transitions. [2024-06-27 19:57:13,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 836 transitions, 14255 flow [2024-06-27 19:57:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:57:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:57:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 19:57:13,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-27 19:57:13,636 INFO L175 Difference]: Start difference. First operand has 461 places, 809 transitions, 12057 flow. Second operand 9 states and 166 transitions. [2024-06-27 19:57:13,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 836 transitions, 14255 flow [2024-06-27 19:57:18,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 836 transitions, 14127 flow, removed 45 selfloop flow, removed 7 redundant places. [2024-06-27 19:57:18,583 INFO L231 Difference]: Finished difference. Result has 463 places, 816 transitions, 12232 flow [2024-06-27 19:57:18,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11929, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12232, PETRI_PLACES=463, PETRI_TRANSITIONS=816} [2024-06-27 19:57:18,584 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 420 predicate places. [2024-06-27 19:57:18,584 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 816 transitions, 12232 flow [2024-06-27 19:57:18,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:18,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:57:18,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:57:18,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2024-06-27 19:57:18,585 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:57:18,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:57:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2112498017, now seen corresponding path program 3 times [2024-06-27 19:57:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:57:18,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766828376] [2024-06-27 19:57:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:57:18,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:57:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:57:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:57:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:57:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766828376] [2024-06-27 19:57:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766828376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:57:19,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:57:19,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:57:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564970190] [2024-06-27 19:57:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:57:19,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:57:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:57:19,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:57:19,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:57:19,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:57:19,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 816 transitions, 12232 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:19,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:57:19,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:57:19,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:57:21,768 INFO L124 PetriNetUnfolderBase]: 4517/7329 cut-off events. [2024-06-27 19:57:21,768 INFO L125 PetriNetUnfolderBase]: For 1772542/1772546 co-relation queries the response was YES. [2024-06-27 19:57:21,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84283 conditions, 7329 events. 4517/7329 cut-off events. For 1772542/1772546 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 48020 event pairs, 1322 based on Foata normal form. 2/7329 useless extension candidates. Maximal degree in co-relation 84064. Up to 6554 conditions per place. [2024-06-27 19:57:21,908 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 749 selfloop transitions, 53 changer transitions 0/845 dead transitions. [2024-06-27 19:57:21,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 845 transitions, 14860 flow [2024-06-27 19:57:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:57:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:57:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 19:57:21,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470899470899471 [2024-06-27 19:57:21,909 INFO L175 Difference]: Start difference. First operand has 463 places, 816 transitions, 12232 flow. Second operand 9 states and 169 transitions. [2024-06-27 19:57:21,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 845 transitions, 14860 flow [2024-06-27 19:57:26,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 845 transitions, 14705 flow, removed 68 selfloop flow, removed 5 redundant places. [2024-06-27 19:57:26,276 INFO L231 Difference]: Finished difference. Result has 467 places, 826 transitions, 12560 flow [2024-06-27 19:57:26,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12077, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=816, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=769, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12560, PETRI_PLACES=467, PETRI_TRANSITIONS=826} [2024-06-27 19:57:26,277 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 424 predicate places. [2024-06-27 19:57:26,277 INFO L495 AbstractCegarLoop]: Abstraction has has 467 places, 826 transitions, 12560 flow [2024-06-27 19:57:26,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:26,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:57:26,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:57:26,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2024-06-27 19:57:26,277 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:57:26,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:57:26,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2112505953, now seen corresponding path program 1 times [2024-06-27 19:57:26,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:57:26,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324531840] [2024-06-27 19:57:26,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:57:26,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:57:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:57:27,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-06-27 19:57:27,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:57:27,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324531840] [2024-06-27 19:57:27,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324531840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:57:27,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:57:27,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:57:27,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995094646] [2024-06-27 19:57:27,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:57:27,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:57:27,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:57:27,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:57:27,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:57:27,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:57:27,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 826 transitions, 12560 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:27,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:57:27,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:57:27,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:57:29,645 INFO L124 PetriNetUnfolderBase]: 4674/7490 cut-off events. [2024-06-27 19:57:29,645 INFO L125 PetriNetUnfolderBase]: For 1781396/1781396 co-relation queries the response was YES. [2024-06-27 19:57:29,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85837 conditions, 7490 events. 4674/7490 cut-off events. For 1781396/1781396 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 48292 event pairs, 1395 based on Foata normal form. 1/7490 useless extension candidates. Maximal degree in co-relation 85616. Up to 7008 conditions per place. [2024-06-27 19:57:29,784 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 814 selfloop transitions, 21 changer transitions 0/840 dead transitions. [2024-06-27 19:57:29,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 840 transitions, 14276 flow [2024-06-27 19:57:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:57:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:57:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 19:57:29,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2024-06-27 19:57:29,785 INFO L175 Difference]: Start difference. First operand has 467 places, 826 transitions, 12560 flow. Second operand 9 states and 150 transitions. [2024-06-27 19:57:29,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 840 transitions, 14276 flow [2024-06-27 19:57:34,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 840 transitions, 14057 flow, removed 98 selfloop flow, removed 4 redundant places. [2024-06-27 19:57:34,300 INFO L231 Difference]: Finished difference. Result has 472 places, 826 transitions, 12389 flow [2024-06-27 19:57:34,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12341, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=805, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12389, PETRI_PLACES=472, PETRI_TRANSITIONS=826} [2024-06-27 19:57:34,301 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 429 predicate places. [2024-06-27 19:57:34,301 INFO L495 AbstractCegarLoop]: Abstraction has has 472 places, 826 transitions, 12389 flow [2024-06-27 19:57:34,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:34,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:57:34,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:57:34,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2024-06-27 19:57:34,301 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:57:34,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:57:34,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1480344915, now seen corresponding path program 4 times [2024-06-27 19:57:34,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:57:34,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493924318] [2024-06-27 19:57:34,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:57:34,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:57:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:57:35,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-06-27 19:57:35,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:57:35,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493924318] [2024-06-27 19:57:35,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493924318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:57:35,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:57:35,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:57:35,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569553090] [2024-06-27 19:57:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:57:35,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:57:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:57:35,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:57:35,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:57:35,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:57:35,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 826 transitions, 12389 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:35,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:57:35,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:57:35,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:57:37,695 INFO L124 PetriNetUnfolderBase]: 4521/7337 cut-off events. [2024-06-27 19:57:37,696 INFO L125 PetriNetUnfolderBase]: For 1793463/1793465 co-relation queries the response was YES. [2024-06-27 19:57:37,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83961 conditions, 7337 events. 4521/7337 cut-off events. For 1793463/1793465 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 48118 event pairs, 1321 based on Foata normal form. 2/7338 useless extension candidates. Maximal degree in co-relation 83738. Up to 6612 conditions per place. [2024-06-27 19:57:37,838 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 770 selfloop transitions, 34 changer transitions 0/847 dead transitions. [2024-06-27 19:57:37,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 847 transitions, 14503 flow [2024-06-27 19:57:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:57:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:57:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 19:57:37,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-27 19:57:37,839 INFO L175 Difference]: Start difference. First operand has 472 places, 826 transitions, 12389 flow. Second operand 9 states and 166 transitions. [2024-06-27 19:57:37,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 847 transitions, 14503 flow [2024-06-27 19:57:43,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 847 transitions, 14396 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-27 19:57:43,261 INFO L231 Difference]: Finished difference. Result has 473 places, 830 transitions, 12498 flow [2024-06-27 19:57:43,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12282, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12498, PETRI_PLACES=473, PETRI_TRANSITIONS=830} [2024-06-27 19:57:43,261 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 430 predicate places. [2024-06-27 19:57:43,262 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 830 transitions, 12498 flow [2024-06-27 19:57:43,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:43,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:57:43,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:57:43,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2024-06-27 19:57:43,262 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:57:43,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:57:43,263 INFO L85 PathProgramCache]: Analyzing trace with hash 476688235, now seen corresponding path program 5 times [2024-06-27 19:57:43,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:57:43,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083540046] [2024-06-27 19:57:43,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:57:43,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:57:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:57:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:57:44,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:57:44,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083540046] [2024-06-27 19:57:44,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083540046] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:57:44,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:57:44,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:57:44,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193274586] [2024-06-27 19:57:44,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:57:44,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:57:44,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:57:44,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:57:44,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:57:44,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:57:44,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 830 transitions, 12498 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:44,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:57:44,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:57:44,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:57:46,484 INFO L124 PetriNetUnfolderBase]: 4524/7347 cut-off events. [2024-06-27 19:57:46,485 INFO L125 PetriNetUnfolderBase]: For 1814428/1814432 co-relation queries the response was YES. [2024-06-27 19:57:46,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84341 conditions, 7347 events. 4524/7347 cut-off events. For 1814428/1814432 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 48269 event pairs, 1328 based on Foata normal form. 2/7347 useless extension candidates. Maximal degree in co-relation 84117. Up to 6555 conditions per place. [2024-06-27 19:57:46,627 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 759 selfloop transitions, 68 changer transitions 0/870 dead transitions. [2024-06-27 19:57:46,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 870 transitions, 14991 flow [2024-06-27 19:57:46,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:57:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:57:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-27 19:57:46,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2024-06-27 19:57:46,629 INFO L175 Difference]: Start difference. First operand has 473 places, 830 transitions, 12498 flow. Second operand 9 states and 164 transitions. [2024-06-27 19:57:46,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 870 transitions, 14991 flow [2024-06-27 19:57:51,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 870 transitions, 14666 flow, removed 107 selfloop flow, removed 8 redundant places. [2024-06-27 19:57:51,931 INFO L231 Difference]: Finished difference. Result has 476 places, 853 transitions, 12875 flow [2024-06-27 19:57:51,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12259, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12875, PETRI_PLACES=476, PETRI_TRANSITIONS=853} [2024-06-27 19:57:51,931 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 433 predicate places. [2024-06-27 19:57:51,931 INFO L495 AbstractCegarLoop]: Abstraction has has 476 places, 853 transitions, 12875 flow [2024-06-27 19:57:51,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:51,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:57:51,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:57:51,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2024-06-27 19:57:51,932 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:57:51,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:57:51,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1130451795, now seen corresponding path program 6 times [2024-06-27 19:57:51,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:57:51,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060456727] [2024-06-27 19:57:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:57:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:57:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:57:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:57:52,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:57:52,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060456727] [2024-06-27 19:57:52,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060456727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:57:52,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:57:52,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:57:52,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362480078] [2024-06-27 19:57:52,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:57:52,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:57:52,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:57:52,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:57:52,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:57:52,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:57:52,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 853 transitions, 12875 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:52,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:57:52,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:57:52,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:57:55,199 INFO L124 PetriNetUnfolderBase]: 4521/7342 cut-off events. [2024-06-27 19:57:55,199 INFO L125 PetriNetUnfolderBase]: For 1835339/1835345 co-relation queries the response was YES. [2024-06-27 19:57:55,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84848 conditions, 7342 events. 4521/7342 cut-off events. For 1835339/1835345 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 48207 event pairs, 1329 based on Foata normal form. 1/7341 useless extension candidates. Maximal degree in co-relation 84622. Up to 6618 conditions per place. [2024-06-27 19:57:55,340 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 794 selfloop transitions, 34 changer transitions 0/871 dead transitions. [2024-06-27 19:57:55,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 871 transitions, 14767 flow [2024-06-27 19:57:55,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:57:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:57:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-27 19:57:55,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 19:57:55,341 INFO L175 Difference]: Start difference. First operand has 476 places, 853 transitions, 12875 flow. Second operand 9 states and 162 transitions. [2024-06-27 19:57:55,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 871 transitions, 14767 flow [2024-06-27 19:57:59,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 871 transitions, 14568 flow, removed 85 selfloop flow, removed 3 redundant places. [2024-06-27 19:57:59,818 INFO L231 Difference]: Finished difference. Result has 483 places, 858 transitions, 12919 flow [2024-06-27 19:57:59,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12680, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=820, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12919, PETRI_PLACES=483, PETRI_TRANSITIONS=858} [2024-06-27 19:57:59,818 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 440 predicate places. [2024-06-27 19:57:59,819 INFO L495 AbstractCegarLoop]: Abstraction has has 483 places, 858 transitions, 12919 flow [2024-06-27 19:57:59,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:57:59,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:57:59,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:57:59,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2024-06-27 19:57:59,819 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:57:59,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:57:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1130249985, now seen corresponding path program 7 times [2024-06-27 19:57:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:57:59,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889332085] [2024-06-27 19:57:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:57:59,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:57:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:58:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:58:00,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:58:00,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889332085] [2024-06-27 19:58:00,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889332085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:58:00,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:58:00,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:58:00,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961579517] [2024-06-27 19:58:00,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:58:00,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:58:00,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:58:00,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:58:00,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:58:00,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 19:58:00,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 858 transitions, 12919 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:00,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:58:00,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 19:58:01,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:58:03,247 INFO L124 PetriNetUnfolderBase]: 4538/7367 cut-off events. [2024-06-27 19:58:03,248 INFO L125 PetriNetUnfolderBase]: For 1873194/1873198 co-relation queries the response was YES. [2024-06-27 19:58:03,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85312 conditions, 7367 events. 4538/7367 cut-off events. For 1873194/1873198 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 48376 event pairs, 1328 based on Foata normal form. 2/7368 useless extension candidates. Maximal degree in co-relation 85083. Up to 6604 conditions per place. [2024-06-27 19:58:03,389 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 785 selfloop transitions, 56 changer transitions 0/884 dead transitions. [2024-06-27 19:58:03,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 884 transitions, 15647 flow [2024-06-27 19:58:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:58:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:58:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-27 19:58:03,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2024-06-27 19:58:03,390 INFO L175 Difference]: Start difference. First operand has 483 places, 858 transitions, 12919 flow. Second operand 9 states and 170 transitions. [2024-06-27 19:58:03,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 884 transitions, 15647 flow [2024-06-27 19:58:09,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 884 transitions, 15368 flow, removed 123 selfloop flow, removed 5 redundant places. [2024-06-27 19:58:09,201 INFO L231 Difference]: Finished difference. Result has 487 places, 868 transitions, 13154 flow [2024-06-27 19:58:09,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12668, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=808, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13154, PETRI_PLACES=487, PETRI_TRANSITIONS=868} [2024-06-27 19:58:09,202 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 444 predicate places. [2024-06-27 19:58:09,202 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 868 transitions, 13154 flow [2024-06-27 19:58:09,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:09,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:58:09,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:58:09,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2024-06-27 19:58:09,203 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:58:09,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:58:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1623552247, now seen corresponding path program 1 times [2024-06-27 19:58:09,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:58:09,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469909848] [2024-06-27 19:58:09,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:58:09,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:58:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:58:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:58:09,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:58:09,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469909848] [2024-06-27 19:58:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469909848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:58:09,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:58:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:58:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973029609] [2024-06-27 19:58:09,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:58:09,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:58:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:58:09,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:58:09,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:58:09,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:58:09,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 868 transitions, 13154 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:09,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:58:09,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:58:09,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:58:12,321 INFO L124 PetriNetUnfolderBase]: 4726/7572 cut-off events. [2024-06-27 19:58:12,321 INFO L125 PetriNetUnfolderBase]: For 1911497/1911501 co-relation queries the response was YES. [2024-06-27 19:58:12,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87296 conditions, 7572 events. 4726/7572 cut-off events. For 1911497/1911501 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 48804 event pairs, 848 based on Foata normal form. 8/7579 useless extension candidates. Maximal degree in co-relation 87065. Up to 6815 conditions per place. [2024-06-27 19:58:12,465 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 827 selfloop transitions, 71 changer transitions 0/903 dead transitions. [2024-06-27 19:58:12,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 903 transitions, 15225 flow [2024-06-27 19:58:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:58:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:58:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-27 19:58:12,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 19:58:12,466 INFO L175 Difference]: Start difference. First operand has 487 places, 868 transitions, 13154 flow. Second operand 10 states and 189 transitions. [2024-06-27 19:58:12,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 903 transitions, 15225 flow [2024-06-27 19:58:17,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 903 transitions, 15006 flow, removed 94 selfloop flow, removed 4 redundant places. [2024-06-27 19:58:17,791 INFO L231 Difference]: Finished difference. Result has 493 places, 871 transitions, 13261 flow [2024-06-27 19:58:17,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12935, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=868, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13261, PETRI_PLACES=493, PETRI_TRANSITIONS=871} [2024-06-27 19:58:17,792 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 450 predicate places. [2024-06-27 19:58:17,792 INFO L495 AbstractCegarLoop]: Abstraction has has 493 places, 871 transitions, 13261 flow [2024-06-27 19:58:17,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:17,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:58:17,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:58:17,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2024-06-27 19:58:17,792 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:58:17,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:58:17,793 INFO L85 PathProgramCache]: Analyzing trace with hash 374564279, now seen corresponding path program 2 times [2024-06-27 19:58:17,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:58:17,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135963464] [2024-06-27 19:58:17,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:58:17,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:58:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:58:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:58:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:58:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135963464] [2024-06-27 19:58:18,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135963464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:58:18,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:58:18,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:58:18,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896390589] [2024-06-27 19:58:18,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:58:18,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:58:18,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:58:18,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:58:18,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:58:18,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:58:18,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 871 transitions, 13261 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:18,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:58:18,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:58:18,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:58:21,072 INFO L124 PetriNetUnfolderBase]: 4742/7596 cut-off events. [2024-06-27 19:58:21,072 INFO L125 PetriNetUnfolderBase]: For 1942744/1942748 co-relation queries the response was YES. [2024-06-27 19:58:21,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88190 conditions, 7596 events. 4742/7596 cut-off events. For 1942744/1942748 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 48901 event pairs, 874 based on Foata normal form. 8/7603 useless extension candidates. Maximal degree in co-relation 87957. Up to 6906 conditions per place. [2024-06-27 19:58:21,224 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 827 selfloop transitions, 69 changer transitions 0/901 dead transitions. [2024-06-27 19:58:21,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 901 transitions, 15317 flow [2024-06-27 19:58:21,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:58:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:58:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-27 19:58:21,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 19:58:21,226 INFO L175 Difference]: Start difference. First operand has 493 places, 871 transitions, 13261 flow. Second operand 10 states and 185 transitions. [2024-06-27 19:58:21,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 901 transitions, 15317 flow [2024-06-27 19:58:26,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 901 transitions, 15028 flow, removed 82 selfloop flow, removed 7 redundant places. [2024-06-27 19:58:26,868 INFO L231 Difference]: Finished difference. Result has 496 places, 874 transitions, 13299 flow [2024-06-27 19:58:26,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12972, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=871, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=802, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13299, PETRI_PLACES=496, PETRI_TRANSITIONS=874} [2024-06-27 19:58:26,868 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 453 predicate places. [2024-06-27 19:58:26,869 INFO L495 AbstractCegarLoop]: Abstraction has has 496 places, 874 transitions, 13299 flow [2024-06-27 19:58:26,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:26,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:58:26,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:58:26,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2024-06-27 19:58:26,869 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:58:26,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:58:26,870 INFO L85 PathProgramCache]: Analyzing trace with hash 394582529, now seen corresponding path program 3 times [2024-06-27 19:58:26,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:58:26,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363070105] [2024-06-27 19:58:26,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:58:26,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:58:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:58:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:58:27,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:58:27,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363070105] [2024-06-27 19:58:27,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363070105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:58:27,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:58:27,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:58:27,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227030441] [2024-06-27 19:58:27,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:58:27,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:58:27,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:58:27,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:58:27,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:58:27,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:58:27,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 874 transitions, 13299 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:27,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:58:27,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:58:27,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:58:30,149 INFO L124 PetriNetUnfolderBase]: 4758/7620 cut-off events. [2024-06-27 19:58:30,150 INFO L125 PetriNetUnfolderBase]: For 1970831/1970835 co-relation queries the response was YES. [2024-06-27 19:58:30,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88656 conditions, 7620 events. 4758/7620 cut-off events. For 1970831/1970835 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 49127 event pairs, 883 based on Foata normal form. 8/7627 useless extension candidates. Maximal degree in co-relation 88422. Up to 6950 conditions per place. [2024-06-27 19:58:30,306 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 827 selfloop transitions, 71 changer transitions 0/903 dead transitions. [2024-06-27 19:58:30,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 903 transitions, 15363 flow [2024-06-27 19:58:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:58:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:58:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-27 19:58:30,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 19:58:30,308 INFO L175 Difference]: Start difference. First operand has 496 places, 874 transitions, 13299 flow. Second operand 10 states and 185 transitions. [2024-06-27 19:58:30,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 903 transitions, 15363 flow [2024-06-27 19:58:36,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 903 transitions, 15070 flow, removed 85 selfloop flow, removed 7 redundant places. [2024-06-27 19:58:36,485 INFO L231 Difference]: Finished difference. Result has 499 places, 877 transitions, 13343 flow [2024-06-27 19:58:36,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13006, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=874, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=803, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13343, PETRI_PLACES=499, PETRI_TRANSITIONS=877} [2024-06-27 19:58:36,486 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 456 predicate places. [2024-06-27 19:58:36,486 INFO L495 AbstractCegarLoop]: Abstraction has has 499 places, 877 transitions, 13343 flow [2024-06-27 19:58:36,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:36,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:58:36,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:58:36,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2024-06-27 19:58:36,486 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:58:36,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:58:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1439980489, now seen corresponding path program 4 times [2024-06-27 19:58:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:58:36,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583224876] [2024-06-27 19:58:36,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:58:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:58:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:58:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:58:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:58:37,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583224876] [2024-06-27 19:58:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583224876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:58:37,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:58:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:58:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072570411] [2024-06-27 19:58:37,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:58:37,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:58:37,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:58:37,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:58:37,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:58:37,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:58:37,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 877 transitions, 13343 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:37,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:58:37,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:58:37,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:58:39,725 INFO L124 PetriNetUnfolderBase]: 4782/7656 cut-off events. [2024-06-27 19:58:39,725 INFO L125 PetriNetUnfolderBase]: For 1995728/1995732 co-relation queries the response was YES. [2024-06-27 19:58:39,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89183 conditions, 7656 events. 4782/7656 cut-off events. For 1995728/1995732 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 49290 event pairs, 677 based on Foata normal form. 8/7663 useless extension candidates. Maximal degree in co-relation 88948. Up to 6770 conditions per place. [2024-06-27 19:58:39,889 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 825 selfloop transitions, 84 changer transitions 0/914 dead transitions. [2024-06-27 19:58:39,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 914 transitions, 15463 flow [2024-06-27 19:58:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:58:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:58:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-27 19:58:39,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-27 19:58:39,890 INFO L175 Difference]: Start difference. First operand has 499 places, 877 transitions, 13343 flow. Second operand 10 states and 188 transitions. [2024-06-27 19:58:39,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 914 transitions, 15463 flow [2024-06-27 19:58:45,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 914 transitions, 15150 flow, removed 88 selfloop flow, removed 8 redundant places. [2024-06-27 19:58:45,646 INFO L231 Difference]: Finished difference. Result has 501 places, 882 transitions, 13414 flow [2024-06-27 19:58:45,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13030, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=877, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13414, PETRI_PLACES=501, PETRI_TRANSITIONS=882} [2024-06-27 19:58:45,646 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 458 predicate places. [2024-06-27 19:58:45,647 INFO L495 AbstractCegarLoop]: Abstraction has has 501 places, 882 transitions, 13414 flow [2024-06-27 19:58:45,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:45,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:58:45,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:58:45,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2024-06-27 19:58:45,647 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:58:45,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:58:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1159001403, now seen corresponding path program 5 times [2024-06-27 19:58:45,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:58:45,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893383130] [2024-06-27 19:58:45,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:58:45,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:58:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:58:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:58:46,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:58:46,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893383130] [2024-06-27 19:58:46,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893383130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:58:46,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:58:46,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:58:46,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147312569] [2024-06-27 19:58:46,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:58:46,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:58:46,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:58:46,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:58:46,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:58:46,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:58:46,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 882 transitions, 13414 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:46,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:58:46,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:58:46,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:58:48,790 INFO L124 PetriNetUnfolderBase]: 4830/7726 cut-off events. [2024-06-27 19:58:48,790 INFO L125 PetriNetUnfolderBase]: For 2029103/2029107 co-relation queries the response was YES. [2024-06-27 19:58:48,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90397 conditions, 7726 events. 4830/7726 cut-off events. For 2029103/2029107 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 49844 event pairs, 777 based on Foata normal form. 8/7733 useless extension candidates. Maximal degree in co-relation 90161. Up to 6928 conditions per place. [2024-06-27 19:58:48,942 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 841 selfloop transitions, 75 changer transitions 0/921 dead transitions. [2024-06-27 19:58:48,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 921 transitions, 15750 flow [2024-06-27 19:58:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:58:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:58:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-27 19:58:48,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-27 19:58:48,943 INFO L175 Difference]: Start difference. First operand has 501 places, 882 transitions, 13414 flow. Second operand 10 states and 188 transitions. [2024-06-27 19:58:48,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 921 transitions, 15750 flow [2024-06-27 19:58:53,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 921 transitions, 15233 flow, removed 176 selfloop flow, removed 8 redundant places. [2024-06-27 19:58:53,811 INFO L231 Difference]: Finished difference. Result has 503 places, 891 transitions, 13488 flow [2024-06-27 19:58:53,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13078, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=882, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=807, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13488, PETRI_PLACES=503, PETRI_TRANSITIONS=891} [2024-06-27 19:58:53,812 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 460 predicate places. [2024-06-27 19:58:53,812 INFO L495 AbstractCegarLoop]: Abstraction has has 503 places, 891 transitions, 13488 flow [2024-06-27 19:58:53,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:53,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:58:53,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:58:53,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2024-06-27 19:58:53,813 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:58:53,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:58:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1454576793, now seen corresponding path program 6 times [2024-06-27 19:58:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:58:53,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335435680] [2024-06-27 19:58:53,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:58:53,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:58:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:58:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:58:54,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:58:54,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335435680] [2024-06-27 19:58:54,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335435680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:58:54,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:58:54,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:58:54,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054129452] [2024-06-27 19:58:54,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:58:54,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:58:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:58:54,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:58:54,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:58:54,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:58:54,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 891 transitions, 13488 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:58:54,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:58:54,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:58:54,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:58:57,166 INFO L124 PetriNetUnfolderBase]: 4862/7774 cut-off events. [2024-06-27 19:58:57,166 INFO L125 PetriNetUnfolderBase]: For 2050496/2050500 co-relation queries the response was YES. [2024-06-27 19:58:57,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90562 conditions, 7774 events. 4862/7774 cut-off events. For 2050496/2050500 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 50171 event pairs, 818 based on Foata normal form. 8/7781 useless extension candidates. Maximal degree in co-relation 90325. Up to 7098 conditions per place. [2024-06-27 19:58:57,320 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 846 selfloop transitions, 70 changer transitions 0/921 dead transitions. [2024-06-27 19:58:57,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 921 transitions, 15608 flow [2024-06-27 19:58:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:58:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:58:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-27 19:58:57,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-27 19:58:57,322 INFO L175 Difference]: Start difference. First operand has 503 places, 891 transitions, 13488 flow. Second operand 10 states and 184 transitions. [2024-06-27 19:58:57,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 921 transitions, 15608 flow [2024-06-27 19:59:03,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 921 transitions, 15294 flow, removed 88 selfloop flow, removed 8 redundant places. [2024-06-27 19:59:03,899 INFO L231 Difference]: Finished difference. Result has 505 places, 897 transitions, 13548 flow [2024-06-27 19:59:03,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13174, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=821, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13548, PETRI_PLACES=505, PETRI_TRANSITIONS=897} [2024-06-27 19:59:03,899 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 462 predicate places. [2024-06-27 19:59:03,899 INFO L495 AbstractCegarLoop]: Abstraction has has 505 places, 897 transitions, 13548 flow [2024-06-27 19:59:03,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:59:03,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:59:03,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:59:03,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2024-06-27 19:59:03,900 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:59:03,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:59:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1454220603, now seen corresponding path program 7 times [2024-06-27 19:59:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:59:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756055735] [2024-06-27 19:59:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:59:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:59:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:59:04,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-06-27 19:59:04,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:59:04,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756055735] [2024-06-27 19:59:04,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756055735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:59:04,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:59:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:59:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600297416] [2024-06-27 19:59:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:59:04,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:59:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:59:04,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:59:04,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:59:04,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:59:04,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 897 transitions, 13548 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:59:04,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:59:04,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:59:04,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:59:07,713 INFO L124 PetriNetUnfolderBase]: 4894/7824 cut-off events. [2024-06-27 19:59:07,713 INFO L125 PetriNetUnfolderBase]: For 2078088/2078092 co-relation queries the response was YES. [2024-06-27 19:59:07,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91111 conditions, 7824 events. 4894/7824 cut-off events. For 2078088/2078092 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 50532 event pairs, 818 based on Foata normal form. 8/7831 useless extension candidates. Maximal degree in co-relation 90873. Up to 7126 conditions per place. [2024-06-27 19:59:07,857 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 855 selfloop transitions, 68 changer transitions 0/928 dead transitions. [2024-06-27 19:59:07,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 928 transitions, 15690 flow [2024-06-27 19:59:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:59:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:59:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-27 19:59:07,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-27 19:59:07,858 INFO L175 Difference]: Start difference. First operand has 505 places, 897 transitions, 13548 flow. Second operand 10 states and 184 transitions. [2024-06-27 19:59:07,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 928 transitions, 15690 flow [2024-06-27 19:59:13,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 928 transitions, 15370 flow, removed 94 selfloop flow, removed 8 redundant places. [2024-06-27 19:59:13,906 INFO L231 Difference]: Finished difference. Result has 507 places, 903 transitions, 13604 flow [2024-06-27 19:59:13,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13228, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13604, PETRI_PLACES=507, PETRI_TRANSITIONS=903} [2024-06-27 19:59:13,907 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 464 predicate places. [2024-06-27 19:59:13,907 INFO L495 AbstractCegarLoop]: Abstraction has has 507 places, 903 transitions, 13604 flow [2024-06-27 19:59:13,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:59:13,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:59:13,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:59:13,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2024-06-27 19:59:13,908 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:59:13,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:59:13,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1982769133, now seen corresponding path program 8 times [2024-06-27 19:59:13,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:59:13,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920136478] [2024-06-27 19:59:13,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:59:13,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:59:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:59:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:59:14,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:59:14,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920136478] [2024-06-27 19:59:14,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920136478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:59:14,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:59:14,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:59:14,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450361697] [2024-06-27 19:59:14,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:59:14,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:59:14,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:59:14,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:59:14,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:59:14,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:59:15,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 903 transitions, 13604 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:59:15,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:59:15,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:59:15,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:59:17,840 INFO L124 PetriNetUnfolderBase]: 4910/7845 cut-off events. [2024-06-27 19:59:17,840 INFO L125 PetriNetUnfolderBase]: For 2106709/2106711 co-relation queries the response was YES. [2024-06-27 19:59:17,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91651 conditions, 7845 events. 4910/7845 cut-off events. For 2106709/2106711 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 50647 event pairs, 817 based on Foata normal form. 6/7850 useless extension candidates. Maximal degree in co-relation 91412. Up to 7133 conditions per place. [2024-06-27 19:59:17,999 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 842 selfloop transitions, 80 changer transitions 0/927 dead transitions. [2024-06-27 19:59:17,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 927 transitions, 15726 flow [2024-06-27 19:59:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:59:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:59:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-27 19:59:18,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.430952380952381 [2024-06-27 19:59:18,000 INFO L175 Difference]: Start difference. First operand has 507 places, 903 transitions, 13604 flow. Second operand 10 states and 181 transitions. [2024-06-27 19:59:18,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 927 transitions, 15726 flow [2024-06-27 19:59:24,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 927 transitions, 15404 flow, removed 97 selfloop flow, removed 8 redundant places. [2024-06-27 19:59:24,027 INFO L231 Difference]: Finished difference. Result has 509 places, 906 transitions, 13666 flow [2024-06-27 19:59:24,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13282, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=823, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13666, PETRI_PLACES=509, PETRI_TRANSITIONS=906} [2024-06-27 19:59:24,028 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 466 predicate places. [2024-06-27 19:59:24,028 INFO L495 AbstractCegarLoop]: Abstraction has has 509 places, 906 transitions, 13666 flow [2024-06-27 19:59:24,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:59:24,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:59:24,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:59:24,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2024-06-27 19:59:24,028 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:59:24,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:59:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1983125323, now seen corresponding path program 9 times [2024-06-27 19:59:24,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:59:24,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649881685] [2024-06-27 19:59:24,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:59:24,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:59:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:59:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:59:24,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:59:24,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649881685] [2024-06-27 19:59:24,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649881685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:59:24,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:59:24,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:59:24,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208756701] [2024-06-27 19:59:24,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:59:24,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:59:24,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:59:24,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:59:24,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:59:25,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:59:25,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 906 transitions, 13666 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:59:25,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:59:25,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:59:25,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:59:27,789 INFO L124 PetriNetUnfolderBase]: 4926/7869 cut-off events. [2024-06-27 19:59:27,790 INFO L125 PetriNetUnfolderBase]: For 2135106/2135108 co-relation queries the response was YES. [2024-06-27 19:59:27,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92166 conditions, 7869 events. 4926/7869 cut-off events. For 2135106/2135108 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 50816 event pairs, 815 based on Foata normal form. 6/7874 useless extension candidates. Maximal degree in co-relation 91926. Up to 7147 conditions per place. [2024-06-27 19:59:27,937 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 847 selfloop transitions, 79 changer transitions 0/931 dead transitions. [2024-06-27 19:59:27,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 931 transitions, 15804 flow [2024-06-27 19:59:27,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:59:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:59:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-27 19:59:27,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.430952380952381 [2024-06-27 19:59:27,938 INFO L175 Difference]: Start difference. First operand has 509 places, 906 transitions, 13666 flow. Second operand 10 states and 181 transitions. [2024-06-27 19:59:27,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 931 transitions, 15804 flow [2024-06-27 19:59:34,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 931 transitions, 15442 flow, removed 103 selfloop flow, removed 8 redundant places. [2024-06-27 19:59:34,837 INFO L231 Difference]: Finished difference. Result has 511 places, 909 transitions, 13692 flow [2024-06-27 19:59:34,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13304, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=906, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=827, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13692, PETRI_PLACES=511, PETRI_TRANSITIONS=909} [2024-06-27 19:59:34,838 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 468 predicate places. [2024-06-27 19:59:34,838 INFO L495 AbstractCegarLoop]: Abstraction has has 511 places, 909 transitions, 13692 flow [2024-06-27 19:59:34,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:59:34,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:59:34,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:59:34,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2024-06-27 19:59:34,839 INFO L420 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:59:34,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:59:34,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1712355319, now seen corresponding path program 10 times [2024-06-27 19:59:34,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:59:34,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305566889] [2024-06-27 19:59:34,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:59:34,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:59:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:59:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:59:35,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:59:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305566889] [2024-06-27 19:59:35,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305566889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:59:35,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:59:35,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:59:35,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169965323] [2024-06-27 19:59:35,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:59:35,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:59:35,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:59:35,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:59:35,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:59:35,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:59:35,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 909 transitions, 13692 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:59:35,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:59:35,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:59:35,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:59:38,587 INFO L124 PetriNetUnfolderBase]: 4942/7891 cut-off events. [2024-06-27 19:59:38,587 INFO L125 PetriNetUnfolderBase]: For 2162629/2162631 co-relation queries the response was YES. [2024-06-27 19:59:38,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92651 conditions, 7891 events. 4942/7891 cut-off events. For 2162629/2162631 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 50951 event pairs, 821 based on Foata normal form. 6/7896 useless extension candidates. Maximal degree in co-relation 92410. Up to 7104 conditions per place. [2024-06-27 19:59:38,741 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 820 selfloop transitions, 108 changer transitions 0/933 dead transitions. [2024-06-27 19:59:38,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 933 transitions, 15838 flow [2024-06-27 19:59:38,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:59:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:59:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-27 19:59:38,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-27 19:59:38,742 INFO L175 Difference]: Start difference. First operand has 511 places, 909 transitions, 13692 flow. Second operand 10 states and 182 transitions. [2024-06-27 19:59:38,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 933 transitions, 15838 flow [2024-06-27 19:59:45,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 933 transitions, 15472 flow, removed 106 selfloop flow, removed 8 redundant places. [2024-06-27 19:59:45,226 INFO L231 Difference]: Finished difference. Result has 513 places, 912 transitions, 13778 flow [2024-06-27 19:59:45,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13326, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=801, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13778, PETRI_PLACES=513, PETRI_TRANSITIONS=912} [2024-06-27 19:59:45,226 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 470 predicate places. [2024-06-27 19:59:45,226 INFO L495 AbstractCegarLoop]: Abstraction has has 513 places, 912 transitions, 13778 flow [2024-06-27 19:59:45,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:59:45,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:59:45,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:59:45,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2024-06-27 19:59:45,227 INFO L420 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:59:45,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:59:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash 299247998, now seen corresponding path program 1 times [2024-06-27 19:59:45,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:59:45,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863897236] [2024-06-27 19:59:45,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:59:45,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:59:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:59:45,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-06-27 19:59:45,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:59:45,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863897236] [2024-06-27 19:59:45,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863897236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:59:45,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:59:45,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:59:45,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424537286] [2024-06-27 19:59:45,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:59:45,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:59:45,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:59:45,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:59:45,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:59:45,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:59:45,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 912 transitions, 13778 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:59:45,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:59:45,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:59:45,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:59:48,726 INFO L124 PetriNetUnfolderBase]: 4980/7964 cut-off events. [2024-06-27 19:59:48,727 INFO L125 PetriNetUnfolderBase]: For 2161776/2161780 co-relation queries the response was YES. [2024-06-27 19:59:48,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93281 conditions, 7964 events. 4980/7964 cut-off events. For 2161776/2161780 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 51649 event pairs, 848 based on Foata normal form. 4/7967 useless extension candidates. Maximal degree in co-relation 93039. Up to 7153 conditions per place. [2024-06-27 19:59:48,892 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 848 selfloop transitions, 104 changer transitions 0/957 dead transitions. [2024-06-27 19:59:48,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 957 transitions, 16152 flow [2024-06-27 19:59:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:59:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:59:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 19:59:48,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 19:59:48,894 INFO L175 Difference]: Start difference. First operand has 513 places, 912 transitions, 13778 flow. Second operand 9 states and 175 transitions. [2024-06-27 19:59:48,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 957 transitions, 16152 flow [2024-06-27 19:59:54,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 957 transitions, 15758 flow, removed 109 selfloop flow, removed 7 redundant places. [2024-06-27 19:59:54,581 INFO L231 Difference]: Finished difference. Result has 516 places, 930 transitions, 14010 flow [2024-06-27 19:59:54,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13384, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=820, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14010, PETRI_PLACES=516, PETRI_TRANSITIONS=930} [2024-06-27 19:59:54,582 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 473 predicate places. [2024-06-27 19:59:54,582 INFO L495 AbstractCegarLoop]: Abstraction has has 516 places, 930 transitions, 14010 flow [2024-06-27 19:59:54,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:59:54,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:59:54,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:59:54,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2024-06-27 19:59:54,582 INFO L420 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 19:59:54,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:59:54,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1670675232, now seen corresponding path program 2 times [2024-06-27 19:59:54,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:59:54,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782518228] [2024-06-27 19:59:54,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:59:54,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:59:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:59:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:59:55,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:59:55,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782518228] [2024-06-27 19:59:55,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782518228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:59:55,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:59:55,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:59:55,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706400626] [2024-06-27 19:59:55,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:59:55,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:59:55,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:59:55,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:59:55,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:59:55,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 19:59:55,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 930 transitions, 14010 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:59:55,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:59:55,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 19:59:55,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:59:58,085 INFO L124 PetriNetUnfolderBase]: 5006/7996 cut-off events. [2024-06-27 19:59:58,085 INFO L125 PetriNetUnfolderBase]: For 2205139/2205143 co-relation queries the response was YES. [2024-06-27 19:59:58,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94102 conditions, 7996 events. 5006/7996 cut-off events. For 2205139/2205143 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 51751 event pairs, 842 based on Foata normal form. 4/7999 useless extension candidates. Maximal degree in co-relation 93858. Up to 7156 conditions per place. [2024-06-27 19:59:58,406 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 841 selfloop transitions, 116 changer transitions 0/962 dead transitions. [2024-06-27 19:59:58,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 962 transitions, 16608 flow [2024-06-27 19:59:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:59:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:59:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-27 19:59:58,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2024-06-27 19:59:58,408 INFO L175 Difference]: Start difference. First operand has 516 places, 930 transitions, 14010 flow. Second operand 9 states and 176 transitions. [2024-06-27 19:59:58,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 962 transitions, 16608 flow [2024-06-27 20:00:04,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 962 transitions, 16391 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-27 20:00:04,532 INFO L231 Difference]: Finished difference. Result has 521 places, 936 transitions, 14290 flow [2024-06-27 20:00:04,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13793, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14290, PETRI_PLACES=521, PETRI_TRANSITIONS=936} [2024-06-27 20:00:04,532 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 478 predicate places. [2024-06-27 20:00:04,533 INFO L495 AbstractCegarLoop]: Abstraction has has 521 places, 936 transitions, 14290 flow [2024-06-27 20:00:04,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:00:04,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:00:04,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:00:04,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2024-06-27 20:00:04,533 INFO L420 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:00:04,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:00:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1329124042, now seen corresponding path program 3 times [2024-06-27 20:00:04,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:00:04,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661923671] [2024-06-27 20:00:04,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:00:04,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:00:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:00:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:00:05,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:00:05,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661923671] [2024-06-27 20:00:05,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661923671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:00:05,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:00:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:00:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54550709] [2024-06-27 20:00:05,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:00:05,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:00:05,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:00:05,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:00:05,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:00:05,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 20:00:05,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 936 transitions, 14290 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:00:05,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:00:05,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 20:00:05,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:00:08,306 INFO L124 PetriNetUnfolderBase]: 5023/8016 cut-off events. [2024-06-27 20:00:08,306 INFO L125 PetriNetUnfolderBase]: For 2233759/2233761 co-relation queries the response was YES. [2024-06-27 20:00:08,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94605 conditions, 8016 events. 5023/8016 cut-off events. For 2233759/2233761 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 51863 event pairs, 821 based on Foata normal form. 2/8017 useless extension candidates. Maximal degree in co-relation 94360. Up to 7211 conditions per place. [2024-06-27 20:00:08,466 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 865 selfloop transitions, 102 changer transitions 0/972 dead transitions. [2024-06-27 20:00:08,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 972 transitions, 16546 flow [2024-06-27 20:00:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:00:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:00:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-27 20:00:08,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45476190476190476 [2024-06-27 20:00:08,468 INFO L175 Difference]: Start difference. First operand has 521 places, 936 transitions, 14290 flow. Second operand 10 states and 191 transitions. [2024-06-27 20:00:08,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 972 transitions, 16546 flow [2024-06-27 20:00:14,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 972 transitions, 16318 flow, removed 52 selfloop flow, removed 5 redundant places. [2024-06-27 20:00:14,966 INFO L231 Difference]: Finished difference. Result has 526 places, 942 transitions, 14470 flow [2024-06-27 20:00:14,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14069, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14470, PETRI_PLACES=526, PETRI_TRANSITIONS=942} [2024-06-27 20:00:14,967 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 483 predicate places. [2024-06-27 20:00:14,967 INFO L495 AbstractCegarLoop]: Abstraction has has 526 places, 942 transitions, 14470 flow [2024-06-27 20:00:14,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:00:14,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:00:14,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:00:14,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2024-06-27 20:00:14,968 INFO L420 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:00:14,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:00:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash 532139363, now seen corresponding path program 1 times [2024-06-27 20:00:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:00:14,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605669934] [2024-06-27 20:00:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:00:14,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:00:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:00:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:00:15,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:00:15,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605669934] [2024-06-27 20:00:15,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605669934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:00:15,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:00:15,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:00:15,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745199266] [2024-06-27 20:00:15,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:00:15,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:00:15,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:00:15,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:00:15,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:00:15,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 20:00:15,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 942 transitions, 14470 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:00:15,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:00:15,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 20:00:15,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:00:18,874 INFO L124 PetriNetUnfolderBase]: 5033/8030 cut-off events. [2024-06-27 20:00:18,874 INFO L125 PetriNetUnfolderBase]: For 2262233/2262235 co-relation queries the response was YES. [2024-06-27 20:00:18,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95255 conditions, 8030 events. 5033/8030 cut-off events. For 2262233/2262235 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 52043 event pairs, 837 based on Foata normal form. 2/8031 useless extension candidates. Maximal degree in co-relation 95008. Up to 7009 conditions per place. [2024-06-27 20:00:19,047 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 835 selfloop transitions, 139 changer transitions 0/979 dead transitions. [2024-06-27 20:00:19,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 979 transitions, 16750 flow [2024-06-27 20:00:19,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:00:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:00:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-27 20:00:19,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-27 20:00:19,048 INFO L175 Difference]: Start difference. First operand has 526 places, 942 transitions, 14470 flow. Second operand 10 states and 195 transitions. [2024-06-27 20:00:19,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 979 transitions, 16750 flow [2024-06-27 20:00:25,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 979 transitions, 16458 flow, removed 46 selfloop flow, removed 7 redundant places. [2024-06-27 20:00:25,551 INFO L231 Difference]: Finished difference. Result has 529 places, 946 transitions, 14669 flow [2024-06-27 20:00:25,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14178, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=803, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14669, PETRI_PLACES=529, PETRI_TRANSITIONS=946} [2024-06-27 20:00:25,551 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 486 predicate places. [2024-06-27 20:00:25,551 INFO L495 AbstractCegarLoop]: Abstraction has has 529 places, 946 transitions, 14669 flow [2024-06-27 20:00:25,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:00:25,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:00:25,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:00:25,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2024-06-27 20:00:25,552 INFO L420 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:00:25,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:00:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1874851336, now seen corresponding path program 4 times [2024-06-27 20:00:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:00:25,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200585722] [2024-06-27 20:00:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:00:25,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:00:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:00:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:00:26,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:00:26,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200585722] [2024-06-27 20:00:26,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200585722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:00:26,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:00:26,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:00:26,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126954477] [2024-06-27 20:00:26,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:00:26,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:00:26,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:00:26,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:00:26,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:00:26,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 20:00:26,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 946 transitions, 14669 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:00:26,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:00:26,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 20:00:26,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:00:29,284 INFO L124 PetriNetUnfolderBase]: 5043/8049 cut-off events. [2024-06-27 20:00:29,284 INFO L125 PetriNetUnfolderBase]: For 2296535/2296537 co-relation queries the response was YES. [2024-06-27 20:00:29,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96221 conditions, 8049 events. 5043/8049 cut-off events. For 2296535/2296537 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 52165 event pairs, 818 based on Foata normal form. 2/8050 useless extension candidates. Maximal degree in co-relation 95973. Up to 7219 conditions per place. [2024-06-27 20:00:29,450 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 867 selfloop transitions, 109 changer transitions 0/981 dead transitions. [2024-06-27 20:00:29,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 981 transitions, 16909 flow [2024-06-27 20:00:29,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 20:00:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 20:00:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-27 20:00:29,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44805194805194803 [2024-06-27 20:00:29,451 INFO L175 Difference]: Start difference. First operand has 529 places, 946 transitions, 14669 flow. Second operand 11 states and 207 transitions. [2024-06-27 20:00:29,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 981 transitions, 16909 flow [2024-06-27 20:00:36,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 981 transitions, 16443 flow, removed 95 selfloop flow, removed 8 redundant places. [2024-06-27 20:00:36,017 INFO L231 Difference]: Finished difference. Result has 532 places, 949 transitions, 14565 flow [2024-06-27 20:00:36,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14203, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14565, PETRI_PLACES=532, PETRI_TRANSITIONS=949} [2024-06-27 20:00:36,018 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 489 predicate places. [2024-06-27 20:00:36,018 INFO L495 AbstractCegarLoop]: Abstraction has has 532 places, 949 transitions, 14565 flow [2024-06-27 20:00:36,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:00:36,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:00:36,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:00:36,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2024-06-27 20:00:36,018 INFO L420 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:00:36,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:00:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash 532259519, now seen corresponding path program 1 times [2024-06-27 20:00:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:00:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544243597] [2024-06-27 20:00:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:00:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:00:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:00:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:00:36,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:00:36,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544243597] [2024-06-27 20:00:36,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544243597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:00:36,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:00:36,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:00:36,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943521774] [2024-06-27 20:00:36,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:00:36,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:00:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:00:36,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:00:36,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:00:36,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 20:00:36,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 949 transitions, 14565 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:00:36,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:00:36,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 20:00:36,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:00:39,870 INFO L124 PetriNetUnfolderBase]: 5063/8083 cut-off events. [2024-06-27 20:00:39,870 INFO L125 PetriNetUnfolderBase]: For 2356445/2356447 co-relation queries the response was YES. [2024-06-27 20:00:39,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96546 conditions, 8083 events. 5063/8083 cut-off events. For 2356445/2356447 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 52463 event pairs, 826 based on Foata normal form. 4/8086 useless extension candidates. Maximal degree in co-relation 96297. Up to 7249 conditions per place. [2024-06-27 20:00:40,037 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 868 selfloop transitions, 108 changer transitions 0/981 dead transitions. [2024-06-27 20:00:40,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 981 transitions, 16835 flow [2024-06-27 20:00:40,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:00:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:00:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-27 20:00:40,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45476190476190476 [2024-06-27 20:00:40,038 INFO L175 Difference]: Start difference. First operand has 532 places, 949 transitions, 14565 flow. Second operand 10 states and 191 transitions. [2024-06-27 20:00:40,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 981 transitions, 16835 flow [2024-06-27 20:00:46,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 981 transitions, 16519 flow, removed 51 selfloop flow, removed 9 redundant places. [2024-06-27 20:00:46,393 INFO L231 Difference]: Finished difference. Result has 533 places, 954 transitions, 14685 flow [2024-06-27 20:00:46,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14249, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=949, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=841, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14685, PETRI_PLACES=533, PETRI_TRANSITIONS=954} [2024-06-27 20:00:46,394 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 490 predicate places. [2024-06-27 20:00:46,394 INFO L495 AbstractCegarLoop]: Abstraction has has 533 places, 954 transitions, 14685 flow [2024-06-27 20:00:46,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:00:46,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:00:46,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:00:46,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2024-06-27 20:00:46,395 INFO L420 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:00:46,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:00:46,395 INFO L85 PathProgramCache]: Analyzing trace with hash 536900746, now seen corresponding path program 5 times [2024-06-27 20:00:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:00:46,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737112451] [2024-06-27 20:00:46,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:00:46,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:00:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:00:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:00:47,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:00:47,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737112451] [2024-06-27 20:00:47,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737112451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:00:47,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:00:47,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:00:47,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574120668] [2024-06-27 20:00:47,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:00:47,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:00:47,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:00:47,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:00:47,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:00:47,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 20:00:47,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 954 transitions, 14685 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:00:47,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:00:47,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 20:00:47,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:00:50,217 INFO L124 PetriNetUnfolderBase]: 5073/8101 cut-off events. [2024-06-27 20:00:50,217 INFO L125 PetriNetUnfolderBase]: For 2368867/2368869 co-relation queries the response was YES. [2024-06-27 20:00:50,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97669 conditions, 8101 events. 5073/8101 cut-off events. For 2368867/2368869 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 52525 event pairs, 822 based on Foata normal form. 2/8102 useless extension candidates. Maximal degree in co-relation 97419. Up to 7249 conditions per place. [2024-06-27 20:00:50,383 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 865 selfloop transitions, 113 changer transitions 0/983 dead transitions. [2024-06-27 20:00:50,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 983 transitions, 16935 flow [2024-06-27 20:00:50,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:00:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:00:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-27 20:00:50,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 20:00:50,384 INFO L175 Difference]: Start difference. First operand has 533 places, 954 transitions, 14685 flow. Second operand 10 states and 190 transitions. [2024-06-27 20:00:50,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 983 transitions, 16935 flow