./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/mix011_tso.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i ./goblint.2024-06-19_11-23-25.files/protection/mix011_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:17:35,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:17:35,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:17:35,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:17:35,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:17:35,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:17:35,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:17:35,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:17:35,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:17:35,759 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:17:35,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:17:35,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:17:35,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:17:35,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:17:35,762 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:17:35,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:17:35,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:17:35,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:17:35,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:17:35,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:17:35,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:17:35,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:17:35,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:17:35,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:17:35,764 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:17:35,764 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:17:35,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:17:35,764 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:17:35,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:17:35,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:17:35,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:17:35,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:17:35,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:17:35,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:17:35,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:17:35,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:17:35,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:17:35,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:17:35,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:17:35,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:17:35,768 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:17:35,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:17:35,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:17:35,768 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 18:17:36,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:17:36,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:17:36,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:17:36,106 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:17:36,106 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:17:36,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2024-06-27 18:17:37,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:17:37,442 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:17:37,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2024-06-27 18:17:37,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af445c67c/c5f5d39d469e44208b2384c011557338/FLAG09e247de6 [2024-06-27 18:17:37,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af445c67c/c5f5d39d469e44208b2384c011557338 [2024-06-27 18:17:37,471 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:17:37,471 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:17:37,472 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/mix011_tso.oepc.yml/witness.yml [2024-06-27 18:17:37,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:17:37,626 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:17:37,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:17:37,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:17:37,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:17:37,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:17:37" (1/2) ... [2024-06-27 18:17:37,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b36d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:17:37, skipping insertion in model container [2024-06-27 18:17:37,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:17:37" (1/2) ... [2024-06-27 18:17:37,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6d5c76aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:17:37, skipping insertion in model container [2024-06-27 18:17:37,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:17:37" (2/2) ... [2024-06-27 18:17:37,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b36d94 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:37, skipping insertion in model container [2024-06-27 18:17:37,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:17:37" (2/2) ... [2024-06-27 18:17:37,636 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:17:37,755 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:17:37,756 INFO L97 edCorrectnessWitness]: Location invariant before [L841-L841] ((((((((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) [2024-06-27 18:17:37,756 INFO L97 edCorrectnessWitness]: Location invariant before [L840-L840] ((((((((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) [2024-06-27 18:17:37,756 INFO L97 edCorrectnessWitness]: Location invariant before [L838-L838] ((((((((((((((((((((! multithreaded || 0 <= __unbuffered_cnt) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) [2024-06-27 18:17:37,757 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:17:37,757 INFO L106 edCorrectnessWitness]: ghost_update [L836-L836] multithreaded = 1; [2024-06-27 18:17:37,805 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:17:37,983 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i[949,962] [2024-06-27 18:17:38,141 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:17:38,149 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 18:17:38,186 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i[949,962] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:17:38,252 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:17:38,300 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:17:38,301 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38 WrapperNode [2024-06-27 18:17:38,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:17:38,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:17:38,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:17:38,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:17:38,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (1/1) ... [2024-06-27 18:17:38,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (1/1) ... [2024-06-27 18:17:38,395 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2024-06-27 18:17:38,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:17:38,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:17:38,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:17:38,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:17:38,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (1/1) ... [2024-06-27 18:17:38,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (1/1) ... [2024-06-27 18:17:38,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (1/1) ... [2024-06-27 18:17:38,442 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 18:17:38,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (1/1) ... [2024-06-27 18:17:38,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (1/1) ... [2024-06-27 18:17:38,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (1/1) ... [2024-06-27 18:17:38,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (1/1) ... [2024-06-27 18:17:38,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (1/1) ... [2024-06-27 18:17:38,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (1/1) ... [2024-06-27 18:17:38,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:17:38,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:17:38,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:17:38,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:17:38,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (1/1) ... [2024-06-27 18:17:38,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:17:38,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:17:38,523 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 18:17:38,565 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 18:17:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:17:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:17:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 18:17:38,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 18:17:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 18:17:38,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 18:17:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 18:17:38,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 18:17:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:17:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:17:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:17:38,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:17:38,587 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 18:17:38,698 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:17:38,700 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:17:39,017 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:17:39,018 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:17:39,177 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:17:39,178 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 18:17:39,178 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:17:39 BoogieIcfgContainer [2024-06-27 18:17:39,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:17:39,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:17:39,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:17:39,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:17:39,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:17:37" (1/4) ... [2024-06-27 18:17:39,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3282fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:17:39, skipping insertion in model container [2024-06-27 18:17:39,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:17:37" (2/4) ... [2024-06-27 18:17:39,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3282fb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:17:39, skipping insertion in model container [2024-06-27 18:17:39,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:38" (3/4) ... [2024-06-27 18:17:39,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3282fb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:17:39, skipping insertion in model container [2024-06-27 18:17:39,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:17:39" (4/4) ... [2024-06-27 18:17:39,188 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2024-06-27 18:17:39,201 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:17:39,202 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 18:17:39,202 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:17:39,282 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:17:39,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 110 flow [2024-06-27 18:17:39,344 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-06-27 18:17:39,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:17:39,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-06-27 18:17:39,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 49 transitions, 110 flow [2024-06-27 18:17:39,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 46 transitions, 101 flow [2024-06-27 18:17:39,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:17:39,365 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;@1a89a4ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:17:39,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 18:17:39,370 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:17:39,370 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 18:17:39,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:17:39,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:39,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:17:39,372 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:39,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:39,378 INFO L85 PathProgramCache]: Analyzing trace with hash 347919256, now seen corresponding path program 1 times [2024-06-27 18:17:39,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:39,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601185974] [2024-06-27 18:17:39,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:39,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:17:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601185974] [2024-06-27 18:17:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601185974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:40,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:40,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:17:40,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760237898] [2024-06-27 18:17:40,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:40,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:17:40,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:40,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:17:40,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:17:40,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-27 18:17:40,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:40,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:40,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-27 18:17:40,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:41,131 INFO L124 PetriNetUnfolderBase]: 4271/7027 cut-off events. [2024-06-27 18:17:41,132 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-06-27 18:17:41,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13271 conditions, 7027 events. 4271/7027 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 46419 event pairs, 3544 based on Foata normal form. 211/6621 useless extension candidates. Maximal degree in co-relation 13259. Up to 6128 conditions per place. [2024-06-27 18:17:41,168 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 43 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2024-06-27 18:17:41,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 233 flow [2024-06-27 18:17:41,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:17:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:17:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-06-27 18:17:41,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6870748299319728 [2024-06-27 18:17:41,181 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 101 flow. Second operand 3 states and 101 transitions. [2024-06-27 18:17:41,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 233 flow [2024-06-27 18:17:41,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 228 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 18:17:41,186 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 133 flow [2024-06-27 18:17:41,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-06-27 18:17:41,189 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2024-06-27 18:17:41,190 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 133 flow [2024-06-27 18:17:41,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:41,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:41,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:41,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:17:41,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:41,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:41,191 INFO L85 PathProgramCache]: Analyzing trace with hash -656954829, now seen corresponding path program 1 times [2024-06-27 18:17:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:41,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195377635] [2024-06-27 18:17:41,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:41,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:17:41,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:41,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195377635] [2024-06-27 18:17:41,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195377635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:41,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:41,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:17:41,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347414056] [2024-06-27 18:17:41,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:41,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:17:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:17:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:17:41,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 18:17:41,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:41,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:41,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 18:17:41,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:42,478 INFO L124 PetriNetUnfolderBase]: 5125/8213 cut-off events. [2024-06-27 18:17:42,478 INFO L125 PetriNetUnfolderBase]: For 1104/1104 co-relation queries the response was YES. [2024-06-27 18:17:42,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17293 conditions, 8213 events. 5125/8213 cut-off events. For 1104/1104 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 53234 event pairs, 3832 based on Foata normal form. 3/7641 useless extension candidates. Maximal degree in co-relation 17281. Up to 7290 conditions per place. [2024-06-27 18:17:42,521 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 56 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2024-06-27 18:17:42,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 333 flow [2024-06-27 18:17:42,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:17:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:17:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-06-27 18:17:42,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2024-06-27 18:17:42,523 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 133 flow. Second operand 4 states and 128 transitions. [2024-06-27 18:17:42,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 333 flow [2024-06-27 18:17:42,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:17:42,525 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 179 flow [2024-06-27 18:17:42,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-06-27 18:17:42,526 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2024-06-27 18:17:42,526 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 179 flow [2024-06-27 18:17:42,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:42,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:42,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:42,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:17:42,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:42,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1109237829, now seen corresponding path program 1 times [2024-06-27 18:17:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:42,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808815219] [2024-06-27 18:17:42,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:42,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:17:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:43,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808815219] [2024-06-27 18:17:43,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808815219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:43,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:43,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:17:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281243488] [2024-06-27 18:17:43,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:43,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:17:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:17:43,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:17:43,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 18:17:43,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:43,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:43,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 18:17:43,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:43,998 INFO L124 PetriNetUnfolderBase]: 5109/8272 cut-off events. [2024-06-27 18:17:43,998 INFO L125 PetriNetUnfolderBase]: For 2917/2917 co-relation queries the response was YES. [2024-06-27 18:17:44,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18922 conditions, 8272 events. 5109/8272 cut-off events. For 2917/2917 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 54640 event pairs, 2438 based on Foata normal form. 6/7703 useless extension candidates. Maximal degree in co-relation 18908. Up to 7239 conditions per place. [2024-06-27 18:17:44,029 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 68 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2024-06-27 18:17:44,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 96 transitions, 492 flow [2024-06-27 18:17:44,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:17:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:17:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-06-27 18:17:44,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-06-27 18:17:44,031 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 179 flow. Second operand 5 states and 154 transitions. [2024-06-27 18:17:44,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 96 transitions, 492 flow [2024-06-27 18:17:44,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 456 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-27 18:17:44,034 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 302 flow [2024-06-27 18:17:44,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2024-06-27 18:17:44,035 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2024-06-27 18:17:44,035 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 302 flow [2024-06-27 18:17:44,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:44,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:44,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:44,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:17:44,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:44,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1106875843, now seen corresponding path program 1 times [2024-06-27 18:17:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:44,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756483390] [2024-06-27 18:17:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:44,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:17:44,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756483390] [2024-06-27 18:17:44,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756483390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:44,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:44,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:17:44,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670554418] [2024-06-27 18:17:44,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:44,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:17:44,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:44,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:17:44,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:17:44,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 49 [2024-06-27 18:17:44,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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 18:17:44,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:44,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 49 [2024-06-27 18:17:44,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:44,334 INFO L124 PetriNetUnfolderBase]: 1235/2681 cut-off events. [2024-06-27 18:17:44,335 INFO L125 PetriNetUnfolderBase]: For 1264/1400 co-relation queries the response was YES. [2024-06-27 18:17:44,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5649 conditions, 2681 events. 1235/2681 cut-off events. For 1264/1400 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 20878 event pairs, 483 based on Foata normal form. 24/2562 useless extension candidates. Maximal degree in co-relation 5632. Up to 1589 conditions per place. [2024-06-27 18:17:44,355 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 35 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2024-06-27 18:17:44,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 373 flow [2024-06-27 18:17:44,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:17:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:17:44,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-06-27 18:17:44,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7687074829931972 [2024-06-27 18:17:44,357 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 302 flow. Second operand 3 states and 113 transitions. [2024-06-27 18:17:44,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 373 flow [2024-06-27 18:17:44,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 365 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-27 18:17:44,360 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 265 flow [2024-06-27 18:17:44,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2024-06-27 18:17:44,361 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2024-06-27 18:17:44,361 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 265 flow [2024-06-27 18:17:44,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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 18:17:44,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:44,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:44,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:17:44,362 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:44,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:44,363 INFO L85 PathProgramCache]: Analyzing trace with hash 912540360, now seen corresponding path program 1 times [2024-06-27 18:17:44,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:44,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756092739] [2024-06-27 18:17:44,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:44,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:17:45,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:45,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756092739] [2024-06-27 18:17:45,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756092739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:45,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:45,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:17:45,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543208041] [2024-06-27 18:17:45,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:45,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:17:45,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:45,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:17:45,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:17:45,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 18:17:45,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 265 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 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 18:17:45,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:45,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 18:17:45,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:46,171 INFO L124 PetriNetUnfolderBase]: 4332/7037 cut-off events. [2024-06-27 18:17:46,172 INFO L125 PetriNetUnfolderBase]: For 6222/6222 co-relation queries the response was YES. [2024-06-27 18:17:46,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17306 conditions, 7037 events. 4332/7037 cut-off events. For 6222/6222 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 45203 event pairs, 1768 based on Foata normal form. 6/6807 useless extension candidates. Maximal degree in co-relation 17287. Up to 6106 conditions per place. [2024-06-27 18:17:46,198 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 70 selfloop transitions, 16 changer transitions 1/99 dead transitions. [2024-06-27 18:17:46,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 99 transitions, 537 flow [2024-06-27 18:17:46,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:17:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:17:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2024-06-27 18:17:46,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2024-06-27 18:17:46,201 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 265 flow. Second operand 6 states and 174 transitions. [2024-06-27 18:17:46,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 99 transitions, 537 flow [2024-06-27 18:17:46,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 99 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:17:46,205 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 307 flow [2024-06-27 18:17:46,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-06-27 18:17:46,206 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2024-06-27 18:17:46,206 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 307 flow [2024-06-27 18:17:46,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 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 18:17:46,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:46,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:46,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:17:46,207 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:46,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:46,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1444729862, now seen corresponding path program 1 times [2024-06-27 18:17:46,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:46,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386334823] [2024-06-27 18:17:46,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:46,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:46,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 18:17:46,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:46,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386334823] [2024-06-27 18:17:46,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386334823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:46,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:46,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:17:46,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555681587] [2024-06-27 18:17:46,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:46,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:17:46,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:46,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:17:46,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:17:46,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 18:17:46,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:46,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:46,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 18:17:46,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:47,552 INFO L124 PetriNetUnfolderBase]: 3603/6017 cut-off events. [2024-06-27 18:17:47,552 INFO L125 PetriNetUnfolderBase]: For 6820/6820 co-relation queries the response was YES. [2024-06-27 18:17:47,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15517 conditions, 6017 events. 3603/6017 cut-off events. For 6820/6820 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 38806 event pairs, 1917 based on Foata normal form. 2/5747 useless extension candidates. Maximal degree in co-relation 15496. Up to 5169 conditions per place. [2024-06-27 18:17:47,584 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 68 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2024-06-27 18:17:47,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 555 flow [2024-06-27 18:17:47,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:17:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:17:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-06-27 18:17:47,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-27 18:17:47,586 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 307 flow. Second operand 5 states and 128 transitions. [2024-06-27 18:17:47,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 555 flow [2024-06-27 18:17:47,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 88 transitions, 507 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 18:17:47,591 INFO L231 Difference]: Finished difference. Result has 68 places, 70 transitions, 352 flow [2024-06-27 18:17:47,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2024-06-27 18:17:47,591 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2024-06-27 18:17:47,592 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 352 flow [2024-06-27 18:17:47,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:47,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:47,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:47,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:17:47,593 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:47,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1836951587, now seen corresponding path program 1 times [2024-06-27 18:17:47,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:47,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401875375] [2024-06-27 18:17:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:47,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:48,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 18:17:48,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:48,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401875375] [2024-06-27 18:17:48,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401875375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:48,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:48,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:17:48,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461504689] [2024-06-27 18:17:48,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:48,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:17:48,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:48,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:17:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:17:48,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 18:17:48,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 352 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:48,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:48,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 18:17:48,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:49,069 INFO L124 PetriNetUnfolderBase]: 4252/7136 cut-off events. [2024-06-27 18:17:49,070 INFO L125 PetriNetUnfolderBase]: For 10525/10525 co-relation queries the response was YES. [2024-06-27 18:17:49,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19292 conditions, 7136 events. 4252/7136 cut-off events. For 10525/10525 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 46808 event pairs, 2284 based on Foata normal form. 2/6852 useless extension candidates. Maximal degree in co-relation 19268. Up to 6064 conditions per place. [2024-06-27 18:17:49,106 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 78 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2024-06-27 18:17:49,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 626 flow [2024-06-27 18:17:49,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:17:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:17:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-06-27 18:17:49,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068027210884354 [2024-06-27 18:17:49,108 INFO L175 Difference]: Start difference. First operand has 68 places, 70 transitions, 352 flow. Second operand 6 states and 149 transitions. [2024-06-27 18:17:49,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 626 flow [2024-06-27 18:17:49,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 609 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 18:17:49,113 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 393 flow [2024-06-27 18:17:49,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=393, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2024-06-27 18:17:49,114 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2024-06-27 18:17:49,114 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 393 flow [2024-06-27 18:17:49,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:49,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:49,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:49,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:17:49,115 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:49,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1942784305, now seen corresponding path program 1 times [2024-06-27 18:17:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:49,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902047956] [2024-06-27 18:17:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:17:49,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:49,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902047956] [2024-06-27 18:17:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902047956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:49,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:49,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:17:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653456705] [2024-06-27 18:17:49,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:49,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:17:49,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:49,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:17:49,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:17:49,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 18:17:49,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 393 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:49,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:49,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 18:17:49,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:50,550 INFO L124 PetriNetUnfolderBase]: 4880/8058 cut-off events. [2024-06-27 18:17:50,551 INFO L125 PetriNetUnfolderBase]: For 16438/16438 co-relation queries the response was YES. [2024-06-27 18:17:50,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23053 conditions, 8058 events. 4880/8058 cut-off events. For 16438/16438 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 52959 event pairs, 2543 based on Foata normal form. 2/7781 useless extension candidates. Maximal degree in co-relation 23027. Up to 6952 conditions per place. [2024-06-27 18:17:50,586 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 83 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2024-06-27 18:17:50,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 107 transitions, 703 flow [2024-06-27 18:17:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:17:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:17:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-06-27 18:17:50,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-27 18:17:50,588 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 393 flow. Second operand 6 states and 150 transitions. [2024-06-27 18:17:50,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 107 transitions, 703 flow [2024-06-27 18:17:50,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 107 transitions, 671 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 18:17:50,595 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 462 flow [2024-06-27 18:17:50,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=462, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-06-27 18:17:50,598 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 20 predicate places. [2024-06-27 18:17:50,598 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 462 flow [2024-06-27 18:17:50,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:50,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:50,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:50,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:17:50,599 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:50,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash -612230731, now seen corresponding path program 2 times [2024-06-27 18:17:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:50,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898247309] [2024-06-27 18:17:50,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:50,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:51,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 18:17:51,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:51,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898247309] [2024-06-27 18:17:51,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898247309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:51,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:51,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:17:51,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440732282] [2024-06-27 18:17:51,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:51,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:17:51,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:51,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:17:51,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:17:51,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 18:17:51,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 462 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:51,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:51,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 18:17:51,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:52,075 INFO L124 PetriNetUnfolderBase]: 4851/7998 cut-off events. [2024-06-27 18:17:52,075 INFO L125 PetriNetUnfolderBase]: For 21291/21311 co-relation queries the response was YES. [2024-06-27 18:17:52,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24337 conditions, 7998 events. 4851/7998 cut-off events. For 21291/21311 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 52438 event pairs, 2410 based on Foata normal form. 18/7760 useless extension candidates. Maximal degree in co-relation 24309. Up to 6874 conditions per place. [2024-06-27 18:17:52,183 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 81 selfloop transitions, 18 changer transitions 0/110 dead transitions. [2024-06-27 18:17:52,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 110 transitions, 766 flow [2024-06-27 18:17:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:17:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:17:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-06-27 18:17:52,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136054421768708 [2024-06-27 18:17:52,185 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 462 flow. Second operand 6 states and 151 transitions. [2024-06-27 18:17:52,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 110 transitions, 766 flow [2024-06-27 18:17:52,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 110 transitions, 733 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 18:17:52,193 INFO L231 Difference]: Finished difference. Result has 78 places, 83 transitions, 507 flow [2024-06-27 18:17:52,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=78, PETRI_TRANSITIONS=83} [2024-06-27 18:17:52,194 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 23 predicate places. [2024-06-27 18:17:52,194 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 83 transitions, 507 flow [2024-06-27 18:17:52,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:52,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:52,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:52,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 18:17:52,195 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:52,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash -612221803, now seen corresponding path program 1 times [2024-06-27 18:17:52,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:52,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934634665] [2024-06-27 18:17:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:52,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:17:52,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:52,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934634665] [2024-06-27 18:17:52,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934634665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:52,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:52,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:17:52,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962207120] [2024-06-27 18:17:52,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:52,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:17:52,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:52,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:17:52,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:17:52,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 18:17:52,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 83 transitions, 507 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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 18:17:52,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:52,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 18:17:52,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:53,738 INFO L124 PetriNetUnfolderBase]: 4284/7249 cut-off events. [2024-06-27 18:17:53,738 INFO L125 PetriNetUnfolderBase]: For 22812/22812 co-relation queries the response was YES. [2024-06-27 18:17:53,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22988 conditions, 7249 events. 4284/7249 cut-off events. For 22812/22812 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 48109 event pairs, 2165 based on Foata normal form. 2/6991 useless extension candidates. Maximal degree in co-relation 22959. Up to 6089 conditions per place. [2024-06-27 18:17:53,780 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 97 selfloop transitions, 15 changer transitions 0/122 dead transitions. [2024-06-27 18:17:53,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 122 transitions, 865 flow [2024-06-27 18:17:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:17:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:17:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-06-27 18:17:53,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072886297376094 [2024-06-27 18:17:53,782 INFO L175 Difference]: Start difference. First operand has 78 places, 83 transitions, 507 flow. Second operand 7 states and 174 transitions. [2024-06-27 18:17:53,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 122 transitions, 865 flow [2024-06-27 18:17:53,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 122 transitions, 813 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 18:17:53,795 INFO L231 Difference]: Finished difference. Result has 81 places, 86 transitions, 527 flow [2024-06-27 18:17:53,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=527, PETRI_PLACES=81, PETRI_TRANSITIONS=86} [2024-06-27 18:17:53,796 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 26 predicate places. [2024-06-27 18:17:53,796 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 86 transitions, 527 flow [2024-06-27 18:17:53,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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 18:17:53,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:53,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:53,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 18:17:53,797 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:53,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash -96891253, now seen corresponding path program 1 times [2024-06-27 18:17:53,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:53,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204553925] [2024-06-27 18:17:53,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:53,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:17:54,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:54,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204553925] [2024-06-27 18:17:54,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204553925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:54,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:54,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:17:54,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969693571] [2024-06-27 18:17:54,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:54,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:17:54,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:54,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:17:54,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:17:54,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 18:17:54,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 86 transitions, 527 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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 18:17:54,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:54,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 18:17:54,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:55,513 INFO L124 PetriNetUnfolderBase]: 4923/8152 cut-off events. [2024-06-27 18:17:55,514 INFO L125 PetriNetUnfolderBase]: For 32476/32484 co-relation queries the response was YES. [2024-06-27 18:17:55,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27222 conditions, 8152 events. 4923/8152 cut-off events. For 32476/32484 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 53704 event pairs, 2117 based on Foata normal form. 12/7882 useless extension candidates. Maximal degree in co-relation 27192. Up to 6951 conditions per place. [2024-06-27 18:17:55,582 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 92 selfloop transitions, 29 changer transitions 0/132 dead transitions. [2024-06-27 18:17:55,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 132 transitions, 926 flow [2024-06-27 18:17:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:17:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:17:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-27 18:17:55,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276967930029155 [2024-06-27 18:17:55,586 INFO L175 Difference]: Start difference. First operand has 81 places, 86 transitions, 527 flow. Second operand 7 states and 181 transitions. [2024-06-27 18:17:55,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 132 transitions, 926 flow [2024-06-27 18:17:55,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 132 transitions, 880 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 18:17:55,600 INFO L231 Difference]: Finished difference. Result has 84 places, 95 transitions, 628 flow [2024-06-27 18:17:55,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=628, PETRI_PLACES=84, PETRI_TRANSITIONS=95} [2024-06-27 18:17:55,601 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 29 predicate places. [2024-06-27 18:17:55,601 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 95 transitions, 628 flow [2024-06-27 18:17:55,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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 18:17:55,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:55,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:55,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 18:17:55,603 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:55,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:55,603 INFO L85 PathProgramCache]: Analyzing trace with hash -257208738, now seen corresponding path program 1 times [2024-06-27 18:17:55,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:55,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522195234] [2024-06-27 18:17:55,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:55,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:17:56,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:56,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522195234] [2024-06-27 18:17:56,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522195234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:56,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:56,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:17:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936456720] [2024-06-27 18:17:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:56,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:17:56,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:56,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:17:56,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:17:56,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:17:56,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 95 transitions, 628 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:56,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:56,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:17:56,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:57,247 INFO L124 PetriNetUnfolderBase]: 5217/8467 cut-off events. [2024-06-27 18:17:57,248 INFO L125 PetriNetUnfolderBase]: For 39150/39150 co-relation queries the response was YES. [2024-06-27 18:17:57,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30282 conditions, 8467 events. 5217/8467 cut-off events. For 39150/39150 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 54252 event pairs, 2263 based on Foata normal form. 2/8211 useless extension candidates. Maximal degree in co-relation 30250. Up to 7385 conditions per place. [2024-06-27 18:17:57,297 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 109 selfloop transitions, 16 changer transitions 0/134 dead transitions. [2024-06-27 18:17:57,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 134 transitions, 1020 flow [2024-06-27 18:17:57,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:17:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:17:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-06-27 18:17:57,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49271137026239065 [2024-06-27 18:17:57,299 INFO L175 Difference]: Start difference. First operand has 84 places, 95 transitions, 628 flow. Second operand 7 states and 169 transitions. [2024-06-27 18:17:57,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 134 transitions, 1020 flow [2024-06-27 18:17:57,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 134 transitions, 955 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-27 18:17:57,318 INFO L231 Difference]: Finished difference. Result has 88 places, 98 transitions, 643 flow [2024-06-27 18:17:57,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=643, PETRI_PLACES=88, PETRI_TRANSITIONS=98} [2024-06-27 18:17:57,319 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 33 predicate places. [2024-06-27 18:17:57,319 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 98 transitions, 643 flow [2024-06-27 18:17:57,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:17:57,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:57,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:57,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 18:17:57,320 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:57,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash -96770353, now seen corresponding path program 2 times [2024-06-27 18:17:57,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:57,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199571755] [2024-06-27 18:17:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:57,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:17:58,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:58,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199571755] [2024-06-27 18:17:58,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199571755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:58,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:58,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:17:58,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636646702] [2024-06-27 18:17:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:58,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:17:58,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:58,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:17:58,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:17:58,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 18:17:58,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 98 transitions, 643 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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 18:17:58,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:58,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 18:17:58,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:17:59,061 INFO L124 PetriNetUnfolderBase]: 5033/8270 cut-off events. [2024-06-27 18:17:59,061 INFO L125 PetriNetUnfolderBase]: For 48028/48076 co-relation queries the response was YES. [2024-06-27 18:17:59,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31021 conditions, 8270 events. 5033/8270 cut-off events. For 48028/48076 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 54096 event pairs, 2040 based on Foata normal form. 12/7994 useless extension candidates. Maximal degree in co-relation 30988. Up to 7017 conditions per place. [2024-06-27 18:17:59,119 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 99 selfloop transitions, 37 changer transitions 0/148 dead transitions. [2024-06-27 18:17:59,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 148 transitions, 1198 flow [2024-06-27 18:17:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:17:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:17:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-06-27 18:17:59,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-06-27 18:17:59,122 INFO L175 Difference]: Start difference. First operand has 88 places, 98 transitions, 643 flow. Second operand 7 states and 182 transitions. [2024-06-27 18:17:59,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 148 transitions, 1198 flow [2024-06-27 18:17:59,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 148 transitions, 1141 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-27 18:17:59,151 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 829 flow [2024-06-27 18:17:59,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=829, PETRI_PLACES=91, PETRI_TRANSITIONS=110} [2024-06-27 18:17:59,152 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 36 predicate places. [2024-06-27 18:17:59,152 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 829 flow [2024-06-27 18:17:59,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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 18:17:59,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:17:59,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:17:59,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 18:17:59,153 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:17:59,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:17:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 406601447, now seen corresponding path program 3 times [2024-06-27 18:17:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:17:59,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608919089] [2024-06-27 18:17:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:17:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:17:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:17:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:17:59,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:17:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608919089] [2024-06-27 18:17:59,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608919089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:17:59,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:17:59,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:17:59,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633931511] [2024-06-27 18:17:59,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:17:59,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:17:59,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:17:59,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:17:59,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:17:59,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 18:17:59,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 110 transitions, 829 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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 18:17:59,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:17:59,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 18:17:59,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:00,838 INFO L124 PetriNetUnfolderBase]: 5010/8310 cut-off events. [2024-06-27 18:18:00,838 INFO L125 PetriNetUnfolderBase]: For 57625/57660 co-relation queries the response was YES. [2024-06-27 18:18:00,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32783 conditions, 8310 events. 5010/8310 cut-off events. For 57625/57660 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 54938 event pairs, 1939 based on Foata normal form. 13/8046 useless extension candidates. Maximal degree in co-relation 32748. Up to 6927 conditions per place. [2024-06-27 18:18:00,889 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 101 selfloop transitions, 51 changer transitions 0/164 dead transitions. [2024-06-27 18:18:00,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 164 transitions, 1499 flow [2024-06-27 18:18:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:18:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:18:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-27 18:18:00,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276967930029155 [2024-06-27 18:18:00,891 INFO L175 Difference]: Start difference. First operand has 91 places, 110 transitions, 829 flow. Second operand 7 states and 181 transitions. [2024-06-27 18:18:00,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 164 transitions, 1499 flow [2024-06-27 18:18:00,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 164 transitions, 1407 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-27 18:18:00,931 INFO L231 Difference]: Finished difference. Result has 96 places, 128 transitions, 1115 flow [2024-06-27 18:18:00,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1115, PETRI_PLACES=96, PETRI_TRANSITIONS=128} [2024-06-27 18:18:00,931 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 41 predicate places. [2024-06-27 18:18:00,931 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 128 transitions, 1115 flow [2024-06-27 18:18:00,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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 18:18:00,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:00,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:00,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 18:18:00,932 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:00,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -252538278, now seen corresponding path program 2 times [2024-06-27 18:18:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434369629] [2024-06-27 18:18:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:01,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:01,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434369629] [2024-06-27 18:18:01,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434369629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:01,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:01,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:18:01,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062084351] [2024-06-27 18:18:01,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:01,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:18:01,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:01,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:18:01,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:18:01,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:01,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 128 transitions, 1115 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:01,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:01,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:01,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:02,596 INFO L124 PetriNetUnfolderBase]: 5315/8629 cut-off events. [2024-06-27 18:18:02,597 INFO L125 PetriNetUnfolderBase]: For 68534/68556 co-relation queries the response was YES. [2024-06-27 18:18:02,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36192 conditions, 8629 events. 5315/8629 cut-off events. For 68534/68556 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 55426 event pairs, 2151 based on Foata normal form. 20/8388 useless extension candidates. Maximal degree in co-relation 36154. Up to 7426 conditions per place. [2024-06-27 18:18:02,656 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 131 selfloop transitions, 35 changer transitions 0/175 dead transitions. [2024-06-27 18:18:02,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 175 transitions, 1757 flow [2024-06-27 18:18:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:18:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:18:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-06-27 18:18:02,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072886297376094 [2024-06-27 18:18:02,658 INFO L175 Difference]: Start difference. First operand has 96 places, 128 transitions, 1115 flow. Second operand 7 states and 174 transitions. [2024-06-27 18:18:02,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 175 transitions, 1757 flow [2024-06-27 18:18:02,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 175 transitions, 1639 flow, removed 49 selfloop flow, removed 2 redundant places. [2024-06-27 18:18:02,709 INFO L231 Difference]: Finished difference. Result has 101 places, 134 transitions, 1184 flow [2024-06-27 18:18:02,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1184, PETRI_PLACES=101, PETRI_TRANSITIONS=134} [2024-06-27 18:18:02,710 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 46 predicate places. [2024-06-27 18:18:02,710 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 134 transitions, 1184 flow [2024-06-27 18:18:02,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:02,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:02,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:02,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 18:18:02,711 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:02,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:02,711 INFO L85 PathProgramCache]: Analyzing trace with hash 406609104, now seen corresponding path program 3 times [2024-06-27 18:18:02,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:02,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201704607] [2024-06-27 18:18:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:02,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:03,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:03,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201704607] [2024-06-27 18:18:03,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201704607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:03,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:03,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:18:03,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68236082] [2024-06-27 18:18:03,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:03,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:18:03,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:03,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:18:03,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:18:03,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:03,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 134 transitions, 1184 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:03,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:03,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:03,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:04,561 INFO L124 PetriNetUnfolderBase]: 5310/8622 cut-off events. [2024-06-27 18:18:04,562 INFO L125 PetriNetUnfolderBase]: For 76229/76251 co-relation queries the response was YES. [2024-06-27 18:18:04,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37249 conditions, 8622 events. 5310/8622 cut-off events. For 76229/76251 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 55442 event pairs, 2150 based on Foata normal form. 20/8381 useless extension candidates. Maximal degree in co-relation 37209. Up to 7421 conditions per place. [2024-06-27 18:18:04,618 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 126 selfloop transitions, 37 changer transitions 0/172 dead transitions. [2024-06-27 18:18:04,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 172 transitions, 1652 flow [2024-06-27 18:18:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:18:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:18:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-27 18:18:04,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49854227405247814 [2024-06-27 18:18:04,620 INFO L175 Difference]: Start difference. First operand has 101 places, 134 transitions, 1184 flow. Second operand 7 states and 171 transitions. [2024-06-27 18:18:04,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 172 transitions, 1652 flow [2024-06-27 18:18:04,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 172 transitions, 1562 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-06-27 18:18:04,708 INFO L231 Difference]: Finished difference. Result has 105 places, 134 transitions, 1176 flow [2024-06-27 18:18:04,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1176, PETRI_PLACES=105, PETRI_TRANSITIONS=134} [2024-06-27 18:18:04,708 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 50 predicate places. [2024-06-27 18:18:04,709 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 134 transitions, 1176 flow [2024-06-27 18:18:04,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:04,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:04,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:04,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 18:18:04,709 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:04,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:04,710 INFO L85 PathProgramCache]: Analyzing trace with hash -719642701, now seen corresponding path program 1 times [2024-06-27 18:18:04,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:04,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367248191] [2024-06-27 18:18:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:05,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:05,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367248191] [2024-06-27 18:18:05,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367248191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:05,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:05,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:18:05,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125433657] [2024-06-27 18:18:05,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:05,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:18:05,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:05,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:18:05,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:18:05,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:05,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 134 transitions, 1176 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 18:18:05,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:05,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:05,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:06,295 INFO L124 PetriNetUnfolderBase]: 5827/9511 cut-off events. [2024-06-27 18:18:06,295 INFO L125 PetriNetUnfolderBase]: For 88226/88292 co-relation queries the response was YES. [2024-06-27 18:18:06,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40905 conditions, 9511 events. 5827/9511 cut-off events. For 88226/88292 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 62181 event pairs, 2499 based on Foata normal form. 7/9209 useless extension candidates. Maximal degree in co-relation 40863. Up to 8275 conditions per place. [2024-06-27 18:18:06,361 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 126 selfloop transitions, 14 changer transitions 0/153 dead transitions. [2024-06-27 18:18:06,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 153 transitions, 1530 flow [2024-06-27 18:18:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:18:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:18:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2024-06-27 18:18:06,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816326530612245 [2024-06-27 18:18:06,363 INFO L175 Difference]: Start difference. First operand has 105 places, 134 transitions, 1176 flow. Second operand 5 states and 118 transitions. [2024-06-27 18:18:06,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 153 transitions, 1530 flow [2024-06-27 18:18:06,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 153 transitions, 1442 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-27 18:18:06,432 INFO L231 Difference]: Finished difference. Result has 104 places, 137 transitions, 1154 flow [2024-06-27 18:18:06,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1154, PETRI_PLACES=104, PETRI_TRANSITIONS=137} [2024-06-27 18:18:06,433 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 49 predicate places. [2024-06-27 18:18:06,433 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 137 transitions, 1154 flow [2024-06-27 18:18:06,433 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 18:18:06,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:06,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:06,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 18:18:06,435 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:06,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:06,435 INFO L85 PathProgramCache]: Analyzing trace with hash 612618936, now seen corresponding path program 1 times [2024-06-27 18:18:06,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:06,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519571498] [2024-06-27 18:18:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:06,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:07,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:07,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519571498] [2024-06-27 18:18:07,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519571498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:07,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:07,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:07,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660252802] [2024-06-27 18:18:07,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:07,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:07,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:07,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:07,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 18:18:07,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 137 transitions, 1154 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:07,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:07,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 18:18:07,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:08,840 INFO L124 PetriNetUnfolderBase]: 5613/9220 cut-off events. [2024-06-27 18:18:08,840 INFO L125 PetriNetUnfolderBase]: For 94618/94700 co-relation queries the response was YES. [2024-06-27 18:18:08,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41545 conditions, 9220 events. 5613/9220 cut-off events. For 94618/94700 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 61319 event pairs, 2199 based on Foata normal form. 14/8863 useless extension candidates. Maximal degree in co-relation 41502. Up to 7778 conditions per place. [2024-06-27 18:18:08,907 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 141 selfloop transitions, 45 changer transitions 0/201 dead transitions. [2024-06-27 18:18:08,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 201 transitions, 1949 flow [2024-06-27 18:18:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:18:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:18:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-06-27 18:18:08,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 18:18:08,909 INFO L175 Difference]: Start difference. First operand has 104 places, 137 transitions, 1154 flow. Second operand 8 states and 196 transitions. [2024-06-27 18:18:08,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 201 transitions, 1949 flow [2024-06-27 18:18:08,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 201 transitions, 1909 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 18:18:08,983 INFO L231 Difference]: Finished difference. Result has 112 places, 162 transitions, 1557 flow [2024-06-27 18:18:08,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1557, PETRI_PLACES=112, PETRI_TRANSITIONS=162} [2024-06-27 18:18:08,984 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 57 predicate places. [2024-06-27 18:18:08,984 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 162 transitions, 1557 flow [2024-06-27 18:18:08,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:08,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:08,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:08,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 18:18:08,985 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:08,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:08,985 INFO L85 PathProgramCache]: Analyzing trace with hash 133375386, now seen corresponding path program 2 times [2024-06-27 18:18:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:08,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799545947] [2024-06-27 18:18:08,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:08,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:09,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:09,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799545947] [2024-06-27 18:18:09,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799545947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:09,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:09,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:18:09,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675379170] [2024-06-27 18:18:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:09,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:18:09,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:09,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:18:09,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:18:09,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-27 18:18:09,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 162 transitions, 1557 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:09,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:09,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-27 18:18:09,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:10,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L803-->L805: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][162], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 33#L867true, Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 32#L805true, 251#true, 186#true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 49#L750true, Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 232#true, Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 172#true, Black: 230#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork2InUse, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 199#true, Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P1Thread1of1ForFork0InUse, Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 242#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 13#L785true, P0Thread1of1ForFork1InUse]) [2024-06-27 18:18:10,332 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 18:18:10,332 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:10,332 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:10,347 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:10,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L788-->L795: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_63 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_64 256) 0)) .cse5)) (.cse3 (and .cse0 .cse5)) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_59 256) 0))))) (and (= v_~x$r_buff1_thd2~0_17 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_58 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_18)) (= v_~x$w_buff0_used~0_63 (ite .cse2 0 v_~x$w_buff0_used~0_64)) (= (ite .cse3 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse4 v_~x$w_buff1~0_20 v_~x~0_32)) v_~x~0_31) (= v_~x$w_buff1_used~0_58 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_59))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_64} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_58, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_63} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][125], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 33#L867true, Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 251#true, 50#$Ultimate##0true, 186#true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 49#L750true, Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 232#true, Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 26#L795true, 172#true, Black: 230#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork2InUse, 199#true, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P1Thread1of1ForFork0InUse, Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 242#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse]) [2024-06-27 18:18:10,356 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 18:18:10,356 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:10,356 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:10,356 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:10,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L803-->L805: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][162], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 33#L867true, Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 32#L805true, 251#true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 186#true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 232#true, Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 172#true, Black: 230#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork2InUse, 199#true, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 242#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 11#L753true, Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 13#L785true, P0Thread1of1ForFork1InUse]) [2024-06-27 18:18:10,398 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-27 18:18:10,398 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:10,398 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:10,398 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:10,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L803-->L805: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][162], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 44#L18-1true, 32#L805true, 251#true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 186#true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 49#L750true, Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 232#true, Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 172#true, Black: 230#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork2InUse, 199#true, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P1Thread1of1ForFork0InUse, Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 242#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 13#L785true, P0Thread1of1ForFork1InUse]) [2024-06-27 18:18:10,424 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-27 18:18:10,424 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:10,424 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:10,424 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:10,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L788-->L795: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_63 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_64 256) 0)) .cse5)) (.cse3 (and .cse0 .cse5)) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_59 256) 0))))) (and (= v_~x$r_buff1_thd2~0_17 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_58 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_18)) (= v_~x$w_buff0_used~0_63 (ite .cse2 0 v_~x$w_buff0_used~0_64)) (= (ite .cse3 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse4 v_~x$w_buff1~0_20 v_~x~0_32)) v_~x~0_31) (= v_~x$w_buff1_used~0_58 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_59))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_64} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_58, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_63} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][125], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 44#L18-1true, 251#true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 50#$Ultimate##0true, 186#true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 49#L750true, Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 232#true, Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 26#L795true, 172#true, Black: 230#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork2InUse, 199#true, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P1Thread1of1ForFork0InUse, Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 242#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse]) [2024-06-27 18:18:10,442 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-27 18:18:10,442 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:10,442 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:10,442 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:10,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L803-->L805: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][162], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 44#L18-1true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 32#L805true, 251#true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 186#true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 232#true, Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 172#true, Black: 230#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork2InUse, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 199#true, Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 242#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 11#L753true, Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 13#L785true, P0Thread1of1ForFork1InUse]) [2024-06-27 18:18:10,488 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-27 18:18:10,488 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:18:10,489 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:18:10,489 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:18:10,940 INFO L124 PetriNetUnfolderBase]: 5477/9111 cut-off events. [2024-06-27 18:18:10,940 INFO L125 PetriNetUnfolderBase]: For 95634/95868 co-relation queries the response was YES. [2024-06-27 18:18:10,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41169 conditions, 9111 events. 5477/9111 cut-off events. For 95634/95868 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 61420 event pairs, 2327 based on Foata normal form. 116/8857 useless extension candidates. Maximal degree in co-relation 41122. Up to 7531 conditions per place. [2024-06-27 18:18:10,998 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 128 selfloop transitions, 76 changer transitions 0/234 dead transitions. [2024-06-27 18:18:10,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 234 transitions, 2557 flow [2024-06-27 18:18:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:18:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:18:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-06-27 18:18:11,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364431486880467 [2024-06-27 18:18:11,001 INFO L175 Difference]: Start difference. First operand has 112 places, 162 transitions, 1557 flow. Second operand 7 states and 184 transitions. [2024-06-27 18:18:11,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 234 transitions, 2557 flow [2024-06-27 18:18:11,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 234 transitions, 2440 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-06-27 18:18:11,087 INFO L231 Difference]: Finished difference. Result has 119 places, 203 transitions, 2236 flow [2024-06-27 18:18:11,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2236, PETRI_PLACES=119, PETRI_TRANSITIONS=203} [2024-06-27 18:18:11,087 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 64 predicate places. [2024-06-27 18:18:11,088 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 203 transitions, 2236 flow [2024-06-27 18:18:11,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:11,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:11,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:11,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 18:18:11,088 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:11,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash 96959832, now seen corresponding path program 3 times [2024-06-27 18:18:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591291044] [2024-06-27 18:18:11,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:11,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:12,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:12,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591291044] [2024-06-27 18:18:12,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591291044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:12,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:12,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:12,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820293119] [2024-06-27 18:18:12,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:12,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:12,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:12,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:12,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:12,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 18:18:12,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 203 transitions, 2236 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:12,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:12,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 18:18:12,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:13,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L750-->L753: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][112], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 33#L867true, Black: 255#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 257#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 251#true, Black: 259#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 186#true, 50#$Ultimate##0true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 263#true, Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 172#true, Black: 230#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 199#true, P2Thread1of1ForFork2InUse, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 242#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, 11#L753true, Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 13#L785true, P0Thread1of1ForFork1InUse]) [2024-06-27 18:18:13,107 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-06-27 18:18:13,107 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 18:18:13,107 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 18:18:13,107 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 18:18:13,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L803-->L805: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][203], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 33#L867true, Black: 255#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 257#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 259#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 32#L805true, 251#true, 186#true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 263#true, Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 49#L750true, Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 172#true, Black: 230#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P2Thread1of1ForFork2InUse, 199#true, Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 242#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 13#L785true, P0Thread1of1ForFork1InUse]) [2024-06-27 18:18:13,167 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 18:18:13,167 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:13,168 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:13,168 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:13,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L788-->L795: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_63 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_64 256) 0)) .cse5)) (.cse3 (and .cse0 .cse5)) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_59 256) 0))))) (and (= v_~x$r_buff1_thd2~0_17 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_58 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_18)) (= v_~x$w_buff0_used~0_63 (ite .cse2 0 v_~x$w_buff0_used~0_64)) (= (ite .cse3 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse4 v_~x$w_buff1~0_20 v_~x~0_32)) v_~x~0_31) (= v_~x$w_buff1_used~0_58 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_59))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_64} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_58, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_63} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][148], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 33#L867true, Black: 255#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 257#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 259#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 251#true, 186#true, 50#$Ultimate##0true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 263#true, Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 49#L750true, Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 26#L795true, 172#true, Black: 230#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork2InUse, 199#true, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P1Thread1of1ForFork0InUse, Black: 242#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse]) [2024-06-27 18:18:13,173 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 18:18:13,173 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:13,173 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:13,173 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:13,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L750-->L753: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][112], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 255#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 257#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 44#L18-1true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 251#true, Black: 259#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 186#true, 50#$Ultimate##0true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 263#true, Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 172#true, Black: 230#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork2InUse, 199#true, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 242#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 11#L753true, 13#L785true, P0Thread1of1ForFork1InUse]) [2024-06-27 18:18:13,178 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 18:18:13,178 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:13,178 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:13,178 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:18:13,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L803-->L805: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][203], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 255#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 44#L18-1true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 257#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 259#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 32#L805true, 251#true, 186#true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 263#true, Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 49#L750true, Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 172#true, Black: 230#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P2Thread1of1ForFork2InUse, 199#true, Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 242#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 13#L785true, P0Thread1of1ForFork1InUse]) [2024-06-27 18:18:13,230 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-27 18:18:13,231 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:13,231 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:13,231 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:13,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L788-->L795: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_63 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_64 256) 0)) .cse5)) (.cse3 (and .cse0 .cse5)) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_59 256) 0))))) (and (= v_~x$r_buff1_thd2~0_17 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_58 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_18)) (= v_~x$w_buff0_used~0_63 (ite .cse2 0 v_~x$w_buff0_used~0_64)) (= (ite .cse3 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse4 v_~x$w_buff1~0_20 v_~x~0_32)) v_~x~0_31) (= v_~x$w_buff1_used~0_58 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_59))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_64} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_58, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_63} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][148], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 128#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 255#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 44#L18-1true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 257#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 191#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 259#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 251#true, 186#true, 50#$Ultimate##0true, Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 263#true, Black: 139#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 49#L750true, Black: 87#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 217#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 96#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 26#L795true, 172#true, Black: 230#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~y~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 105#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~a~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork2InUse, 199#true, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 115#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 179#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= ~a~0 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P1Thread1of1ForFork0InUse, Black: 242#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), P0Thread1of1ForFork1InUse]) [2024-06-27 18:18:13,236 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-27 18:18:13,236 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:13,236 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:13,236 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:18:13,701 INFO L124 PetriNetUnfolderBase]: 6118/9896 cut-off events. [2024-06-27 18:18:13,701 INFO L125 PetriNetUnfolderBase]: For 115129/115227 co-relation queries the response was YES. [2024-06-27 18:18:13,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48663 conditions, 9896 events. 6118/9896 cut-off events. For 115129/115227 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 64294 event pairs, 2369 based on Foata normal form. 20/9546 useless extension candidates. Maximal degree in co-relation 48612. Up to 8323 conditions per place. [2024-06-27 18:18:13,781 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 183 selfloop transitions, 114 changer transitions 0/312 dead transitions. [2024-06-27 18:18:13,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 312 transitions, 3949 flow [2024-06-27 18:18:13,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:18:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:18:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-06-27 18:18:13,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280612244897959 [2024-06-27 18:18:13,783 INFO L175 Difference]: Start difference. First operand has 119 places, 203 transitions, 2236 flow. Second operand 8 states and 207 transitions. [2024-06-27 18:18:13,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 312 transitions, 3949 flow [2024-06-27 18:18:13,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 312 transitions, 3781 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-27 18:18:13,988 INFO L231 Difference]: Finished difference. Result has 126 places, 264 transitions, 3374 flow [2024-06-27 18:18:13,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3374, PETRI_PLACES=126, PETRI_TRANSITIONS=264} [2024-06-27 18:18:13,989 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 71 predicate places. [2024-06-27 18:18:13,989 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 264 transitions, 3374 flow [2024-06-27 18:18:13,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:13,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:13,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:13,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 18:18:13,990 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:13,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1873554828, now seen corresponding path program 4 times [2024-06-27 18:18:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:13,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216284861] [2024-06-27 18:18:13,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:13,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:15,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:15,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216284861] [2024-06-27 18:18:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216284861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:15,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:15,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:15,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120066823] [2024-06-27 18:18:15,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:15,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:15,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:15,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:15,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:15,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 18:18:15,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 264 transitions, 3374 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:15,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:15,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 18:18:15,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:16,898 INFO L124 PetriNetUnfolderBase]: 6391/10221 cut-off events. [2024-06-27 18:18:16,898 INFO L125 PetriNetUnfolderBase]: For 131794/131942 co-relation queries the response was YES. [2024-06-27 18:18:16,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51775 conditions, 10221 events. 6391/10221 cut-off events. For 131794/131942 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 66183 event pairs, 2825 based on Foata normal form. 20/9829 useless extension candidates. Maximal degree in co-relation 51721. Up to 8583 conditions per place. [2024-06-27 18:18:17,000 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 186 selfloop transitions, 149 changer transitions 0/350 dead transitions. [2024-06-27 18:18:17,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 350 transitions, 4906 flow [2024-06-27 18:18:17,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:18:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:18:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-06-27 18:18:17,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2024-06-27 18:18:17,003 INFO L175 Difference]: Start difference. First operand has 126 places, 264 transitions, 3374 flow. Second operand 8 states and 206 transitions. [2024-06-27 18:18:17,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 350 transitions, 4906 flow [2024-06-27 18:18:17,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 350 transitions, 4634 flow, removed 71 selfloop flow, removed 3 redundant places. [2024-06-27 18:18:17,645 INFO L231 Difference]: Finished difference. Result has 132 places, 307 transitions, 4264 flow [2024-06-27 18:18:17,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3180, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4264, PETRI_PLACES=132, PETRI_TRANSITIONS=307} [2024-06-27 18:18:17,646 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 77 predicate places. [2024-06-27 18:18:17,646 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 307 transitions, 4264 flow [2024-06-27 18:18:17,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:17,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:17,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:17,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 18:18:17,647 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:17,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1873723344, now seen corresponding path program 1 times [2024-06-27 18:18:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:17,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820468677] [2024-06-27 18:18:17,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:18,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820468677] [2024-06-27 18:18:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820468677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:18,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:18,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:18,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477589073] [2024-06-27 18:18:18,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:18,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:18,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:18,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:18,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:18,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:18,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 307 transitions, 4264 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:18,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:18,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:18,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:20,304 INFO L124 PetriNetUnfolderBase]: 6617/10505 cut-off events. [2024-06-27 18:18:20,305 INFO L125 PetriNetUnfolderBase]: For 136012/136026 co-relation queries the response was YES. [2024-06-27 18:18:20,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53819 conditions, 10505 events. 6617/10505 cut-off events. For 136012/136026 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 66950 event pairs, 2460 based on Foata normal form. 12/10170 useless extension candidates. Maximal degree in co-relation 53763. Up to 8944 conditions per place. [2024-06-27 18:18:20,380 INFO L140 encePairwiseOnDemand]: 32/49 looper letters, 228 selfloop transitions, 125 changer transitions 0/363 dead transitions. [2024-06-27 18:18:20,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 363 transitions, 5273 flow [2024-06-27 18:18:20,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:18:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:18:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-06-27 18:18:20,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2024-06-27 18:18:20,382 INFO L175 Difference]: Start difference. First operand has 132 places, 307 transitions, 4264 flow. Second operand 9 states and 222 transitions. [2024-06-27 18:18:20,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 363 transitions, 5273 flow [2024-06-27 18:18:20,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 363 transitions, 5029 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 18:18:20,580 INFO L231 Difference]: Finished difference. Result has 137 places, 316 transitions, 4444 flow [2024-06-27 18:18:20,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4020, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4444, PETRI_PLACES=137, PETRI_TRANSITIONS=316} [2024-06-27 18:18:20,581 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 82 predicate places. [2024-06-27 18:18:20,581 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 316 transitions, 4444 flow [2024-06-27 18:18:20,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:20,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:20,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:20,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 18:18:20,583 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:20,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:20,584 INFO L85 PathProgramCache]: Analyzing trace with hash 688779996, now seen corresponding path program 2 times [2024-06-27 18:18:20,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:20,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237311676] [2024-06-27 18:18:20,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:20,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:21,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:21,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237311676] [2024-06-27 18:18:21,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237311676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:21,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:21,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:21,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201934250] [2024-06-27 18:18:21,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:21,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:21,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:21,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:21,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:21,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 316 transitions, 4444 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:21,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:21,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:21,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:23,179 INFO L124 PetriNetUnfolderBase]: 6636/10533 cut-off events. [2024-06-27 18:18:23,179 INFO L125 PetriNetUnfolderBase]: For 148272/148280 co-relation queries the response was YES. [2024-06-27 18:18:23,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55903 conditions, 10533 events. 6636/10533 cut-off events. For 148272/148280 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 66661 event pairs, 2517 based on Foata normal form. 12/10207 useless extension candidates. Maximal degree in co-relation 55845. Up to 8947 conditions per place. [2024-06-27 18:18:23,274 INFO L140 encePairwiseOnDemand]: 32/49 looper letters, 227 selfloop transitions, 137 changer transitions 0/374 dead transitions. [2024-06-27 18:18:23,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 374 transitions, 5530 flow [2024-06-27 18:18:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:18:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:18:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-27 18:18:23,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056689342403629 [2024-06-27 18:18:23,276 INFO L175 Difference]: Start difference. First operand has 137 places, 316 transitions, 4444 flow. Second operand 9 states and 223 transitions. [2024-06-27 18:18:23,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 374 transitions, 5530 flow [2024-06-27 18:18:23,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 374 transitions, 5208 flow, removed 50 selfloop flow, removed 5 redundant places. [2024-06-27 18:18:23,551 INFO L231 Difference]: Finished difference. Result has 142 places, 327 transitions, 4627 flow [2024-06-27 18:18:23,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4182, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4627, PETRI_PLACES=142, PETRI_TRANSITIONS=327} [2024-06-27 18:18:23,551 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 87 predicate places. [2024-06-27 18:18:23,551 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 327 transitions, 4627 flow [2024-06-27 18:18:23,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:23,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:23,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:23,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 18:18:23,552 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:23,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1191235994, now seen corresponding path program 1 times [2024-06-27 18:18:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:23,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362968742] [2024-06-27 18:18:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:24,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 18:18:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362968742] [2024-06-27 18:18:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362968742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:24,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:24,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:24,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107381066] [2024-06-27 18:18:24,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:24,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:24,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:24,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:24,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:24,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 327 transitions, 4627 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:24,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:24,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:24,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:25,800 INFO L124 PetriNetUnfolderBase]: 6829/10807 cut-off events. [2024-06-27 18:18:25,801 INFO L125 PetriNetUnfolderBase]: For 169969/170007 co-relation queries the response was YES. [2024-06-27 18:18:25,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58638 conditions, 10807 events. 6829/10807 cut-off events. For 169969/170007 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 68755 event pairs, 3038 based on Foata normal form. 6/10441 useless extension candidates. Maximal degree in co-relation 58578. Up to 9516 conditions per place. [2024-06-27 18:18:25,897 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 340 selfloop transitions, 34 changer transitions 0/384 dead transitions. [2024-06-27 18:18:25,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 384 transitions, 5679 flow [2024-06-27 18:18:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:18:25,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:18:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-06-27 18:18:25,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-27 18:18:25,899 INFO L175 Difference]: Start difference. First operand has 142 places, 327 transitions, 4627 flow. Second operand 9 states and 216 transitions. [2024-06-27 18:18:25,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 384 transitions, 5679 flow [2024-06-27 18:18:26,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 384 transitions, 5490 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-27 18:18:26,158 INFO L231 Difference]: Finished difference. Result has 149 places, 337 transitions, 4651 flow [2024-06-27 18:18:26,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4438, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4651, PETRI_PLACES=149, PETRI_TRANSITIONS=337} [2024-06-27 18:18:26,159 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 94 predicate places. [2024-06-27 18:18:26,159 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 337 transitions, 4651 flow [2024-06-27 18:18:26,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:26,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:26,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:26,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 18:18:26,160 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:26,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:26,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1191235746, now seen corresponding path program 3 times [2024-06-27 18:18:26,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:26,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891508047] [2024-06-27 18:18:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:26,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891508047] [2024-06-27 18:18:26,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891508047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:26,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:26,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:26,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556757382] [2024-06-27 18:18:26,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:26,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:26,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:26,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:26,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:26,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:26,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 337 transitions, 4651 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:26,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:26,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:26,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:28,469 INFO L124 PetriNetUnfolderBase]: 6818/10801 cut-off events. [2024-06-27 18:18:28,470 INFO L125 PetriNetUnfolderBase]: For 177700/177704 co-relation queries the response was YES. [2024-06-27 18:18:28,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59923 conditions, 10801 events. 6818/10801 cut-off events. For 177700/177704 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 68404 event pairs, 2405 based on Foata normal form. 8/10462 useless extension candidates. Maximal degree in co-relation 59860. Up to 8766 conditions per place. [2024-06-27 18:18:28,562 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 192 selfloop transitions, 206 changer transitions 0/408 dead transitions. [2024-06-27 18:18:28,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 408 transitions, 6052 flow [2024-06-27 18:18:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:18:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:18:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2024-06-27 18:18:28,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147392290249433 [2024-06-27 18:18:28,564 INFO L175 Difference]: Start difference. First operand has 149 places, 337 transitions, 4651 flow. Second operand 9 states and 227 transitions. [2024-06-27 18:18:28,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 408 transitions, 6052 flow [2024-06-27 18:18:28,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 408 transitions, 5957 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-27 18:18:28,848 INFO L231 Difference]: Finished difference. Result has 156 places, 356 transitions, 5455 flow [2024-06-27 18:18:28,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4558, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5455, PETRI_PLACES=156, PETRI_TRANSITIONS=356} [2024-06-27 18:18:28,849 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 101 predicate places. [2024-06-27 18:18:28,849 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 356 transitions, 5455 flow [2024-06-27 18:18:28,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:28,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:28,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:28,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 18:18:28,850 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:28,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash 97137648, now seen corresponding path program 4 times [2024-06-27 18:18:28,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:28,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39972566] [2024-06-27 18:18:28,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:29,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:29,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39972566] [2024-06-27 18:18:29,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39972566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:29,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:29,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:29,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062986364] [2024-06-27 18:18:29,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:29,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:29,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:29,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:29,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:29,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:29,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 356 transitions, 5455 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:29,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:29,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:29,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:31,415 INFO L124 PetriNetUnfolderBase]: 6845/10803 cut-off events. [2024-06-27 18:18:31,415 INFO L125 PetriNetUnfolderBase]: For 203844/203856 co-relation queries the response was YES. [2024-06-27 18:18:31,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63514 conditions, 10803 events. 6845/10803 cut-off events. For 203844/203856 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 68125 event pairs, 2427 based on Foata normal form. 8/10466 useless extension candidates. Maximal degree in co-relation 63448. Up to 8799 conditions per place. [2024-06-27 18:18:31,530 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 210 selfloop transitions, 192 changer transitions 0/412 dead transitions. [2024-06-27 18:18:31,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 412 transitions, 6659 flow [2024-06-27 18:18:31,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:18:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:18:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-06-27 18:18:31,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2024-06-27 18:18:31,537 INFO L175 Difference]: Start difference. First operand has 156 places, 356 transitions, 5455 flow. Second operand 9 states and 228 transitions. [2024-06-27 18:18:31,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 412 transitions, 6659 flow [2024-06-27 18:18:31,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 412 transitions, 6458 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-27 18:18:31,986 INFO L231 Difference]: Finished difference. Result has 162 places, 361 transitions, 5848 flow [2024-06-27 18:18:31,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5264, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5848, PETRI_PLACES=162, PETRI_TRANSITIONS=361} [2024-06-27 18:18:31,987 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 107 predicate places. [2024-06-27 18:18:31,987 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 361 transitions, 5848 flow [2024-06-27 18:18:31,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:31,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:31,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:31,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 18:18:31,988 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:31,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1956800048, now seen corresponding path program 5 times [2024-06-27 18:18:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:31,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399700508] [2024-06-27 18:18:31,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:31,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:32,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:32,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399700508] [2024-06-27 18:18:32,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399700508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:32,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:32,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:32,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455825759] [2024-06-27 18:18:32,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:32,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:32,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:32,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:32,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:32,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 361 transitions, 5848 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:32,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:32,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:32,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:34,736 INFO L124 PetriNetUnfolderBase]: 6946/10943 cut-off events. [2024-06-27 18:18:34,736 INFO L125 PetriNetUnfolderBase]: For 219234/219256 co-relation queries the response was YES. [2024-06-27 18:18:34,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65706 conditions, 10943 events. 6946/10943 cut-off events. For 219234/219256 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 69327 event pairs, 2394 based on Foata normal form. 12/10605 useless extension candidates. Maximal degree in co-relation 65637. Up to 9204 conditions per place. [2024-06-27 18:18:34,866 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 242 selfloop transitions, 155 changer transitions 0/407 dead transitions. [2024-06-27 18:18:34,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 407 transitions, 6896 flow [2024-06-27 18:18:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:18:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:18:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-27 18:18:34,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076530612244898 [2024-06-27 18:18:34,869 INFO L175 Difference]: Start difference. First operand has 162 places, 361 transitions, 5848 flow. Second operand 8 states and 199 transitions. [2024-06-27 18:18:34,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 407 transitions, 6896 flow [2024-06-27 18:18:35,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 407 transitions, 6578 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-27 18:18:35,313 INFO L231 Difference]: Finished difference. Result has 165 places, 365 transitions, 5961 flow [2024-06-27 18:18:35,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5530, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5961, PETRI_PLACES=165, PETRI_TRANSITIONS=365} [2024-06-27 18:18:35,314 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 110 predicate places. [2024-06-27 18:18:35,314 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 365 transitions, 5961 flow [2024-06-27 18:18:35,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:35,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:35,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:35,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 18:18:35,315 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:35,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:35,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1545483062, now seen corresponding path program 6 times [2024-06-27 18:18:35,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:35,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116476718] [2024-06-27 18:18:35,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:35,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:36,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 18:18:36,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116476718] [2024-06-27 18:18:36,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116476718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:36,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:36,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:36,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706143893] [2024-06-27 18:18:36,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:36,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:36,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:36,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:36,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:36,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:36,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 365 transitions, 5961 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:36,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:36,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:36,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:38,512 INFO L124 PetriNetUnfolderBase]: 6946/10951 cut-off events. [2024-06-27 18:18:38,512 INFO L125 PetriNetUnfolderBase]: For 235709/235723 co-relation queries the response was YES. [2024-06-27 18:18:38,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67751 conditions, 10951 events. 6946/10951 cut-off events. For 235709/235723 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 69081 event pairs, 2206 based on Foata normal form. 8/10619 useless extension candidates. Maximal degree in co-relation 67681. Up to 8709 conditions per place. [2024-06-27 18:18:38,600 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 177 selfloop transitions, 234 changer transitions 0/421 dead transitions. [2024-06-27 18:18:38,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 421 transitions, 7296 flow [2024-06-27 18:18:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:18:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:18:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-06-27 18:18:38,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127551020408163 [2024-06-27 18:18:38,602 INFO L175 Difference]: Start difference. First operand has 165 places, 365 transitions, 5961 flow. Second operand 8 states and 201 transitions. [2024-06-27 18:18:38,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 421 transitions, 7296 flow [2024-06-27 18:18:39,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 421 transitions, 6959 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-27 18:18:39,142 INFO L231 Difference]: Finished difference. Result has 168 places, 377 transitions, 6416 flow [2024-06-27 18:18:39,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5624, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6416, PETRI_PLACES=168, PETRI_TRANSITIONS=377} [2024-06-27 18:18:39,143 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 113 predicate places. [2024-06-27 18:18:39,143 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 377 transitions, 6416 flow [2024-06-27 18:18:39,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:39,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:39,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:39,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 18:18:39,143 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:39,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1953045390, now seen corresponding path program 2 times [2024-06-27 18:18:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:39,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186233533] [2024-06-27 18:18:39,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186233533] [2024-06-27 18:18:39,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186233533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:39,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:39,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672528956] [2024-06-27 18:18:39,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:39,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:39,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:39,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:39,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:39,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 377 transitions, 6416 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:39,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:39,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:39,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:41,955 INFO L124 PetriNetUnfolderBase]: 7086/11149 cut-off events. [2024-06-27 18:18:41,955 INFO L125 PetriNetUnfolderBase]: For 273337/273377 co-relation queries the response was YES. [2024-06-27 18:18:42,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71592 conditions, 11149 events. 7086/11149 cut-off events. For 273337/273377 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 70775 event pairs, 2956 based on Foata normal form. 6/10782 useless extension candidates. Maximal degree in co-relation 71520. Up to 9819 conditions per place. [2024-06-27 18:18:42,069 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 365 selfloop transitions, 49 changer transitions 0/424 dead transitions. [2024-06-27 18:18:42,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 424 transitions, 7553 flow [2024-06-27 18:18:42,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:18:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:18:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-06-27 18:18:42,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4923469387755102 [2024-06-27 18:18:42,071 INFO L175 Difference]: Start difference. First operand has 168 places, 377 transitions, 6416 flow. Second operand 8 states and 193 transitions. [2024-06-27 18:18:42,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 424 transitions, 7553 flow [2024-06-27 18:18:42,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 424 transitions, 7216 flow, removed 55 selfloop flow, removed 5 redundant places. [2024-06-27 18:18:42,583 INFO L231 Difference]: Finished difference. Result has 171 places, 380 transitions, 6274 flow [2024-06-27 18:18:42,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6088, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6274, PETRI_PLACES=171, PETRI_TRANSITIONS=380} [2024-06-27 18:18:42,584 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 116 predicate places. [2024-06-27 18:18:42,585 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 380 transitions, 6274 flow [2024-06-27 18:18:42,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:42,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:42,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:42,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 18:18:42,585 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:42,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:42,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1295087528, now seen corresponding path program 7 times [2024-06-27 18:18:42,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:42,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261716089] [2024-06-27 18:18:42,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:42,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:43,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:43,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261716089] [2024-06-27 18:18:43,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261716089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:43,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:43,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:43,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082294690] [2024-06-27 18:18:43,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:43,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:43,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:43,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:43,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:43,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:43,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 380 transitions, 6274 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:43,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:43,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:43,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:45,167 INFO L124 PetriNetUnfolderBase]: 6991/11031 cut-off events. [2024-06-27 18:18:45,167 INFO L125 PetriNetUnfolderBase]: For 252410/252424 co-relation queries the response was YES. [2024-06-27 18:18:45,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70422 conditions, 11031 events. 6991/11031 cut-off events. For 252410/252424 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 69817 event pairs, 2241 based on Foata normal form. 8/10695 useless extension candidates. Maximal degree in co-relation 70349. Up to 8767 conditions per place. [2024-06-27 18:18:45,296 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 200 selfloop transitions, 218 changer transitions 0/428 dead transitions. [2024-06-27 18:18:45,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 428 transitions, 7492 flow [2024-06-27 18:18:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:18:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:18:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-06-27 18:18:45,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2024-06-27 18:18:45,298 INFO L175 Difference]: Start difference. First operand has 171 places, 380 transitions, 6274 flow. Second operand 8 states and 202 transitions. [2024-06-27 18:18:45,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 428 transitions, 7492 flow [2024-06-27 18:18:45,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 428 transitions, 7364 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 18:18:45,881 INFO L231 Difference]: Finished difference. Result has 173 places, 384 transitions, 6691 flow [2024-06-27 18:18:45,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6146, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6691, PETRI_PLACES=173, PETRI_TRANSITIONS=384} [2024-06-27 18:18:45,882 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 118 predicate places. [2024-06-27 18:18:45,883 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 384 transitions, 6691 flow [2024-06-27 18:18:45,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:45,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:45,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:45,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 18:18:45,883 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:45,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1849448066, now seen corresponding path program 8 times [2024-06-27 18:18:45,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:45,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571134821] [2024-06-27 18:18:45,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:46,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:46,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571134821] [2024-06-27 18:18:46,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571134821] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:46,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:46,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:46,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341618656] [2024-06-27 18:18:46,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:46,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:46,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:46,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:46,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:46,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 384 transitions, 6691 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:46,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:46,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:46,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:48,751 INFO L124 PetriNetUnfolderBase]: 6985/11070 cut-off events. [2024-06-27 18:18:48,751 INFO L125 PetriNetUnfolderBase]: For 264842/264848 co-relation queries the response was YES. [2024-06-27 18:18:48,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71750 conditions, 11070 events. 6985/11070 cut-off events. For 264842/264848 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 70466 event pairs, 2103 based on Foata normal form. 8/10730 useless extension candidates. Maximal degree in co-relation 71676. Up to 8566 conditions per place. [2024-06-27 18:18:48,865 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 174 selfloop transitions, 266 changer transitions 0/450 dead transitions. [2024-06-27 18:18:48,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 450 transitions, 8259 flow [2024-06-27 18:18:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:18:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:18:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-06-27 18:18:48,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127551020408163 [2024-06-27 18:18:48,877 INFO L175 Difference]: Start difference. First operand has 173 places, 384 transitions, 6691 flow. Second operand 8 states and 201 transitions. [2024-06-27 18:18:48,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 450 transitions, 8259 flow [2024-06-27 18:18:49,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 450 transitions, 7883 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-27 18:18:49,664 INFO L231 Difference]: Finished difference. Result has 177 places, 405 transitions, 7347 flow [2024-06-27 18:18:49,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6319, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7347, PETRI_PLACES=177, PETRI_TRANSITIONS=405} [2024-06-27 18:18:49,665 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 122 predicate places. [2024-06-27 18:18:49,665 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 405 transitions, 7347 flow [2024-06-27 18:18:49,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:49,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:49,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:49,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 18:18:49,666 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:49,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash -280018458, now seen corresponding path program 3 times [2024-06-27 18:18:49,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:49,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205889411] [2024-06-27 18:18:49,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:49,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:50,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:50,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205889411] [2024-06-27 18:18:50,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205889411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:50,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:50,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:50,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497723881] [2024-06-27 18:18:50,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:50,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:50,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:50,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:50,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:50,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:50,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 405 transitions, 7347 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:50,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:50,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:50,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:52,444 INFO L124 PetriNetUnfolderBase]: 7200/11354 cut-off events. [2024-06-27 18:18:52,444 INFO L125 PetriNetUnfolderBase]: For 303183/303228 co-relation queries the response was YES. [2024-06-27 18:18:52,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76508 conditions, 11354 events. 7200/11354 cut-off events. For 303183/303228 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 72278 event pairs, 2898 based on Foata normal form. 14/11006 useless extension candidates. Maximal degree in co-relation 76432. Up to 9808 conditions per place. [2024-06-27 18:18:52,560 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 380 selfloop transitions, 78 changer transitions 0/468 dead transitions. [2024-06-27 18:18:52,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 468 transitions, 9076 flow [2024-06-27 18:18:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:18:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:18:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-06-27 18:18:52,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127551020408163 [2024-06-27 18:18:52,562 INFO L175 Difference]: Start difference. First operand has 177 places, 405 transitions, 7347 flow. Second operand 8 states and 201 transitions. [2024-06-27 18:18:52,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 468 transitions, 9076 flow [2024-06-27 18:18:53,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 468 transitions, 8627 flow, removed 108 selfloop flow, removed 3 redundant places. [2024-06-27 18:18:53,346 INFO L231 Difference]: Finished difference. Result has 182 places, 414 transitions, 7326 flow [2024-06-27 18:18:53,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6921, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7326, PETRI_PLACES=182, PETRI_TRANSITIONS=414} [2024-06-27 18:18:53,347 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 127 predicate places. [2024-06-27 18:18:53,347 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 414 transitions, 7326 flow [2024-06-27 18:18:53,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:53,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:53,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:53,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 18:18:53,348 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:53,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:53,348 INFO L85 PathProgramCache]: Analyzing trace with hash 56817934, now seen corresponding path program 9 times [2024-06-27 18:18:53,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:53,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914889022] [2024-06-27 18:18:53,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:53,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:54,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:54,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914889022] [2024-06-27 18:18:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914889022] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:54,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:54,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:54,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559032225] [2024-06-27 18:18:54,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:54,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:54,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:54,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:54,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 414 transitions, 7326 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:54,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:54,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:54,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:55,923 INFO L124 PetriNetUnfolderBase]: 7092/11237 cut-off events. [2024-06-27 18:18:55,924 INFO L125 PetriNetUnfolderBase]: For 302407/302413 co-relation queries the response was YES. [2024-06-27 18:18:56,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76979 conditions, 11237 events. 7092/11237 cut-off events. For 302407/302413 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 71524 event pairs, 2168 based on Foata normal form. 8/10894 useless extension candidates. Maximal degree in co-relation 76901. Up to 8692 conditions per place. [2024-06-27 18:18:56,059 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 210 selfloop transitions, 251 changer transitions 0/471 dead transitions. [2024-06-27 18:18:56,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 471 transitions, 8951 flow [2024-06-27 18:18:56,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:18:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:18:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-06-27 18:18:56,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2024-06-27 18:18:56,061 INFO L175 Difference]: Start difference. First operand has 182 places, 414 transitions, 7326 flow. Second operand 8 states and 204 transitions. [2024-06-27 18:18:56,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 471 transitions, 8951 flow [2024-06-27 18:18:57,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 471 transitions, 8827 flow, removed 40 selfloop flow, removed 3 redundant places. [2024-06-27 18:18:57,087 INFO L231 Difference]: Finished difference. Result has 188 places, 426 transitions, 8025 flow [2024-06-27 18:18:57,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7202, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8025, PETRI_PLACES=188, PETRI_TRANSITIONS=426} [2024-06-27 18:18:57,088 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 133 predicate places. [2024-06-27 18:18:57,088 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 426 transitions, 8025 flow [2024-06-27 18:18:57,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:57,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:18:57,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:18:57,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 18:18:57,088 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:18:57,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:18:57,089 INFO L85 PathProgramCache]: Analyzing trace with hash 65395572, now seen corresponding path program 4 times [2024-06-27 18:18:57,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:18:57,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205082909] [2024-06-27 18:18:57,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:18:57,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:18:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:18:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:18:57,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:18:57,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205082909] [2024-06-27 18:18:57,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205082909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:18:57,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:18:57,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:18:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099482405] [2024-06-27 18:18:57,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:18:57,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:18:57,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:18:57,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:18:57,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:18:57,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:18:57,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 426 transitions, 8025 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:18:57,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:18:57,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:18:57,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:18:59,762 INFO L124 PetriNetUnfolderBase]: 7237/11414 cut-off events. [2024-06-27 18:18:59,763 INFO L125 PetriNetUnfolderBase]: For 332585/332630 co-relation queries the response was YES. [2024-06-27 18:18:59,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79742 conditions, 11414 events. 7237/11414 cut-off events. For 332585/332630 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 72730 event pairs, 2898 based on Foata normal form. 14/11063 useless extension candidates. Maximal degree in co-relation 79661. Up to 9861 conditions per place. [2024-06-27 18:18:59,883 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 383 selfloop transitions, 85 changer transitions 0/478 dead transitions. [2024-06-27 18:18:59,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 478 transitions, 9427 flow [2024-06-27 18:18:59,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:18:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:18:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-06-27 18:18:59,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2024-06-27 18:18:59,885 INFO L175 Difference]: Start difference. First operand has 188 places, 426 transitions, 8025 flow. Second operand 8 states and 198 transitions. [2024-06-27 18:18:59,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 478 transitions, 9427 flow [2024-06-27 18:19:01,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 478 transitions, 8907 flow, removed 108 selfloop flow, removed 3 redundant places. [2024-06-27 18:19:01,181 INFO L231 Difference]: Finished difference. Result has 193 places, 426 transitions, 7703 flow [2024-06-27 18:19:01,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7525, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7703, PETRI_PLACES=193, PETRI_TRANSITIONS=426} [2024-06-27 18:19:01,182 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 138 predicate places. [2024-06-27 18:19:01,182 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 426 transitions, 7703 flow [2024-06-27 18:19:01,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:01,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:19:01,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:19:01,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 18:19:01,183 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:19:01,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:19:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash -280249346, now seen corresponding path program 10 times [2024-06-27 18:19:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:19:01,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449243312] [2024-06-27 18:19:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:19:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:19:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:19:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:19:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:19:02,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449243312] [2024-06-27 18:19:02,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449243312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:19:02,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:19:02,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:19:02,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402783392] [2024-06-27 18:19:02,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:19:02,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:19:02,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:19:02,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:19:02,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:19:02,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:19:02,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 426 transitions, 7703 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:02,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:19:02,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:19:02,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:19:04,918 INFO L124 PetriNetUnfolderBase]: 7077/11216 cut-off events. [2024-06-27 18:19:04,919 INFO L125 PetriNetUnfolderBase]: For 319860/319866 co-relation queries the response was YES. [2024-06-27 18:19:04,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77385 conditions, 11216 events. 7077/11216 cut-off events. For 319860/319866 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 71443 event pairs, 2166 based on Foata normal form. 8/10873 useless extension candidates. Maximal degree in co-relation 77303. Up to 8677 conditions per place. [2024-06-27 18:19:05,020 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 211 selfloop transitions, 249 changer transitions 0/470 dead transitions. [2024-06-27 18:19:05,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 470 transitions, 8935 flow [2024-06-27 18:19:05,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:19:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:19:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-06-27 18:19:05,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2024-06-27 18:19:05,022 INFO L175 Difference]: Start difference. First operand has 193 places, 426 transitions, 7703 flow. Second operand 8 states and 204 transitions. [2024-06-27 18:19:05,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 470 transitions, 8935 flow [2024-06-27 18:19:05,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 470 transitions, 8702 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-27 18:19:05,801 INFO L231 Difference]: Finished difference. Result has 195 places, 426 transitions, 7978 flow [2024-06-27 18:19:05,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7470, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7978, PETRI_PLACES=195, PETRI_TRANSITIONS=426} [2024-06-27 18:19:05,802 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 140 predicate places. [2024-06-27 18:19:05,802 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 426 transitions, 7978 flow [2024-06-27 18:19:05,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:05,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:19:05,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:19:05,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 18:19:05,803 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:19:05,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:19:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash 56824692, now seen corresponding path program 5 times [2024-06-27 18:19:05,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:19:05,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557284236] [2024-06-27 18:19:05,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:19:05,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:19:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:19:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:19:06,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:19:06,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557284236] [2024-06-27 18:19:06,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557284236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:19:06,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:19:06,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:19:06,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048369044] [2024-06-27 18:19:06,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:19:06,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:19:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:19:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:19:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:19:06,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:19:06,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 426 transitions, 7978 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:06,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:19:06,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:19:06,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:19:09,391 INFO L124 PetriNetUnfolderBase]: 7222/11390 cut-off events. [2024-06-27 18:19:09,392 INFO L125 PetriNetUnfolderBase]: For 347713/347758 co-relation queries the response was YES. [2024-06-27 18:19:09,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79310 conditions, 11390 events. 7222/11390 cut-off events. For 347713/347758 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 72590 event pairs, 2900 based on Foata normal form. 14/11039 useless extension candidates. Maximal degree in co-relation 79227. Up to 9842 conditions per place. [2024-06-27 18:19:09,557 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 392 selfloop transitions, 75 changer transitions 0/477 dead transitions. [2024-06-27 18:19:09,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 477 transitions, 9272 flow [2024-06-27 18:19:09,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:19:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:19:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-06-27 18:19:09,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2024-06-27 18:19:09,560 INFO L175 Difference]: Start difference. First operand has 195 places, 426 transitions, 7978 flow. Second operand 8 states and 198 transitions. [2024-06-27 18:19:09,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 477 transitions, 9272 flow [2024-06-27 18:19:10,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 477 transitions, 8727 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-27 18:19:10,992 INFO L231 Difference]: Finished difference. Result has 197 places, 426 transitions, 7607 flow [2024-06-27 18:19:10,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7448, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7607, PETRI_PLACES=197, PETRI_TRANSITIONS=426} [2024-06-27 18:19:10,993 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 142 predicate places. [2024-06-27 18:19:10,993 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 426 transitions, 7607 flow [2024-06-27 18:19:10,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:10,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:19:10,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:19:10,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 18:19:10,994 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:19:10,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:19:10,995 INFO L85 PathProgramCache]: Analyzing trace with hash 65406484, now seen corresponding path program 1 times [2024-06-27 18:19:10,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:19:10,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998778149] [2024-06-27 18:19:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:19:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:19:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:19:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:19:12,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:19:12,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998778149] [2024-06-27 18:19:12,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998778149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:19:12,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:19:12,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:19:12,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645035429] [2024-06-27 18:19:12,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:19:12,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:19:12,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:19:12,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:19:12,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:19:12,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:19:12,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 426 transitions, 7607 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:12,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:19:12,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:19:12,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:19:14,475 INFO L124 PetriNetUnfolderBase]: 7240/11538 cut-off events. [2024-06-27 18:19:14,475 INFO L125 PetriNetUnfolderBase]: For 362326/362355 co-relation queries the response was YES. [2024-06-27 18:19:14,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79170 conditions, 11538 events. 7240/11538 cut-off events. For 362326/362355 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 74442 event pairs, 3076 based on Foata normal form. 2/11114 useless extension candidates. Maximal degree in co-relation 79086. Up to 10089 conditions per place. [2024-06-27 18:19:14,582 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 446 selfloop transitions, 29 changer transitions 0/485 dead transitions. [2024-06-27 18:19:14,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 485 transitions, 8931 flow [2024-06-27 18:19:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:19:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:19:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-06-27 18:19:14,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-27 18:19:14,584 INFO L175 Difference]: Start difference. First operand has 197 places, 426 transitions, 7607 flow. Second operand 9 states and 216 transitions. [2024-06-27 18:19:14,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 485 transitions, 8931 flow [2024-06-27 18:19:15,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 485 transitions, 8701 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-27 18:19:15,430 INFO L231 Difference]: Finished difference. Result has 199 places, 433 transitions, 7566 flow [2024-06-27 18:19:15,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7385, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7566, PETRI_PLACES=199, PETRI_TRANSITIONS=433} [2024-06-27 18:19:15,431 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 144 predicate places. [2024-06-27 18:19:15,431 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 433 transitions, 7566 flow [2024-06-27 18:19:15,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:15,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:19:15,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:19:15,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 18:19:15,432 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:19:15,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:19:15,432 INFO L85 PathProgramCache]: Analyzing trace with hash -857322238, now seen corresponding path program 1 times [2024-06-27 18:19:15,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:19:15,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568087361] [2024-06-27 18:19:15,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:19:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:19:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:19:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:19:16,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:19:16,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568087361] [2024-06-27 18:19:16,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568087361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:19:16,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:19:16,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:19:16,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133718024] [2024-06-27 18:19:16,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:19:16,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:19:16,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:19:16,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:19:16,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:19:16,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:19:16,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 433 transitions, 7566 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 18:19:16,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:19:16,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:19:16,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:19:18,402 INFO L124 PetriNetUnfolderBase]: 7309/11599 cut-off events. [2024-06-27 18:19:18,403 INFO L125 PetriNetUnfolderBase]: For 372694/373194 co-relation queries the response was YES. [2024-06-27 18:19:18,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80247 conditions, 11599 events. 7309/11599 cut-off events. For 372694/373194 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 74285 event pairs, 3342 based on Foata normal form. 163/11412 useless extension candidates. Maximal degree in co-relation 80161. Up to 10131 conditions per place. [2024-06-27 18:19:18,527 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 405 selfloop transitions, 18 changer transitions 0/458 dead transitions. [2024-06-27 18:19:18,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 458 transitions, 8564 flow [2024-06-27 18:19:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:19:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:19:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-06-27 18:19:18,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 18:19:18,529 INFO L175 Difference]: Start difference. First operand has 199 places, 433 transitions, 7566 flow. Second operand 6 states and 140 transitions. [2024-06-27 18:19:18,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 458 transitions, 8564 flow [2024-06-27 18:19:19,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 458 transitions, 8437 flow, removed 38 selfloop flow, removed 6 redundant places. [2024-06-27 18:19:19,345 INFO L231 Difference]: Finished difference. Result has 199 places, 436 transitions, 7519 flow [2024-06-27 18:19:19,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7439, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7519, PETRI_PLACES=199, PETRI_TRANSITIONS=436} [2024-06-27 18:19:19,346 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 144 predicate places. [2024-06-27 18:19:19,346 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 436 transitions, 7519 flow [2024-06-27 18:19:19,346 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 18:19:19,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:19:19,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:19:19,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 18:19:19,347 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:19:19,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:19:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash -584562794, now seen corresponding path program 1 times [2024-06-27 18:19:19,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:19:19,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674439223] [2024-06-27 18:19:19,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:19:19,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:19:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:19:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:19:20,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:19:20,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674439223] [2024-06-27 18:19:20,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674439223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:19:20,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:19:20,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:19:20,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125354808] [2024-06-27 18:19:20,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:19:20,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:19:20,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:19:20,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:19:20,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:19:20,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 18:19:20,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 436 transitions, 7519 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:20,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:19:20,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 18:19:20,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:19:23,225 INFO L124 PetriNetUnfolderBase]: 7722/12217 cut-off events. [2024-06-27 18:19:23,226 INFO L125 PetriNetUnfolderBase]: For 434968/435637 co-relation queries the response was YES. [2024-06-27 18:19:23,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86892 conditions, 12217 events. 7722/12217 cut-off events. For 434968/435637 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 79648 event pairs, 2565 based on Foata normal form. 126/11880 useless extension candidates. Maximal degree in co-relation 86805. Up to 10292 conditions per place. [2024-06-27 18:19:23,355 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 344 selfloop transitions, 137 changer transitions 0/519 dead transitions. [2024-06-27 18:19:23,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 519 transitions, 9247 flow [2024-06-27 18:19:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:19:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:19:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2024-06-27 18:19:23,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192743764172335 [2024-06-27 18:19:23,359 INFO L175 Difference]: Start difference. First operand has 199 places, 436 transitions, 7519 flow. Second operand 9 states and 229 transitions. [2024-06-27 18:19:23,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 519 transitions, 9247 flow [2024-06-27 18:19:24,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 519 transitions, 9193 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-27 18:19:24,205 INFO L231 Difference]: Finished difference. Result has 205 places, 474 transitions, 8400 flow [2024-06-27 18:19:24,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7465, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8400, PETRI_PLACES=205, PETRI_TRANSITIONS=474} [2024-06-27 18:19:24,206 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 150 predicate places. [2024-06-27 18:19:24,207 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 474 transitions, 8400 flow [2024-06-27 18:19:24,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:24,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:19:24,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:19:24,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 18:19:24,208 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:19:24,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:19:24,208 INFO L85 PathProgramCache]: Analyzing trace with hash 362580256, now seen corresponding path program 2 times [2024-06-27 18:19:24,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:19:24,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101242782] [2024-06-27 18:19:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:19:24,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:19:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:19:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:19:25,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:19:25,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101242782] [2024-06-27 18:19:25,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101242782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:19:25,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:19:25,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:19:25,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358885385] [2024-06-27 18:19:25,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:19:25,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:19:25,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:19:25,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:19:25,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:19:25,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-27 18:19:25,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 474 transitions, 8400 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:25,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:19:25,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-27 18:19:25,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:19:28,042 INFO L124 PetriNetUnfolderBase]: 7688/12262 cut-off events. [2024-06-27 18:19:28,043 INFO L125 PetriNetUnfolderBase]: For 439269/439642 co-relation queries the response was YES. [2024-06-27 18:19:28,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88651 conditions, 12262 events. 7688/12262 cut-off events. For 439269/439642 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 80544 event pairs, 2912 based on Foata normal form. 126/11973 useless extension candidates. Maximal degree in co-relation 88562. Up to 10281 conditions per place. [2024-06-27 18:19:28,163 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 350 selfloop transitions, 147 changer transitions 0/535 dead transitions. [2024-06-27 18:19:28,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 535 transitions, 9849 flow [2024-06-27 18:19:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:19:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:19:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-06-27 18:19:28,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215419501133787 [2024-06-27 18:19:28,165 INFO L175 Difference]: Start difference. First operand has 205 places, 474 transitions, 8400 flow. Second operand 9 states and 230 transitions. [2024-06-27 18:19:28,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 535 transitions, 9849 flow [2024-06-27 18:19:28,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 535 transitions, 9588 flow, removed 122 selfloop flow, removed 3 redundant places. [2024-06-27 18:19:28,930 INFO L231 Difference]: Finished difference. Result has 212 places, 487 transitions, 8752 flow [2024-06-27 18:19:28,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8259, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8752, PETRI_PLACES=212, PETRI_TRANSITIONS=487} [2024-06-27 18:19:28,931 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 157 predicate places. [2024-06-27 18:19:28,931 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 487 transitions, 8752 flow [2024-06-27 18:19:28,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:28,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:19:28,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 18:19:28,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 18:19:28,932 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:19:28,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:19:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1038106605, now seen corresponding path program 1 times [2024-06-27 18:19:28,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:19:28,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753819666] [2024-06-27 18:19:28,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:19:28,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:19:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:19:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:19:30,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:19:30,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753819666] [2024-06-27 18:19:30,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753819666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:19:30,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:19:30,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:19:30,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027076716] [2024-06-27 18:19:30,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:19:30,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:19:30,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:19:30,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:19:30,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:19:30,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:19:30,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 487 transitions, 8752 flow. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:30,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:19:30,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:19:30,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:19:33,016 INFO L124 PetriNetUnfolderBase]: 8040/12671 cut-off events. [2024-06-27 18:19:33,017 INFO L125 PetriNetUnfolderBase]: For 447422/447447 co-relation queries the response was YES. [2024-06-27 18:19:33,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91616 conditions, 12671 events. 8040/12671 cut-off events. For 447422/447447 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 81855 event pairs, 2506 based on Foata normal form. 24/12327 useless extension candidates. Maximal degree in co-relation 91525. Up to 10862 conditions per place. [2024-06-27 18:19:33,138 INFO L140 encePairwiseOnDemand]: 31/49 looper letters, 374 selfloop transitions, 160 changer transitions 0/545 dead transitions. [2024-06-27 18:19:33,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 545 transitions, 10150 flow [2024-06-27 18:19:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:19:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:19:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-06-27 18:19:33,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020408163265306 [2024-06-27 18:19:33,140 INFO L175 Difference]: Start difference. First operand has 212 places, 487 transitions, 8752 flow. Second operand 10 states and 246 transitions. [2024-06-27 18:19:33,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 545 transitions, 10150 flow [2024-06-27 18:19:34,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 545 transitions, 9820 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-06-27 18:19:34,022 INFO L231 Difference]: Finished difference. Result has 217 places, 491 transitions, 8868 flow [2024-06-27 18:19:34,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8422, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8868, PETRI_PLACES=217, PETRI_TRANSITIONS=491} [2024-06-27 18:19:34,023 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 162 predicate places. [2024-06-27 18:19:34,023 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 491 transitions, 8868 flow [2024-06-27 18:19:34,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:34,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:19:34,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:19:34,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 18:19:34,024 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:19:34,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:19:34,024 INFO L85 PathProgramCache]: Analyzing trace with hash 346017111, now seen corresponding path program 1 times [2024-06-27 18:19:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:19:34,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725599332] [2024-06-27 18:19:34,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:19:34,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:19:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:19:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:19:35,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:19:35,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725599332] [2024-06-27 18:19:35,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725599332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:19:35,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:19:35,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:19:35,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969101237] [2024-06-27 18:19:35,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:19:35,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:19:35,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:19:35,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:19:35,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:19:35,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 18:19:35,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 491 transitions, 8868 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:35,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:19:35,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 18:19:35,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:19:37,634 INFO L124 PetriNetUnfolderBase]: 8141/12762 cut-off events. [2024-06-27 18:19:37,634 INFO L125 PetriNetUnfolderBase]: For 487459/487483 co-relation queries the response was YES. [2024-06-27 18:19:37,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94713 conditions, 12762 events. 8141/12762 cut-off events. For 487459/487483 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 82033 event pairs, 2932 based on Foata normal form. 12/12386 useless extension candidates. Maximal degree in co-relation 94621. Up to 10922 conditions per place. [2024-06-27 18:19:37,768 INFO L140 encePairwiseOnDemand]: 33/49 looper letters, 351 selfloop transitions, 195 changer transitions 0/557 dead transitions. [2024-06-27 18:19:37,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 557 transitions, 10692 flow [2024-06-27 18:19:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:19:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:19:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-06-27 18:19:37,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 18:19:37,769 INFO L175 Difference]: Start difference. First operand has 217 places, 491 transitions, 8868 flow. Second operand 9 states and 224 transitions. [2024-06-27 18:19:37,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 557 transitions, 10692 flow [2024-06-27 18:19:38,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 557 transitions, 10278 flow, removed 50 selfloop flow, removed 8 redundant places. [2024-06-27 18:19:38,997 INFO L231 Difference]: Finished difference. Result has 219 places, 511 transitions, 9518 flow [2024-06-27 18:19:38,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8454, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9518, PETRI_PLACES=219, PETRI_TRANSITIONS=511} [2024-06-27 18:19:38,998 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 164 predicate places. [2024-06-27 18:19:38,998 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 511 transitions, 9518 flow [2024-06-27 18:19:38,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:19:38,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:19:38,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:19:38,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 18:19:38,999 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:19:38,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:19:38,999 INFO L85 PathProgramCache]: Analyzing trace with hash 362695576, now seen corresponding path program 3 times [2024-06-27 18:19:38,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:19:38,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009486735] [2024-06-27 18:19:39,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:19:39,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:19:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat