./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/protection/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:53:49,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:53:49,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:53:49,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:53:49,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:53:49,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:53:49,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:53:49,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:53:49,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:53:49,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:53:49,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:53:49,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:53:49,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:53:49,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:53:49,948 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:53:49,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:53:49,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:53:49,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:53:49,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:53:49,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:53:49,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:53:49,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:53:49,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:53:49,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:53:49,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:53:49,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:53:49,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:53:49,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:53:49,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:53:49,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:53:49,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:53:49,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:53:49,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:53:49,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:53:49,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:53:49,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:53:49,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:53:49,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:53:49,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:53:49,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:53:49,954 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:53:49,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:53:49,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:53:49,955 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:53:50,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:53:50,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:53:50,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:53:50,123 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:53:50,123 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:53:50,124 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-27 18:53:50,274 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:53:50,281 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:53:50,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-06-27 18:53:51,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:53:51,595 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:53:51,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-06-27 18:53:51,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ecf2c037/f4262be3b463426ca62a1056172bc00f/FLAG1fc6f5dc3 [2024-06-27 18:53:51,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ecf2c037/f4262be3b463426ca62a1056172bc00f [2024-06-27 18:53:51,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:53:51,617 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:53:51,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:53:51,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:53:51,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:53:51,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:53:50" (1/2) ... [2024-06-27 18:53:51,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66071fba and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:53:51, skipping insertion in model container [2024-06-27 18:53:51,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:53:50" (1/2) ... [2024-06-27 18:53:51,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@46e17800 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:53:51, skipping insertion in model container [2024-06-27 18:53:51,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:53:51" (2/2) ... [2024-06-27 18:53:51,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66071fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:51, skipping insertion in model container [2024-06-27 18:53:51,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:53:51" (2/2) ... [2024-06-27 18:53:51,626 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:53:51,694 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:53:51,695 INFO L97 edCorrectnessWitness]: Location invariant before [L821-L821] ((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1)) [2024-06-27 18:53:51,695 INFO L97 edCorrectnessWitness]: Location invariant before [L824-L824] ((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1)) [2024-06-27 18:53:51,695 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] ((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1)) [2024-06-27 18:53:51,695 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:53:51,695 INFO L106 edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1; [2024-06-27 18:53:51,732 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:53:51,924 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2024-06-27 18:53:52,093 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:53:52,101 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 18:53:52,129 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:53:52,183 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:53:52,212 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:53:52,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52 WrapperNode [2024-06-27 18:53:52,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:53:52,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:53:52,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:53:52,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:53:52,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (1/1) ... [2024-06-27 18:53:52,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (1/1) ... [2024-06-27 18:53:52,276 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2024-06-27 18:53:52,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:53:52,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:53:52,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:53:52,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:53:52,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (1/1) ... [2024-06-27 18:53:52,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (1/1) ... [2024-06-27 18:53:52,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (1/1) ... [2024-06-27 18:53:52,316 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:53:52,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (1/1) ... [2024-06-27 18:53:52,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (1/1) ... [2024-06-27 18:53:52,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (1/1) ... [2024-06-27 18:53:52,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (1/1) ... [2024-06-27 18:53:52,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (1/1) ... [2024-06-27 18:53:52,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (1/1) ... [2024-06-27 18:53:52,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:53:52,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:53:52,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:53:52,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:53:52,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (1/1) ... [2024-06-27 18:53:52,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:53:52,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:53:52,381 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:53:52,412 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:53:52,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:53:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:53:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 18:53:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 18:53:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 18:53:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 18:53:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 18:53:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 18:53:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:53:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:53:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:53:52,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:53:52,444 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:53:52,561 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:53:52,562 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:53:52,801 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:53:52,802 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:53:52,960 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:53:52,960 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 18:53:52,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:53:52 BoogieIcfgContainer [2024-06-27 18:53:52,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:53:52,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:53:52,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:53:52,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:53:52,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:53:50" (1/4) ... [2024-06-27 18:53:52,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af992eb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:53:52, skipping insertion in model container [2024-06-27 18:53:52,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:53:51" (2/4) ... [2024-06-27 18:53:52,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af992eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:53:52, skipping insertion in model container [2024-06-27 18:53:52,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:53:52" (3/4) ... [2024-06-27 18:53:52,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af992eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:53:52, skipping insertion in model container [2024-06-27 18:53:52,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:53:52" (4/4) ... [2024-06-27 18:53:52,970 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-06-27 18:53:52,983 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:53:52,983 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 18:53:52,983 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:53:53,022 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:53:53,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 46 transitions, 104 flow [2024-06-27 18:53:53,067 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-06-27 18:53:53,068 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:53:53,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 1/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-06-27 18:53:53,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 46 transitions, 104 flow [2024-06-27 18:53:53,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 43 transitions, 95 flow [2024-06-27 18:53:53,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:53:53,085 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;@3b73aa87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:53:53,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 18:53:53,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:53:53,089 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 18:53:53,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:53:53,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:53,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:53:53,090 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:53:53,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:53,095 INFO L85 PathProgramCache]: Analyzing trace with hash 351326339, now seen corresponding path program 1 times [2024-06-27 18:53:53,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:53,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536400820] [2024-06-27 18:53:53,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:53,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:53,784 INFO L134 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:53:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536400820] [2024-06-27 18:53:53,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536400820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:53,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:53,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:53:53,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101761751] [2024-06-27 18:53:53,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:53,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:53:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:53,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:53:53,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:53:53,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:53:53,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:53:53,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:53,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:53:53,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:54,680 INFO L124 PetriNetUnfolderBase]: 4274/6158 cut-off events. [2024-06-27 18:53:54,681 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-06-27 18:53:54,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12411 conditions, 6158 events. 4274/6158 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 33060 event pairs, 2343 based on Foata normal form. 211/6051 useless extension candidates. Maximal degree in co-relation 12399. Up to 6135 conditions per place. [2024-06-27 18:53:54,714 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 43 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2024-06-27 18:53:54,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 227 flow [2024-06-27 18:53:54,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:53:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:53:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-06-27 18:53:54,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 18:53:54,725 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 92 transitions. [2024-06-27 18:53:54,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 227 flow [2024-06-27 18:53:54,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 18:53:54,732 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 127 flow [2024-06-27 18:53:54,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-06-27 18:53:54,737 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-06-27 18:53:54,737 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 127 flow [2024-06-27 18:53:54,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:53:54,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:54,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:53:54,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:53:54,738 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:53:54,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:54,740 INFO L85 PathProgramCache]: Analyzing trace with hash 351326598, now seen corresponding path program 1 times [2024-06-27 18:53:54,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:54,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161547303] [2024-06-27 18:53:54,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:54,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:54,815 INFO L134 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:53:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:54,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161547303] [2024-06-27 18:53:54,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161547303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:54,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:54,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:53:54,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875772699] [2024-06-27 18:53:54,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:54,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:53:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:53:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:53:54,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 46 [2024-06-27 18:53:54,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:53:54,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:54,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 46 [2024-06-27 18:53:54,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:55,056 INFO L124 PetriNetUnfolderBase]: 891/1719 cut-off events. [2024-06-27 18:53:55,057 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2024-06-27 18:53:55,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3324 conditions, 1719 events. 891/1719 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11434 event pairs, 577 based on Foata normal form. 0/1581 useless extension candidates. Maximal degree in co-relation 3312. Up to 1152 conditions per place. [2024-06-27 18:53:55,065 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 35 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-06-27 18:53:55,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 230 flow [2024-06-27 18:53:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:53:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:53:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-06-27 18:53:55,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7753623188405797 [2024-06-27 18:53:55,068 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 127 flow. Second operand 3 states and 107 transitions. [2024-06-27 18:53:55,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 230 flow [2024-06-27 18:53:55,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:53:55,071 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 120 flow [2024-06-27 18:53:55,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-06-27 18:53:55,072 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-06-27 18:53:55,072 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 120 flow [2024-06-27 18:53:55,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:53:55,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:55,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:55,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:53:55,075 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:53:55,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1677553359, now seen corresponding path program 1 times [2024-06-27 18:53:55,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:55,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101321213] [2024-06-27 18:53:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:55,446 INFO L134 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:53:55,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:55,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101321213] [2024-06-27 18:53:55,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101321213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:55,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:55,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:53:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026133559] [2024-06-27 18:53:55,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:55,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:53:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:55,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:53:55,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:53:55,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:53:55,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:55,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:55,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:53:55,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:55,996 INFO L124 PetriNetUnfolderBase]: 3632/5789 cut-off events. [2024-06-27 18:53:55,996 INFO L125 PetriNetUnfolderBase]: For 1374/1382 co-relation queries the response was YES. [2024-06-27 18:53:56,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12420 conditions, 5789 events. 3632/5789 cut-off events. For 1374/1382 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 34529 event pairs, 2727 based on Foata normal form. 6/5613 useless extension candidates. Maximal degree in co-relation 12407. Up to 5209 conditions per place. [2024-06-27 18:53:56,021 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 51 selfloop transitions, 8 changer transitions 2/71 dead transitions. [2024-06-27 18:53:56,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 316 flow [2024-06-27 18:53:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:53:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:53:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-06-27 18:53:56,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6141304347826086 [2024-06-27 18:53:56,023 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 120 flow. Second operand 4 states and 113 transitions. [2024-06-27 18:53:56,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 316 flow [2024-06-27 18:53:56,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:53:56,025 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 181 flow [2024-06-27 18:53:56,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-06-27 18:53:56,025 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-06-27 18:53:56,026 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 181 flow [2024-06-27 18:53:56,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:56,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:56,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:56,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:53:56,026 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:53:56,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash -464545842, now seen corresponding path program 1 times [2024-06-27 18:53:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791356408] [2024-06-27 18:53:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:56,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:56,436 INFO L134 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:53:56,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791356408] [2024-06-27 18:53:56,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791356408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:56,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:56,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:53:56,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967854667] [2024-06-27 18:53:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:56,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:53:56,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:56,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:53:56,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:53:56,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:53:56,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:53:56,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:56,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:53:56,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:56,970 INFO L124 PetriNetUnfolderBase]: 3229/5232 cut-off events. [2024-06-27 18:53:56,971 INFO L125 PetriNetUnfolderBase]: For 2291/2312 co-relation queries the response was YES. [2024-06-27 18:53:56,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12145 conditions, 5232 events. 3229/5232 cut-off events. For 2291/2312 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 31700 event pairs, 1658 based on Foata normal form. 11/5054 useless extension candidates. Maximal degree in co-relation 12130. Up to 4542 conditions per place. [2024-06-27 18:53:57,000 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 68 selfloop transitions, 18 changer transitions 0/96 dead transitions. [2024-06-27 18:53:57,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 499 flow [2024-06-27 18:53:57,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:53:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:53:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2024-06-27 18:53:57,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6347826086956522 [2024-06-27 18:53:57,004 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 181 flow. Second operand 5 states and 146 transitions. [2024-06-27 18:53:57,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 499 flow [2024-06-27 18:53:57,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 96 transitions, 488 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 18:53:57,009 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 295 flow [2024-06-27 18:53:57,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2024-06-27 18:53:57,010 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2024-06-27 18:53:57,010 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 295 flow [2024-06-27 18:53:57,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:53:57,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:57,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:57,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:53:57,011 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:53:57,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1737663488, now seen corresponding path program 1 times [2024-06-27 18:53:57,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:57,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390127710] [2024-06-27 18:53:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:57,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:57,767 INFO L134 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:53:57,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:57,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390127710] [2024-06-27 18:53:57,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390127710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:57,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:57,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:53:57,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25376704] [2024-06-27 18:53:57,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:57,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:53:57,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:57,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:53:57,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:53:57,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:53:57,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:53:57,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:57,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:53:57,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:58,431 INFO L124 PetriNetUnfolderBase]: 3257/5271 cut-off events. [2024-06-27 18:53:58,431 INFO L125 PetriNetUnfolderBase]: For 5548/5590 co-relation queries the response was YES. [2024-06-27 18:53:58,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14228 conditions, 5271 events. 3257/5271 cut-off events. For 5548/5590 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 31892 event pairs, 1395 based on Foata normal form. 15/5097 useless extension candidates. Maximal degree in co-relation 14209. Up to 4541 conditions per place. [2024-06-27 18:53:58,457 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 78 selfloop transitions, 23 changer transitions 0/111 dead transitions. [2024-06-27 18:53:58,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 111 transitions, 661 flow [2024-06-27 18:53:58,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:53:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:53:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2024-06-27 18:53:58,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2024-06-27 18:53:58,459 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 295 flow. Second operand 6 states and 174 transitions. [2024-06-27 18:53:58,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 111 transitions, 661 flow [2024-06-27 18:53:58,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 111 transitions, 653 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-27 18:53:58,465 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 379 flow [2024-06-27 18:53:58,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2024-06-27 18:53:58,466 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-06-27 18:53:58,466 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 379 flow [2024-06-27 18:53:58,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:53:58,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:58,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:58,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:53:58,467 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:53:58,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:58,467 INFO L85 PathProgramCache]: Analyzing trace with hash 248069165, now seen corresponding path program 1 times [2024-06-27 18:53:58,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:58,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146131056] [2024-06-27 18:53:58,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:58,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:53:59,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:59,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146131056] [2024-06-27 18:53:59,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146131056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:59,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:59,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:53:59,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131086321] [2024-06-27 18:53:59,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:59,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:53:59,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:59,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:53:59,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:53:59,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 18:53:59,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 379 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:59,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:59,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 18:53:59,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:59,861 INFO L124 PetriNetUnfolderBase]: 3583/5739 cut-off events. [2024-06-27 18:53:59,862 INFO L125 PetriNetUnfolderBase]: For 9384/9426 co-relation queries the response was YES. [2024-06-27 18:53:59,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17228 conditions, 5739 events. 3583/5739 cut-off events. For 9384/9426 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 34607 event pairs, 1091 based on Foata normal form. 44/5594 useless extension candidates. Maximal degree in co-relation 17206. Up to 4494 conditions per place. [2024-06-27 18:53:59,890 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 118 selfloop transitions, 41 changer transitions 0/169 dead transitions. [2024-06-27 18:53:59,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 169 transitions, 1201 flow [2024-06-27 18:53:59,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:53:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:53:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2024-06-27 18:53:59,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6490683229813664 [2024-06-27 18:53:59,892 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 379 flow. Second operand 7 states and 209 transitions. [2024-06-27 18:53:59,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 169 transitions, 1201 flow [2024-06-27 18:53:59,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 169 transitions, 1110 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-27 18:53:59,898 INFO L231 Difference]: Finished difference. Result has 72 places, 103 transitions, 708 flow [2024-06-27 18:53:59,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=708, PETRI_PLACES=72, PETRI_TRANSITIONS=103} [2024-06-27 18:53:59,899 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2024-06-27 18:53:59,899 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 103 transitions, 708 flow [2024-06-27 18:53:59,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:59,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:59,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:59,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:53:59,900 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:53:59,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:59,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1729784140, now seen corresponding path program 1 times [2024-06-27 18:53:59,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:59,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799831368] [2024-06-27 18:53:59,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:00,269 INFO L134 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:54:00,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:00,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799831368] [2024-06-27 18:54:00,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799831368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:00,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:00,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:54:00,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8842638] [2024-06-27 18:54:00,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:00,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:54:00,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:00,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:54:00,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:54:00,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 18:54:00,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 103 transitions, 708 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:00,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:00,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 18:54:00,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:00,993 INFO L124 PetriNetUnfolderBase]: 4097/6464 cut-off events. [2024-06-27 18:54:00,994 INFO L125 PetriNetUnfolderBase]: For 20201/20235 co-relation queries the response was YES. [2024-06-27 18:54:01,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23343 conditions, 6464 events. 4097/6464 cut-off events. For 20201/20235 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 38482 event pairs, 1683 based on Foata normal form. 14/6291 useless extension candidates. Maximal degree in co-relation 23315. Up to 5871 conditions per place. [2024-06-27 18:54:01,035 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 102 selfloop transitions, 17 changer transitions 0/127 dead transitions. [2024-06-27 18:54:01,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 127 transitions, 1049 flow [2024-06-27 18:54:01,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:54:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:54:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-06-27 18:54:01,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 18:54:01,037 INFO L175 Difference]: Start difference. First operand has 72 places, 103 transitions, 708 flow. Second operand 5 states and 115 transitions. [2024-06-27 18:54:01,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 127 transitions, 1049 flow [2024-06-27 18:54:01,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 127 transitions, 1019 flow, removed 15 selfloop flow, removed 0 redundant places. [2024-06-27 18:54:01,052 INFO L231 Difference]: Finished difference. Result has 77 places, 108 transitions, 785 flow [2024-06-27 18:54:01,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=785, PETRI_PLACES=77, PETRI_TRANSITIONS=108} [2024-06-27 18:54:01,053 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2024-06-27 18:54:01,053 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 108 transitions, 785 flow [2024-06-27 18:54:01,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:01,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:01,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:01,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:54:01,054 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:01,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2038468369, now seen corresponding path program 1 times [2024-06-27 18:54:01,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:01,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677342048] [2024-06-27 18:54:01,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:01,508 INFO L134 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:54:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:01,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677342048] [2024-06-27 18:54:01,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677342048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:01,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:01,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:54:01,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779054765] [2024-06-27 18:54:01,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:01,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:54:01,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:01,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:54:01,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:54:01,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:01,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 108 transitions, 785 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:01,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:01,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:01,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:02,519 INFO L124 PetriNetUnfolderBase]: 4917/7719 cut-off events. [2024-06-27 18:54:02,519 INFO L125 PetriNetUnfolderBase]: For 26045/26045 co-relation queries the response was YES. [2024-06-27 18:54:02,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27857 conditions, 7719 events. 4917/7719 cut-off events. For 26045/26045 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 46706 event pairs, 2031 based on Foata normal form. 4/7499 useless extension candidates. Maximal degree in co-relation 27825. Up to 6975 conditions per place. [2024-06-27 18:54:02,576 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 130 selfloop transitions, 18 changer transitions 0/155 dead transitions. [2024-06-27 18:54:02,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 155 transitions, 1328 flow [2024-06-27 18:54:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:54:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:54:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-06-27 18:54:02,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855072463768116 [2024-06-27 18:54:02,578 INFO L175 Difference]: Start difference. First operand has 77 places, 108 transitions, 785 flow. Second operand 6 states and 134 transitions. [2024-06-27 18:54:02,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 155 transitions, 1328 flow [2024-06-27 18:54:02,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 155 transitions, 1268 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-27 18:54:02,603 INFO L231 Difference]: Finished difference. Result has 82 places, 124 transitions, 964 flow [2024-06-27 18:54:02,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=964, PETRI_PLACES=82, PETRI_TRANSITIONS=124} [2024-06-27 18:54:02,605 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2024-06-27 18:54:02,605 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 124 transitions, 964 flow [2024-06-27 18:54:02,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:02,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:02,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:02,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:54:02,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:02,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:02,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1557328706, now seen corresponding path program 1 times [2024-06-27 18:54:02,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:02,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869366319] [2024-06-27 18:54:02,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:03,086 INFO L134 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:54:03,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:03,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869366319] [2024-06-27 18:54:03,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869366319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:03,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:03,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:54:03,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321426753] [2024-06-27 18:54:03,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:03,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:54:03,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:03,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:54:03,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:54:03,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 18:54:03,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 124 transitions, 964 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:03,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:03,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 18:54:03,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:03,865 INFO L124 PetriNetUnfolderBase]: 4659/7358 cut-off events. [2024-06-27 18:54:03,866 INFO L125 PetriNetUnfolderBase]: For 32381/32539 co-relation queries the response was YES. [2024-06-27 18:54:03,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28814 conditions, 7358 events. 4659/7358 cut-off events. For 32381/32539 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 45052 event pairs, 1673 based on Foata normal form. 72/7174 useless extension candidates. Maximal degree in co-relation 28779. Up to 6503 conditions per place. [2024-06-27 18:54:04,038 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 120 selfloop transitions, 31 changer transitions 0/162 dead transitions. [2024-06-27 18:54:04,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 162 transitions, 1441 flow [2024-06-27 18:54:04,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:54:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:54:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-06-27 18:54:04,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253623188405797 [2024-06-27 18:54:04,039 INFO L175 Difference]: Start difference. First operand has 82 places, 124 transitions, 964 flow. Second operand 6 states and 145 transitions. [2024-06-27 18:54:04,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 162 transitions, 1441 flow [2024-06-27 18:54:04,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 162 transitions, 1433 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 18:54:04,063 INFO L231 Difference]: Finished difference. Result has 87 places, 129 transitions, 1082 flow [2024-06-27 18:54:04,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1082, PETRI_PLACES=87, PETRI_TRANSITIONS=129} [2024-06-27 18:54:04,065 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2024-06-27 18:54:04,065 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 129 transitions, 1082 flow [2024-06-27 18:54:04,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:04,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:04,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:04,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 18:54:04,066 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:04,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:04,066 INFO L85 PathProgramCache]: Analyzing trace with hash 170265354, now seen corresponding path program 2 times [2024-06-27 18:54:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:04,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825970084] [2024-06-27 18:54:04,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:04,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:54:04,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:04,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825970084] [2024-06-27 18:54:04,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825970084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:04,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:04,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:54:04,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074036667] [2024-06-27 18:54:04,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:04,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:54:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:54:04,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:54:04,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 18:54:04,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 129 transitions, 1082 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:04,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:04,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 18:54:04,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:05,340 INFO L124 PetriNetUnfolderBase]: 4635/7318 cut-off events. [2024-06-27 18:54:05,340 INFO L125 PetriNetUnfolderBase]: For 34469/34651 co-relation queries the response was YES. [2024-06-27 18:54:05,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29021 conditions, 7318 events. 4635/7318 cut-off events. For 34469/34651 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 44710 event pairs, 1859 based on Foata normal form. 24/7094 useless extension candidates. Maximal degree in co-relation 28983. Up to 6593 conditions per place. [2024-06-27 18:54:05,377 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 123 selfloop transitions, 19 changer transitions 0/153 dead transitions. [2024-06-27 18:54:05,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 153 transitions, 1431 flow [2024-06-27 18:54:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:54:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:54:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-06-27 18:54:05,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855072463768116 [2024-06-27 18:54:05,379 INFO L175 Difference]: Start difference. First operand has 87 places, 129 transitions, 1082 flow. Second operand 6 states and 134 transitions. [2024-06-27 18:54:05,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 153 transitions, 1431 flow [2024-06-27 18:54:05,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 153 transitions, 1387 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 18:54:05,404 INFO L231 Difference]: Finished difference. Result has 90 places, 129 transitions, 1087 flow [2024-06-27 18:54:05,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1087, PETRI_PLACES=90, PETRI_TRANSITIONS=129} [2024-06-27 18:54:05,405 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 38 predicate places. [2024-06-27 18:54:05,405 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 129 transitions, 1087 flow [2024-06-27 18:54:05,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:05,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:05,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:05,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 18:54:05,406 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:05,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1032551481, now seen corresponding path program 1 times [2024-06-27 18:54:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:05,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283396009] [2024-06-27 18:54:05,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:05,934 INFO L134 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:54:05,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:05,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283396009] [2024-06-27 18:54:05,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283396009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:05,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:05,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:54:05,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707907049] [2024-06-27 18:54:05,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:05,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:54:05,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:05,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:54:05,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:54:05,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:05,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 129 transitions, 1087 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:05,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:05,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:05,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:06,962 INFO L124 PetriNetUnfolderBase]: 5112/7993 cut-off events. [2024-06-27 18:54:06,963 INFO L125 PetriNetUnfolderBase]: For 33957/33957 co-relation queries the response was YES. [2024-06-27 18:54:06,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30584 conditions, 7993 events. 5112/7993 cut-off events. For 33957/33957 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 48193 event pairs, 1586 based on Foata normal form. 8/7773 useless extension candidates. Maximal degree in co-relation 30545. Up to 6928 conditions per place. [2024-06-27 18:54:07,008 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 172 selfloop transitions, 31 changer transitions 0/210 dead transitions. [2024-06-27 18:54:07,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 210 transitions, 1973 flow [2024-06-27 18:54:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:54:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:54:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-06-27 18:54:07,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186335403726708 [2024-06-27 18:54:07,010 INFO L175 Difference]: Start difference. First operand has 90 places, 129 transitions, 1087 flow. Second operand 7 states and 167 transitions. [2024-06-27 18:54:07,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 210 transitions, 1973 flow [2024-06-27 18:54:07,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 210 transitions, 1844 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-27 18:54:07,043 INFO L231 Difference]: Finished difference. Result has 94 places, 156 transitions, 1336 flow [2024-06-27 18:54:07,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1336, PETRI_PLACES=94, PETRI_TRANSITIONS=156} [2024-06-27 18:54:07,043 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 42 predicate places. [2024-06-27 18:54:07,044 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 156 transitions, 1336 flow [2024-06-27 18:54:07,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:07,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:07,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:07,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 18:54:07,045 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:07,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:07,045 INFO L85 PathProgramCache]: Analyzing trace with hash 983260529, now seen corresponding path program 2 times [2024-06-27 18:54:07,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:07,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898122804] [2024-06-27 18:54:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:07,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:54:07,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:07,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898122804] [2024-06-27 18:54:07,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898122804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:07,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:07,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:54:07,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311975848] [2024-06-27 18:54:07,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:07,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:54:07,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:07,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:54:07,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:54:07,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:07,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 156 transitions, 1336 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:07,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:07,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:07,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:08,535 INFO L124 PetriNetUnfolderBase]: 5164/8064 cut-off events. [2024-06-27 18:54:08,535 INFO L125 PetriNetUnfolderBase]: For 39379/39379 co-relation queries the response was YES. [2024-06-27 18:54:08,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33338 conditions, 8064 events. 5164/8064 cut-off events. For 39379/39379 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 48388 event pairs, 1909 based on Foata normal form. 4/7841 useless extension candidates. Maximal degree in co-relation 33296. Up to 7250 conditions per place. [2024-06-27 18:54:08,590 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 174 selfloop transitions, 23 changer transitions 0/204 dead transitions. [2024-06-27 18:54:08,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 204 transitions, 1972 flow [2024-06-27 18:54:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:54:08,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:54:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-06-27 18:54:08,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48757763975155277 [2024-06-27 18:54:08,592 INFO L175 Difference]: Start difference. First operand has 94 places, 156 transitions, 1336 flow. Second operand 7 states and 157 transitions. [2024-06-27 18:54:08,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 204 transitions, 1972 flow [2024-06-27 18:54:08,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 204 transitions, 1950 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-27 18:54:08,630 INFO L231 Difference]: Finished difference. Result has 101 places, 166 transitions, 1477 flow [2024-06-27 18:54:08,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1477, PETRI_PLACES=101, PETRI_TRANSITIONS=166} [2024-06-27 18:54:08,631 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 49 predicate places. [2024-06-27 18:54:08,631 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 166 transitions, 1477 flow [2024-06-27 18:54:08,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:08,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:08,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:08,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 18:54:08,632 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:08,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:08,632 INFO L85 PathProgramCache]: Analyzing trace with hash 463065999, now seen corresponding path program 3 times [2024-06-27 18:54:08,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:08,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602596970] [2024-06-27 18:54:08,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:54:09,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:09,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602596970] [2024-06-27 18:54:09,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602596970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:09,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:09,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:54:09,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602954721] [2024-06-27 18:54:09,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:09,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:54:09,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:09,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:54:09,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:54:09,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:09,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 166 transitions, 1477 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:09,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:09,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:09,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:10,111 INFO L124 PetriNetUnfolderBase]: 5154/8050 cut-off events. [2024-06-27 18:54:10,111 INFO L125 PetriNetUnfolderBase]: For 43025/43025 co-relation queries the response was YES. [2024-06-27 18:54:10,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33844 conditions, 8050 events. 5154/8050 cut-off events. For 43025/43025 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 48296 event pairs, 1912 based on Foata normal form. 4/7827 useless extension candidates. Maximal degree in co-relation 33798. Up to 7296 conditions per place. [2024-06-27 18:54:10,163 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 174 selfloop transitions, 17 changer transitions 0/198 dead transitions. [2024-06-27 18:54:10,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 198 transitions, 1951 flow [2024-06-27 18:54:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:54:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:54:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-27 18:54:10,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4658385093167702 [2024-06-27 18:54:10,164 INFO L175 Difference]: Start difference. First operand has 101 places, 166 transitions, 1477 flow. Second operand 7 states and 150 transitions. [2024-06-27 18:54:10,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 198 transitions, 1951 flow [2024-06-27 18:54:10,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 198 transitions, 1920 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-27 18:54:10,204 INFO L231 Difference]: Finished difference. Result has 106 places, 167 transitions, 1498 flow [2024-06-27 18:54:10,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1498, PETRI_PLACES=106, PETRI_TRANSITIONS=167} [2024-06-27 18:54:10,205 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 54 predicate places. [2024-06-27 18:54:10,205 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 167 transitions, 1498 flow [2024-06-27 18:54:10,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:10,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:10,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:10,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 18:54:10,205 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:10,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:10,206 INFO L85 PathProgramCache]: Analyzing trace with hash 463075888, now seen corresponding path program 1 times [2024-06-27 18:54:10,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:10,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513170341] [2024-06-27 18:54:10,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:10,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:54:11,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:11,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513170341] [2024-06-27 18:54:11,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513170341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:11,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:11,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:54:11,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156510935] [2024-06-27 18:54:11,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:11,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:54:11,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:11,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:54:11,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:54:11,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:11,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 167 transitions, 1498 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:11,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:11,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:11,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:12,390 INFO L124 PetriNetUnfolderBase]: 5146/8068 cut-off events. [2024-06-27 18:54:12,391 INFO L125 PetriNetUnfolderBase]: For 45304/45304 co-relation queries the response was YES. [2024-06-27 18:54:12,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34015 conditions, 8068 events. 5146/8068 cut-off events. For 45304/45304 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 48750 event pairs, 1844 based on Foata normal form. 4/7835 useless extension candidates. Maximal degree in co-relation 33967. Up to 7247 conditions per place. [2024-06-27 18:54:12,454 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 177 selfloop transitions, 24 changer transitions 0/208 dead transitions. [2024-06-27 18:54:12,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 208 transitions, 2038 flow [2024-06-27 18:54:12,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:54:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:54:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-06-27 18:54:12,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484472049689441 [2024-06-27 18:54:12,456 INFO L175 Difference]: Start difference. First operand has 106 places, 167 transitions, 1498 flow. Second operand 7 states and 156 transitions. [2024-06-27 18:54:12,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 208 transitions, 2038 flow [2024-06-27 18:54:12,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 208 transitions, 2002 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 18:54:12,517 INFO L231 Difference]: Finished difference. Result has 109 places, 169 transitions, 1539 flow [2024-06-27 18:54:12,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1539, PETRI_PLACES=109, PETRI_TRANSITIONS=169} [2024-06-27 18:54:12,518 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 57 predicate places. [2024-06-27 18:54:12,518 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 169 transitions, 1539 flow [2024-06-27 18:54:12,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:12,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:12,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:12,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 18:54:12,519 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:12,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash -624604633, now seen corresponding path program 1 times [2024-06-27 18:54:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:12,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812642043] [2024-06-27 18:54:12,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:13,217 INFO L134 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:54:13,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812642043] [2024-06-27 18:54:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812642043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:13,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:13,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:54:13,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847768150] [2024-06-27 18:54:13,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:13,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:54:13,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:13,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:54:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:54:13,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 18:54:13,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 169 transitions, 1539 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:13,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:13,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 18:54:13,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:13,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][125], [161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 29#L794true, 6#L823-5true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 206#true, Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:13,701 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-27 18:54:13,701 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 18:54:13,701 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 18:54:13,701 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 18:54:13,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][78], [24#L784true, 161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 6#L823-5true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 206#true, Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:13,702 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-27 18:54:13,702 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 18:54:13,702 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 18:54:13,702 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 18:54:13,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([346] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][105], [161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 6#L823-5true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 10#L761true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 206#true, Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:13,703 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-27 18:54:13,703 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 18:54:13,703 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 18:54:13,703 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 18:54:13,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][125], [161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, 19#L824true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 29#L794true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:13,761 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-27 18:54:13,761 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 18:54:13,761 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 18:54:13,761 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 18:54:13,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][78], [24#L784true, 161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 19#L824true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:13,762 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-27 18:54:13,762 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 18:54:13,762 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 18:54:13,762 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 18:54:13,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([346] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][105], [161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, 19#L824true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 10#L761true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:13,763 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-27 18:54:13,763 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 18:54:13,763 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 18:54:13,763 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 18:54:13,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][125], [161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 29#L794true, 43#L824-1true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:13,832 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-27 18:54:13,832 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 18:54:13,832 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 18:54:13,832 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 18:54:13,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][78], [24#L784true, 161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 43#L824-1true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:13,832 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-27 18:54:13,833 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 18:54:13,833 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 18:54:13,833 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 18:54:13,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([346] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][105], [161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 43#L824-1true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 10#L761true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:13,833 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-27 18:54:13,833 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 18:54:13,834 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 18:54:13,834 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 18:54:14,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][125], [161#true, 44#L828true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 29#L794true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:14,029 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 18:54:14,029 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:54:14,029 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:54:14,030 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:54:14,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][78], [24#L784true, 161#true, 44#L828true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:14,030 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 18:54:14,030 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:54:14,030 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:54:14,030 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:54:14,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([346] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][105], [161#true, 44#L828true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 10#L761true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:14,031 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 18:54:14,031 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:54:14,031 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:54:14,031 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 18:54:14,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][125], [161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 29#L794true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 34#L834true, 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:14,097 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-27 18:54:14,098 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:54:14,098 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:54:14,098 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:54:14,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][78], [24#L784true, 161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 34#L834true, 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:14,098 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-27 18:54:14,098 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:54:14,098 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:54:14,098 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:54:14,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([346] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][105], [161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 10#L761true, 34#L834true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:14,099 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-27 18:54:14,099 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:54:14,099 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:54:14,099 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:54:14,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][125], [161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 29#L794true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 40#L850true, 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:14,148 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-27 18:54:14,148 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:54:14,148 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:54:14,148 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:54:14,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([346] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][105], [161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 10#L761true, 40#L850true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:14,149 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-27 18:54:14,149 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:54:14,149 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:54:14,149 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:54:14,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][78], [24#L784true, 161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 40#L850true, 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 206#true, Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:14,197 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2024-06-27 18:54:14,198 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-06-27 18:54:14,198 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-06-27 18:54:14,198 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-06-27 18:54:14,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][125], [161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 29#L794true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 38#L18-1true, 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:14,204 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-06-27 18:54:14,204 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:54:14,204 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:54:14,204 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:54:14,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][78], [24#L784true, 161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 38#L18-1true, 27#L754true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:14,205 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-06-27 18:54:14,205 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:54:14,205 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:54:14,205 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:54:14,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([346] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][105], [161#true, Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 190#true, 86#true, 109#true, Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 198#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 147#true, Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (or (= 2 ~z~0) (= ~z~0 0)) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 22#L781true, Black: 154#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 92#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 9#L791true, 71#true, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 10#L761true, 38#L18-1true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 206#true, Black: 117#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-27 18:54:14,205 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-06-27 18:54:14,206 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:54:14,206 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:54:14,206 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:54:14,348 INFO L124 PetriNetUnfolderBase]: 5068/7909 cut-off events. [2024-06-27 18:54:14,348 INFO L125 PetriNetUnfolderBase]: For 57089/57511 co-relation queries the response was YES. [2024-06-27 18:54:14,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35131 conditions, 7909 events. 5068/7909 cut-off events. For 57089/57511 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 48213 event pairs, 1422 based on Foata normal form. 146/7676 useless extension candidates. Maximal degree in co-relation 35082. Up to 6500 conditions per place. [2024-06-27 18:54:14,409 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 160 selfloop transitions, 56 changer transitions 0/237 dead transitions. [2024-06-27 18:54:14,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 237 transitions, 2420 flow [2024-06-27 18:54:14,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:54:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:54:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-06-27 18:54:14,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5559006211180124 [2024-06-27 18:54:14,411 INFO L175 Difference]: Start difference. First operand has 109 places, 169 transitions, 1539 flow. Second operand 7 states and 179 transitions. [2024-06-27 18:54:14,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 237 transitions, 2420 flow [2024-06-27 18:54:14,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 237 transitions, 2361 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 18:54:14,459 INFO L231 Difference]: Finished difference. Result has 112 places, 179 transitions, 1723 flow [2024-06-27 18:54:14,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1723, PETRI_PLACES=112, PETRI_TRANSITIONS=179} [2024-06-27 18:54:14,459 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 60 predicate places. [2024-06-27 18:54:14,459 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 179 transitions, 1723 flow [2024-06-27 18:54:14,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:14,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:14,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:14,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 18:54:14,460 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:14,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:14,460 INFO L85 PathProgramCache]: Analyzing trace with hash -624514423, now seen corresponding path program 2 times [2024-06-27 18:54:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:14,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621404489] [2024-06-27 18:54:14,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:14,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:15,072 INFO L134 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:54:15,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621404489] [2024-06-27 18:54:15,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621404489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:15,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:15,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:54:15,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19164367] [2024-06-27 18:54:15,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:15,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:54:15,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:15,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:54:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:54:15,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 18:54:15,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 179 transitions, 1723 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:15,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:15,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 18:54:15,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:16,212 INFO L124 PetriNetUnfolderBase]: 5058/7892 cut-off events. [2024-06-27 18:54:16,212 INFO L125 PetriNetUnfolderBase]: For 68567/69097 co-relation queries the response was YES. [2024-06-27 18:54:16,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37538 conditions, 7892 events. 5058/7892 cut-off events. For 68567/69097 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 47977 event pairs, 1436 based on Foata normal form. 66/7591 useless extension candidates. Maximal degree in co-relation 37487. Up to 6619 conditions per place. [2024-06-27 18:54:16,270 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 165 selfloop transitions, 52 changer transitions 0/238 dead transitions. [2024-06-27 18:54:16,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 238 transitions, 2551 flow [2024-06-27 18:54:16,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:54:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:54:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-06-27 18:54:16,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434782608695652 [2024-06-27 18:54:16,273 INFO L175 Difference]: Start difference. First operand has 112 places, 179 transitions, 1723 flow. Second operand 7 states and 175 transitions. [2024-06-27 18:54:16,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 238 transitions, 2551 flow [2024-06-27 18:54:16,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 238 transitions, 2457 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-27 18:54:16,352 INFO L231 Difference]: Finished difference. Result has 118 places, 186 transitions, 1871 flow [2024-06-27 18:54:16,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1871, PETRI_PLACES=118, PETRI_TRANSITIONS=186} [2024-06-27 18:54:16,352 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 66 predicate places. [2024-06-27 18:54:16,353 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 186 transitions, 1871 flow [2024-06-27 18:54:16,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:16,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:16,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:16,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 18:54:16,353 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:16,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:16,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1944326504, now seen corresponding path program 1 times [2024-06-27 18:54:16,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:16,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647186074] [2024-06-27 18:54:16,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:16,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:54:16,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:16,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647186074] [2024-06-27 18:54:16,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647186074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:16,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:16,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:54:16,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072574399] [2024-06-27 18:54:16,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:16,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:54:16,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:16,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:54:16,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:54:16,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:16,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 186 transitions, 1871 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:16,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:16,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:16,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:17,929 INFO L124 PetriNetUnfolderBase]: 5398/8374 cut-off events. [2024-06-27 18:54:17,930 INFO L125 PetriNetUnfolderBase]: For 65220/65223 co-relation queries the response was YES. [2024-06-27 18:54:17,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39596 conditions, 8374 events. 5398/8374 cut-off events. For 65220/65223 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 50228 event pairs, 1572 based on Foata normal form. 6/8155 useless extension candidates. Maximal degree in co-relation 39541. Up to 7218 conditions per place. [2024-06-27 18:54:18,105 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 196 selfloop transitions, 42 changer transitions 0/245 dead transitions. [2024-06-27 18:54:18,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 245 transitions, 2739 flow [2024-06-27 18:54:18,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:54:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:54:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-06-27 18:54:18,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5248447204968945 [2024-06-27 18:54:18,107 INFO L175 Difference]: Start difference. First operand has 118 places, 186 transitions, 1871 flow. Second operand 7 states and 169 transitions. [2024-06-27 18:54:18,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 245 transitions, 2739 flow [2024-06-27 18:54:18,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 245 transitions, 2646 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 18:54:18,170 INFO L231 Difference]: Finished difference. Result has 122 places, 194 transitions, 1967 flow [2024-06-27 18:54:18,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1782, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1967, PETRI_PLACES=122, PETRI_TRANSITIONS=194} [2024-06-27 18:54:18,170 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 70 predicate places. [2024-06-27 18:54:18,171 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 194 transitions, 1967 flow [2024-06-27 18:54:18,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:18,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:18,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:18,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 18:54:18,171 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:18,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:18,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1944320924, now seen corresponding path program 2 times [2024-06-27 18:54:18,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:18,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562061286] [2024-06-27 18:54:18,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:18,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:54:18,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:18,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562061286] [2024-06-27 18:54:18,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562061286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:18,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:18,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:54:18,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556185340] [2024-06-27 18:54:18,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:18,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:54:18,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:18,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:54:18,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:54:18,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:18,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 194 transitions, 1967 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:18,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:18,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:18,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:19,767 INFO L124 PetriNetUnfolderBase]: 5388/8354 cut-off events. [2024-06-27 18:54:19,767 INFO L125 PetriNetUnfolderBase]: For 68751/68754 co-relation queries the response was YES. [2024-06-27 18:54:19,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39832 conditions, 8354 events. 5388/8354 cut-off events. For 68751/68754 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 50056 event pairs, 1556 based on Foata normal form. 6/8137 useless extension candidates. Maximal degree in co-relation 39775. Up to 7210 conditions per place. [2024-06-27 18:54:19,835 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 192 selfloop transitions, 48 changer transitions 0/247 dead transitions. [2024-06-27 18:54:19,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 247 transitions, 2723 flow [2024-06-27 18:54:19,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:54:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:54:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-27 18:54:19,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.531055900621118 [2024-06-27 18:54:19,837 INFO L175 Difference]: Start difference. First operand has 122 places, 194 transitions, 1967 flow. Second operand 7 states and 171 transitions. [2024-06-27 18:54:19,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 247 transitions, 2723 flow [2024-06-27 18:54:19,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 247 transitions, 2667 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 18:54:19,923 INFO L231 Difference]: Finished difference. Result has 127 places, 197 transitions, 2076 flow [2024-06-27 18:54:19,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1912, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2076, PETRI_PLACES=127, PETRI_TRANSITIONS=197} [2024-06-27 18:54:19,924 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 75 predicate places. [2024-06-27 18:54:19,924 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 197 transitions, 2076 flow [2024-06-27 18:54:19,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:19,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:19,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:19,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 18:54:19,924 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:19,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:19,925 INFO L85 PathProgramCache]: Analyzing trace with hash 424848329, now seen corresponding path program 1 times [2024-06-27 18:54:19,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:19,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046312681] [2024-06-27 18:54:19,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:20,656 INFO L134 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:54:20,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:20,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046312681] [2024-06-27 18:54:20,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046312681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:20,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:20,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:54:20,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050217878] [2024-06-27 18:54:20,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:20,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:54:20,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:20,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:54:20,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:54:20,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:20,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 197 transitions, 2076 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:20,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:20,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:20,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:21,998 INFO L124 PetriNetUnfolderBase]: 5399/8425 cut-off events. [2024-06-27 18:54:21,999 INFO L125 PetriNetUnfolderBase]: For 73812/73812 co-relation queries the response was YES. [2024-06-27 18:54:22,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40500 conditions, 8425 events. 5399/8425 cut-off events. For 73812/73812 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 50897 event pairs, 1876 based on Foata normal form. 2/8186 useless extension candidates. Maximal degree in co-relation 40441. Up to 7568 conditions per place. [2024-06-27 18:54:22,076 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 204 selfloop transitions, 28 changer transitions 0/239 dead transitions. [2024-06-27 18:54:22,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 239 transitions, 2694 flow [2024-06-27 18:54:22,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:54:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:54:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-06-27 18:54:22,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48757763975155277 [2024-06-27 18:54:22,078 INFO L175 Difference]: Start difference. First operand has 127 places, 197 transitions, 2076 flow. Second operand 7 states and 157 transitions. [2024-06-27 18:54:22,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 239 transitions, 2694 flow [2024-06-27 18:54:22,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 239 transitions, 2626 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 18:54:22,148 INFO L231 Difference]: Finished difference. Result has 130 places, 200 transitions, 2108 flow [2024-06-27 18:54:22,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2108, PETRI_PLACES=130, PETRI_TRANSITIONS=200} [2024-06-27 18:54:22,149 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 78 predicate places. [2024-06-27 18:54:22,149 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 200 transitions, 2108 flow [2024-06-27 18:54:22,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:22,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:22,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:22,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 18:54:22,150 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:22,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:22,150 INFO L85 PathProgramCache]: Analyzing trace with hash 430498832, now seen corresponding path program 3 times [2024-06-27 18:54:22,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:22,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452629713] [2024-06-27 18:54:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:22,662 INFO L134 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:54:22,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:22,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452629713] [2024-06-27 18:54:22,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452629713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:22,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:22,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:54:22,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859363557] [2024-06-27 18:54:22,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:22,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:54:22,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:22,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:54:22,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:54:22,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:22,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 200 transitions, 2108 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:22,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:22,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:22,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:23,897 INFO L124 PetriNetUnfolderBase]: 5389/8353 cut-off events. [2024-06-27 18:54:23,897 INFO L125 PetriNetUnfolderBase]: For 79573/79576 co-relation queries the response was YES. [2024-06-27 18:54:23,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41075 conditions, 8353 events. 5389/8353 cut-off events. For 79573/79576 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 49988 event pairs, 1898 based on Foata normal form. 6/8137 useless extension candidates. Maximal degree in co-relation 41015. Up to 7567 conditions per place. [2024-06-27 18:54:23,961 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 210 selfloop transitions, 19 changer transitions 0/236 dead transitions. [2024-06-27 18:54:23,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 236 transitions, 2682 flow [2024-06-27 18:54:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:54:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:54:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2024-06-27 18:54:23,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2024-06-27 18:54:23,963 INFO L175 Difference]: Start difference. First operand has 130 places, 200 transitions, 2108 flow. Second operand 7 states and 154 transitions. [2024-06-27 18:54:23,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 236 transitions, 2682 flow [2024-06-27 18:54:24,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 236 transitions, 2618 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 18:54:24,039 INFO L231 Difference]: Finished difference. Result has 132 places, 201 transitions, 2100 flow [2024-06-27 18:54:24,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2044, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2100, PETRI_PLACES=132, PETRI_TRANSITIONS=201} [2024-06-27 18:54:24,040 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 80 predicate places. [2024-06-27 18:54:24,040 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 201 transitions, 2100 flow [2024-06-27 18:54:24,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:24,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:24,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:24,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 18:54:24,041 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:24,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1228172702, now seen corresponding path program 1 times [2024-06-27 18:54:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:24,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337705858] [2024-06-27 18:54:24,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:24,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:24,445 INFO L134 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:54:24,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:24,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337705858] [2024-06-27 18:54:24,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337705858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:24,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:24,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:54:24,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964524121] [2024-06-27 18:54:24,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:24,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:54:24,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:24,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:54:24,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:54:24,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:24,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 201 transitions, 2100 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:54:24,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:24,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:24,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:25,514 INFO L124 PetriNetUnfolderBase]: 5383/8368 cut-off events. [2024-06-27 18:54:25,515 INFO L125 PetriNetUnfolderBase]: For 82260/82260 co-relation queries the response was YES. [2024-06-27 18:54:25,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41173 conditions, 8368 events. 5383/8368 cut-off events. For 82260/82260 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 50251 event pairs, 1904 based on Foata normal form. 2/8141 useless extension candidates. Maximal degree in co-relation 41112. Up to 7640 conditions per place. [2024-06-27 18:54:25,588 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 200 selfloop transitions, 17 changer transitions 0/224 dead transitions. [2024-06-27 18:54:25,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 224 transitions, 2661 flow [2024-06-27 18:54:25,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:54:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:54:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-27 18:54:25,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652173913043478 [2024-06-27 18:54:25,590 INFO L175 Difference]: Start difference. First operand has 132 places, 201 transitions, 2100 flow. Second operand 5 states and 107 transitions. [2024-06-27 18:54:25,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 224 transitions, 2661 flow [2024-06-27 18:54:25,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 224 transitions, 2625 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 18:54:25,675 INFO L231 Difference]: Finished difference. Result has 133 places, 209 transitions, 2214 flow [2024-06-27 18:54:25,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2214, PETRI_PLACES=133, PETRI_TRANSITIONS=209} [2024-06-27 18:54:25,676 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 81 predicate places. [2024-06-27 18:54:25,676 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 209 transitions, 2214 flow [2024-06-27 18:54:25,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:54:25,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:25,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:25,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 18:54:25,676 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:25,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:25,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2112034134, now seen corresponding path program 1 times [2024-06-27 18:54:25,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:25,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34007616] [2024-06-27 18:54:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:25,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:26,366 INFO L134 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:54:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34007616] [2024-06-27 18:54:26,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34007616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:26,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:26,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:54:26,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702799251] [2024-06-27 18:54:26,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:26,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:54:26,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:26,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:54:26,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:54:26,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 18:54:26,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 209 transitions, 2214 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:26,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:26,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 18:54:26,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:27,542 INFO L124 PetriNetUnfolderBase]: 5266/8244 cut-off events. [2024-06-27 18:54:27,542 INFO L125 PetriNetUnfolderBase]: For 100849/101275 co-relation queries the response was YES. [2024-06-27 18:54:27,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42302 conditions, 8244 events. 5266/8244 cut-off events. For 100849/101275 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 50849 event pairs, 1144 based on Foata normal form. 98/7956 useless extension candidates. Maximal degree in co-relation 42239. Up to 6887 conditions per place. [2024-06-27 18:54:27,612 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 192 selfloop transitions, 67 changer transitions 0/285 dead transitions. [2024-06-27 18:54:27,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 285 transitions, 3196 flow [2024-06-27 18:54:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:54:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:54:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-06-27 18:54:27,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.529891304347826 [2024-06-27 18:54:27,614 INFO L175 Difference]: Start difference. First operand has 133 places, 209 transitions, 2214 flow. Second operand 8 states and 195 transitions. [2024-06-27 18:54:27,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 285 transitions, 3196 flow [2024-06-27 18:54:27,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 285 transitions, 3170 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-27 18:54:27,716 INFO L231 Difference]: Finished difference. Result has 142 places, 231 transitions, 2616 flow [2024-06-27 18:54:27,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2188, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2616, PETRI_PLACES=142, PETRI_TRANSITIONS=231} [2024-06-27 18:54:27,716 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 90 predicate places. [2024-06-27 18:54:27,716 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 231 transitions, 2616 flow [2024-06-27 18:54:27,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:27,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:27,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:27,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 18:54:27,717 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:27,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:27,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2112094584, now seen corresponding path program 2 times [2024-06-27 18:54:27,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:27,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473945672] [2024-06-27 18:54:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:27,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:28,441 INFO L134 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:54:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473945672] [2024-06-27 18:54:28,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473945672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:28,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:28,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:54:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109640904] [2024-06-27 18:54:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:28,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:54:28,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:28,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:54:28,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:54:28,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-06-27 18:54:28,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 231 transitions, 2616 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:28,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:28,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-06-27 18:54:28,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:29,785 INFO L124 PetriNetUnfolderBase]: 5257/8245 cut-off events. [2024-06-27 18:54:29,785 INFO L125 PetriNetUnfolderBase]: For 114239/114881 co-relation queries the response was YES. [2024-06-27 18:54:29,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44417 conditions, 8245 events. 5257/8245 cut-off events. For 114239/114881 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 51089 event pairs, 1413 based on Foata normal form. 195/8058 useless extension candidates. Maximal degree in co-relation 44349. Up to 7031 conditions per place. [2024-06-27 18:54:29,964 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 193 selfloop transitions, 73 changer transitions 0/292 dead transitions. [2024-06-27 18:54:29,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 292 transitions, 3376 flow [2024-06-27 18:54:29,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:54:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:54:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-06-27 18:54:29,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-06-27 18:54:29,967 INFO L175 Difference]: Start difference. First operand has 142 places, 231 transitions, 2616 flow. Second operand 9 states and 216 transitions. [2024-06-27 18:54:29,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 292 transitions, 3376 flow [2024-06-27 18:54:30,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 292 transitions, 3209 flow, removed 62 selfloop flow, removed 3 redundant places. [2024-06-27 18:54:30,100 INFO L231 Difference]: Finished difference. Result has 148 places, 233 transitions, 2647 flow [2024-06-27 18:54:30,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2473, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2647, PETRI_PLACES=148, PETRI_TRANSITIONS=233} [2024-06-27 18:54:30,101 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 96 predicate places. [2024-06-27 18:54:30,101 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 233 transitions, 2647 flow [2024-06-27 18:54:30,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:30,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:30,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:30,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 18:54:30,102 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:30,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:30,103 INFO L85 PathProgramCache]: Analyzing trace with hash 26315866, now seen corresponding path program 1 times [2024-06-27 18:54:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:30,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075409919] [2024-06-27 18:54:30,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:30,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:30,702 INFO L134 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:54:30,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:30,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075409919] [2024-06-27 18:54:30,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075409919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:30,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:30,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:54:30,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601321675] [2024-06-27 18:54:30,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:30,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:54:30,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:30,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:54:30,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:54:30,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:30,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 233 transitions, 2647 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:30,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:30,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:30,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:31,975 INFO L124 PetriNetUnfolderBase]: 5587/8637 cut-off events. [2024-06-27 18:54:31,975 INFO L125 PetriNetUnfolderBase]: For 104420/104423 co-relation queries the response was YES. [2024-06-27 18:54:32,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45257 conditions, 8637 events. 5587/8637 cut-off events. For 104420/104423 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 52182 event pairs, 1378 based on Foata normal form. 4/8419 useless extension candidates. Maximal degree in co-relation 45187. Up to 7293 conditions per place. [2024-06-27 18:54:32,053 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 282 selfloop transitions, 76 changer transitions 0/365 dead transitions. [2024-06-27 18:54:32,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 365 transitions, 4513 flow [2024-06-27 18:54:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:54:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:54:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-06-27 18:54:32,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5244565217391305 [2024-06-27 18:54:32,055 INFO L175 Difference]: Start difference. First operand has 148 places, 233 transitions, 2647 flow. Second operand 8 states and 193 transitions. [2024-06-27 18:54:32,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 365 transitions, 4513 flow [2024-06-27 18:54:32,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 365 transitions, 4326 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-27 18:54:32,190 INFO L231 Difference]: Finished difference. Result has 153 places, 297 transitions, 3444 flow [2024-06-27 18:54:32,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2480, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3444, PETRI_PLACES=153, PETRI_TRANSITIONS=297} [2024-06-27 18:54:32,191 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 101 predicate places. [2024-06-27 18:54:32,191 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 297 transitions, 3444 flow [2024-06-27 18:54:32,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:32,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:32,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:32,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 18:54:32,192 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:32,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2069248908, now seen corresponding path program 2 times [2024-06-27 18:54:32,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:32,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424010096] [2024-06-27 18:54:32,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:32,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:32,869 INFO L134 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:54:32,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:32,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424010096] [2024-06-27 18:54:32,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424010096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:32,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:32,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:54:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591850997] [2024-06-27 18:54:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:32,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:54:32,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:32,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:54:32,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:54:32,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:32,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 297 transitions, 3444 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:32,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:32,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:32,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:34,201 INFO L124 PetriNetUnfolderBase]: 5639/8732 cut-off events. [2024-06-27 18:54:34,202 INFO L125 PetriNetUnfolderBase]: For 114743/114746 co-relation queries the response was YES. [2024-06-27 18:54:34,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47964 conditions, 8732 events. 5639/8732 cut-off events. For 114743/114746 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 52990 event pairs, 1421 based on Foata normal form. 6/8508 useless extension candidates. Maximal degree in co-relation 47889. Up to 7527 conditions per place. [2024-06-27 18:54:34,287 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 277 selfloop transitions, 72 changer transitions 0/356 dead transitions. [2024-06-27 18:54:34,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 356 transitions, 4429 flow [2024-06-27 18:54:34,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:54:34,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:54:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-06-27 18:54:34,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-06-27 18:54:34,288 INFO L175 Difference]: Start difference. First operand has 153 places, 297 transitions, 3444 flow. Second operand 8 states and 188 transitions. [2024-06-27 18:54:34,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 356 transitions, 4429 flow [2024-06-27 18:54:34,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 356 transitions, 4375 flow, removed 26 selfloop flow, removed 1 redundant places. [2024-06-27 18:54:34,465 INFO L231 Difference]: Finished difference. Result has 160 places, 304 transitions, 3645 flow [2024-06-27 18:54:34,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3396, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3645, PETRI_PLACES=160, PETRI_TRANSITIONS=304} [2024-06-27 18:54:34,466 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 108 predicate places. [2024-06-27 18:54:34,466 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 304 transitions, 3645 flow [2024-06-27 18:54:34,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:34,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:34,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:34,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 18:54:34,467 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:34,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:34,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2114891218, now seen corresponding path program 3 times [2024-06-27 18:54:34,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:34,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621601774] [2024-06-27 18:54:34,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:34,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:35,132 INFO L134 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:54:35,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:35,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621601774] [2024-06-27 18:54:35,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621601774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:35,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:35,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:54:35,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732515953] [2024-06-27 18:54:35,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:35,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:54:35,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:35,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:54:35,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:54:35,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:35,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 304 transitions, 3645 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:35,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:35,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:35,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:36,762 INFO L124 PetriNetUnfolderBase]: 5696/8814 cut-off events. [2024-06-27 18:54:36,763 INFO L125 PetriNetUnfolderBase]: For 124980/124983 co-relation queries the response was YES. [2024-06-27 18:54:36,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49738 conditions, 8814 events. 5696/8814 cut-off events. For 124980/124983 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 53443 event pairs, 1421 based on Foata normal form. 6/8589 useless extension candidates. Maximal degree in co-relation 49660. Up to 7552 conditions per place. [2024-06-27 18:54:36,839 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 283 selfloop transitions, 86 changer transitions 0/376 dead transitions. [2024-06-27 18:54:36,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 376 transitions, 4753 flow [2024-06-27 18:54:36,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:54:36,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:54:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2024-06-27 18:54:36,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2024-06-27 18:54:36,841 INFO L175 Difference]: Start difference. First operand has 160 places, 304 transitions, 3645 flow. Second operand 9 states and 210 transitions. [2024-06-27 18:54:36,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 376 transitions, 4753 flow [2024-06-27 18:54:36,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 376 transitions, 4584 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-27 18:54:36,996 INFO L231 Difference]: Finished difference. Result has 165 places, 316 transitions, 3842 flow [2024-06-27 18:54:36,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3476, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3842, PETRI_PLACES=165, PETRI_TRANSITIONS=316} [2024-06-27 18:54:36,997 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 113 predicate places. [2024-06-27 18:54:36,997 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 316 transitions, 3842 flow [2024-06-27 18:54:36,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:36,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:36,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:54:36,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 18:54:36,999 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:36,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash 144403546, now seen corresponding path program 4 times [2024-06-27 18:54:36,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:36,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716694628] [2024-06-27 18:54:36,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:54:37,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:37,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716694628] [2024-06-27 18:54:37,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716694628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:37,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:37,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:54:37,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099223543] [2024-06-27 18:54:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:37,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:54:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:37,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:54:37,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:54:37,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:37,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 316 transitions, 3842 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:37,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:37,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:37,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:39,295 INFO L124 PetriNetUnfolderBase]: 5750/8874 cut-off events. [2024-06-27 18:54:39,295 INFO L125 PetriNetUnfolderBase]: For 134769/134772 co-relation queries the response was YES. [2024-06-27 18:54:39,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51361 conditions, 8874 events. 5750/8874 cut-off events. For 134769/134772 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 53604 event pairs, 1395 based on Foata normal form. 4/8652 useless extension candidates. Maximal degree in co-relation 51281. Up to 7583 conditions per place. [2024-06-27 18:54:39,397 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 308 selfloop transitions, 83 changer transitions 0/398 dead transitions. [2024-06-27 18:54:39,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 398 transitions, 5338 flow [2024-06-27 18:54:39,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:54:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:54:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-27 18:54:39,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5407608695652174 [2024-06-27 18:54:39,399 INFO L175 Difference]: Start difference. First operand has 165 places, 316 transitions, 3842 flow. Second operand 8 states and 199 transitions. [2024-06-27 18:54:39,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 398 transitions, 5338 flow [2024-06-27 18:54:39,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 398 transitions, 5196 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-27 18:54:39,670 INFO L231 Difference]: Finished difference. Result has 171 places, 338 transitions, 4277 flow [2024-06-27 18:54:39,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3702, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4277, PETRI_PLACES=171, PETRI_TRANSITIONS=338} [2024-06-27 18:54:39,671 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 119 predicate places. [2024-06-27 18:54:39,671 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 338 transitions, 4277 flow [2024-06-27 18:54:39,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:39,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:39,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:39,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 18:54:39,672 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:39,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2064780258, now seen corresponding path program 5 times [2024-06-27 18:54:39,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915202603] [2024-06-27 18:54:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:40,372 INFO L134 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:54:40,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:40,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915202603] [2024-06-27 18:54:40,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915202603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:40,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:40,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:54:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597370669] [2024-06-27 18:54:40,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:40,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:54:40,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:40,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:54:40,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:54:40,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:40,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 338 transitions, 4277 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:40,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:40,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:40,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:41,920 INFO L124 PetriNetUnfolderBase]: 5802/8963 cut-off events. [2024-06-27 18:54:41,920 INFO L125 PetriNetUnfolderBase]: For 143088/143091 co-relation queries the response was YES. [2024-06-27 18:54:41,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53421 conditions, 8963 events. 5802/8963 cut-off events. For 143088/143091 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 54356 event pairs, 1404 based on Foata normal form. 6/8737 useless extension candidates. Maximal degree in co-relation 53336. Up to 7752 conditions per place. [2024-06-27 18:54:42,021 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 316 selfloop transitions, 79 changer transitions 0/402 dead transitions. [2024-06-27 18:54:42,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 402 transitions, 5431 flow [2024-06-27 18:54:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:54:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:54:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-27 18:54:42,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-06-27 18:54:42,022 INFO L175 Difference]: Start difference. First operand has 171 places, 338 transitions, 4277 flow. Second operand 8 states and 192 transitions. [2024-06-27 18:54:42,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 402 transitions, 5431 flow [2024-06-27 18:54:42,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 402 transitions, 5315 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-27 18:54:42,348 INFO L231 Difference]: Finished difference. Result has 176 places, 345 transitions, 4470 flow [2024-06-27 18:54:42,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4169, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4470, PETRI_PLACES=176, PETRI_TRANSITIONS=345} [2024-06-27 18:54:42,349 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 124 predicate places. [2024-06-27 18:54:42,353 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 345 transitions, 4470 flow [2024-06-27 18:54:42,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:42,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:42,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:42,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 18:54:42,354 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:42,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2064607278, now seen corresponding path program 6 times [2024-06-27 18:54:42,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:42,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602162372] [2024-06-27 18:54:42,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:42,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:43,156 INFO L134 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:54:43,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:43,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602162372] [2024-06-27 18:54:43,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602162372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:43,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:43,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:54:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546413969] [2024-06-27 18:54:43,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:43,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:54:43,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:43,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:54:43,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:54:43,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:43,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 345 transitions, 4470 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:43,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:43,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:43,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:44,685 INFO L124 PetriNetUnfolderBase]: 5854/9041 cut-off events. [2024-06-27 18:54:44,686 INFO L125 PetriNetUnfolderBase]: For 154243/154246 co-relation queries the response was YES. [2024-06-27 18:54:44,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55362 conditions, 9041 events. 5854/9041 cut-off events. For 154243/154246 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 54807 event pairs, 1408 based on Foata normal form. 6/8813 useless extension candidates. Maximal degree in co-relation 55275. Up to 7824 conditions per place. [2024-06-27 18:54:44,782 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 328 selfloop transitions, 73 changer transitions 0/408 dead transitions. [2024-06-27 18:54:44,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 408 transitions, 5664 flow [2024-06-27 18:54:44,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:54:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:54:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-06-27 18:54:44,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-06-27 18:54:44,784 INFO L175 Difference]: Start difference. First operand has 176 places, 345 transitions, 4470 flow. Second operand 8 states and 188 transitions. [2024-06-27 18:54:44,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 408 transitions, 5664 flow [2024-06-27 18:54:45,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 408 transitions, 5443 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-27 18:54:45,100 INFO L231 Difference]: Finished difference. Result has 178 places, 352 transitions, 4552 flow [2024-06-27 18:54:45,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4249, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4552, PETRI_PLACES=178, PETRI_TRANSITIONS=352} [2024-06-27 18:54:45,101 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 126 predicate places. [2024-06-27 18:54:45,101 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 352 transitions, 4552 flow [2024-06-27 18:54:45,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:45,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:45,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:45,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 18:54:45,102 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:45,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:45,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2064600334, now seen corresponding path program 1 times [2024-06-27 18:54:45,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:45,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403217529] [2024-06-27 18:54:45,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:45,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:45,896 INFO L134 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:54:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:45,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403217529] [2024-06-27 18:54:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403217529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:54:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101399458] [2024-06-27 18:54:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:45,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:54:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:54:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:54:45,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:45,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 352 transitions, 4552 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:45,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:45,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:45,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:47,605 INFO L124 PetriNetUnfolderBase]: 5938/9183 cut-off events. [2024-06-27 18:54:47,605 INFO L125 PetriNetUnfolderBase]: For 168244/168247 co-relation queries the response was YES. [2024-06-27 18:54:47,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56972 conditions, 9183 events. 5938/9183 cut-off events. For 168244/168247 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 55928 event pairs, 1394 based on Foata normal form. 10/8953 useless extension candidates. Maximal degree in co-relation 56884. Up to 7918 conditions per place. [2024-06-27 18:54:47,706 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 333 selfloop transitions, 69 changer transitions 0/409 dead transitions. [2024-06-27 18:54:47,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 409 transitions, 5640 flow [2024-06-27 18:54:47,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:54:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:54:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-06-27 18:54:47,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-06-27 18:54:47,708 INFO L175 Difference]: Start difference. First operand has 178 places, 352 transitions, 4552 flow. Second operand 8 states and 188 transitions. [2024-06-27 18:54:47,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 409 transitions, 5640 flow [2024-06-27 18:54:48,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 409 transitions, 5417 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-27 18:54:48,027 INFO L231 Difference]: Finished difference. Result has 180 places, 355 transitions, 4528 flow [2024-06-27 18:54:48,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4329, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4528, PETRI_PLACES=180, PETRI_TRANSITIONS=355} [2024-06-27 18:54:48,028 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 128 predicate places. [2024-06-27 18:54:48,028 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 355 transitions, 4528 flow [2024-06-27 18:54:48,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:48,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:48,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:48,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 18:54:48,029 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:48,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:48,030 INFO L85 PathProgramCache]: Analyzing trace with hash -729116954, now seen corresponding path program 7 times [2024-06-27 18:54:48,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:48,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337221449] [2024-06-27 18:54:48,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:48,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:54:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:48,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337221449] [2024-06-27 18:54:48,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337221449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:48,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:48,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:54:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651720834] [2024-06-27 18:54:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:48,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:54:48,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:48,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:54:48,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:54:48,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:48,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 355 transitions, 4528 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:48,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:48,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:48,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:50,405 INFO L124 PetriNetUnfolderBase]: 5967/9188 cut-off events. [2024-06-27 18:54:50,406 INFO L125 PetriNetUnfolderBase]: For 176994/176997 co-relation queries the response was YES. [2024-06-27 18:54:50,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58005 conditions, 9188 events. 5967/9188 cut-off events. For 176994/176997 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 55328 event pairs, 1767 based on Foata normal form. 6/8966 useless extension candidates. Maximal degree in co-relation 57916. Up to 8338 conditions per place. [2024-06-27 18:54:50,503 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 367 selfloop transitions, 32 changer transitions 0/406 dead transitions. [2024-06-27 18:54:50,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 406 transitions, 5622 flow [2024-06-27 18:54:50,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:54:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:54:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-27 18:54:50,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48097826086956524 [2024-06-27 18:54:50,505 INFO L175 Difference]: Start difference. First operand has 180 places, 355 transitions, 4528 flow. Second operand 8 states and 177 transitions. [2024-06-27 18:54:50,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 406 transitions, 5622 flow [2024-06-27 18:54:50,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 406 transitions, 5453 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-27 18:54:50,825 INFO L231 Difference]: Finished difference. Result has 182 places, 362 transitions, 4596 flow [2024-06-27 18:54:50,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4359, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4596, PETRI_PLACES=182, PETRI_TRANSITIONS=362} [2024-06-27 18:54:50,826 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 130 predicate places. [2024-06-27 18:54:50,826 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 362 transitions, 4596 flow [2024-06-27 18:54:50,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:50,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:50,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:50,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 18:54:50,827 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:50,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:50,827 INFO L85 PathProgramCache]: Analyzing trace with hash 276230284, now seen corresponding path program 2 times [2024-06-27 18:54:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:50,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862892349] [2024-06-27 18:54:50,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:50,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:54:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:51,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862892349] [2024-06-27 18:54:51,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862892349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:51,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:51,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:54:51,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283411529] [2024-06-27 18:54:51,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:51,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:54:51,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:51,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:54:51,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:54:51,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:51,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 362 transitions, 4596 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:51,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:51,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:51,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:53,236 INFO L124 PetriNetUnfolderBase]: 6009/9254 cut-off events. [2024-06-27 18:54:53,237 INFO L125 PetriNetUnfolderBase]: For 188405/188405 co-relation queries the response was YES. [2024-06-27 18:54:53,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58800 conditions, 9254 events. 6009/9254 cut-off events. For 188405/188405 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 55661 event pairs, 1793 based on Foata normal form. 4/9029 useless extension candidates. Maximal degree in co-relation 58710. Up to 8456 conditions per place. [2024-06-27 18:54:53,350 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 376 selfloop transitions, 22 changer transitions 0/405 dead transitions. [2024-06-27 18:54:53,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 405 transitions, 5565 flow [2024-06-27 18:54:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:54:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:54:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-06-27 18:54:53,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2024-06-27 18:54:53,352 INFO L175 Difference]: Start difference. First operand has 182 places, 362 transitions, 4596 flow. Second operand 8 states and 172 transitions. [2024-06-27 18:54:53,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 405 transitions, 5565 flow [2024-06-27 18:54:53,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 405 transitions, 5408 flow, removed 51 selfloop flow, removed 6 redundant places. [2024-06-27 18:54:53,779 INFO L231 Difference]: Finished difference. Result has 184 places, 364 transitions, 4537 flow [2024-06-27 18:54:53,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4439, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4537, PETRI_PLACES=184, PETRI_TRANSITIONS=364} [2024-06-27 18:54:53,781 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 132 predicate places. [2024-06-27 18:54:53,781 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 364 transitions, 4537 flow [2024-06-27 18:54:53,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:53,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:53,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:53,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 18:54:53,782 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:53,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1660620050, now seen corresponding path program 3 times [2024-06-27 18:54:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:53,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76330773] [2024-06-27 18:54:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:54,448 INFO L134 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:54:54,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76330773] [2024-06-27 18:54:54,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76330773] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:54,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:54,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:54:54,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372321053] [2024-06-27 18:54:54,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:54,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:54:54,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:54,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:54:54,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:54:54,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:54,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 364 transitions, 4537 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:54,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:54,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:54,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:56,131 INFO L124 PetriNetUnfolderBase]: 6064/9407 cut-off events. [2024-06-27 18:54:56,132 INFO L125 PetriNetUnfolderBase]: For 199025/199025 co-relation queries the response was YES. [2024-06-27 18:54:56,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59762 conditions, 9407 events. 6064/9407 cut-off events. For 199025/199025 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 57313 event pairs, 1740 based on Foata normal form. 4/9158 useless extension candidates. Maximal degree in co-relation 59671. Up to 8494 conditions per place. [2024-06-27 18:54:56,257 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 373 selfloop transitions, 34 changer transitions 0/414 dead transitions. [2024-06-27 18:54:56,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 414 transitions, 5551 flow [2024-06-27 18:54:56,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:54:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:54:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-27 18:54:56,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483695652173913 [2024-06-27 18:54:56,259 INFO L175 Difference]: Start difference. First operand has 184 places, 364 transitions, 4537 flow. Second operand 8 states and 178 transitions. [2024-06-27 18:54:56,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 414 transitions, 5551 flow [2024-06-27 18:54:56,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 414 transitions, 5475 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-27 18:54:56,709 INFO L231 Difference]: Finished difference. Result has 187 places, 370 transitions, 4630 flow [2024-06-27 18:54:56,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4461, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4630, PETRI_PLACES=187, PETRI_TRANSITIONS=370} [2024-06-27 18:54:56,710 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 135 predicate places. [2024-06-27 18:54:56,710 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 370 transitions, 4630 flow [2024-06-27 18:54:56,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:56,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:56,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:56,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 18:54:56,710 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:56,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash 204963764, now seen corresponding path program 4 times [2024-06-27 18:54:56,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:56,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209818197] [2024-06-27 18:54:56,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:56,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:54:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:54:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:54:57,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209818197] [2024-06-27 18:54:57,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209818197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:54:57,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:54:57,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:54:57,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616956147] [2024-06-27 18:54:57,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:54:57,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:54:57,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:54:57,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:54:57,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:54:57,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:54:57,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 370 transitions, 4630 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:57,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:54:57,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:54:57,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:54:59,177 INFO L124 PetriNetUnfolderBase]: 6106/9409 cut-off events. [2024-06-27 18:54:59,178 INFO L125 PetriNetUnfolderBase]: For 212604/212604 co-relation queries the response was YES. [2024-06-27 18:54:59,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61187 conditions, 9409 events. 6106/9409 cut-off events. For 212604/212604 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 56870 event pairs, 1790 based on Foata normal form. 4/9180 useless extension candidates. Maximal degree in co-relation 61094. Up to 8545 conditions per place. [2024-06-27 18:54:59,277 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 378 selfloop transitions, 33 changer transitions 0/418 dead transitions. [2024-06-27 18:54:59,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 418 transitions, 5685 flow [2024-06-27 18:54:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:54:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:54:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-27 18:54:59,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48097826086956524 [2024-06-27 18:54:59,278 INFO L175 Difference]: Start difference. First operand has 187 places, 370 transitions, 4630 flow. Second operand 8 states and 177 transitions. [2024-06-27 18:54:59,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 418 transitions, 5685 flow [2024-06-27 18:54:59,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 418 transitions, 5568 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-27 18:54:59,655 INFO L231 Difference]: Finished difference. Result has 190 places, 372 transitions, 4641 flow [2024-06-27 18:54:59,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4513, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4641, PETRI_PLACES=190, PETRI_TRANSITIONS=372} [2024-06-27 18:54:59,656 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 138 predicate places. [2024-06-27 18:54:59,656 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 372 transitions, 4641 flow [2024-06-27 18:54:59,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:54:59,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:54:59,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:54:59,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 18:54:59,656 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:54:59,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:54:59,657 INFO L85 PathProgramCache]: Analyzing trace with hash 469738236, now seen corresponding path program 1 times [2024-06-27 18:54:59,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:54:59,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205187419] [2024-06-27 18:54:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:54:59,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:54:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:00,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:00,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205187419] [2024-06-27 18:55:00,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205187419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:00,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:00,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:55:00,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867281430] [2024-06-27 18:55:00,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:00,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:55:00,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:00,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:55:00,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:55:00,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:00,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 372 transitions, 4641 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:00,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:00,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:00,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:01,920 INFO L124 PetriNetUnfolderBase]: 6117/9486 cut-off events. [2024-06-27 18:55:01,921 INFO L125 PetriNetUnfolderBase]: For 221337/221340 co-relation queries the response was YES. [2024-06-27 18:55:01,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61700 conditions, 9486 events. 6117/9486 cut-off events. For 221337/221340 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 57841 event pairs, 1778 based on Foata normal form. 4/9236 useless extension candidates. Maximal degree in co-relation 61606. Up to 8516 conditions per place. [2024-06-27 18:55:02,028 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 361 selfloop transitions, 49 changer transitions 0/417 dead transitions. [2024-06-27 18:55:02,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 417 transitions, 5708 flow [2024-06-27 18:55:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:55:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:55:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-06-27 18:55:02,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4937888198757764 [2024-06-27 18:55:02,030 INFO L175 Difference]: Start difference. First operand has 190 places, 372 transitions, 4641 flow. Second operand 7 states and 159 transitions. [2024-06-27 18:55:02,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 417 transitions, 5708 flow [2024-06-27 18:55:02,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 417 transitions, 5580 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-27 18:55:02,487 INFO L231 Difference]: Finished difference. Result has 191 places, 378 transitions, 4746 flow [2024-06-27 18:55:02,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4521, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4746, PETRI_PLACES=191, PETRI_TRANSITIONS=378} [2024-06-27 18:55:02,487 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 139 predicate places. [2024-06-27 18:55:02,487 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 378 transitions, 4746 flow [2024-06-27 18:55:02,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:02,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:02,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:02,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 18:55:02,489 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:02,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:02,489 INFO L85 PathProgramCache]: Analyzing trace with hash 285398224, now seen corresponding path program 5 times [2024-06-27 18:55:02,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:02,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753897970] [2024-06-27 18:55:02,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:02,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:03,350 INFO L134 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:55:03,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:03,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753897970] [2024-06-27 18:55:03,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753897970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:03,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:03,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:03,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460658776] [2024-06-27 18:55:03,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:03,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:03,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:03,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:03,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:03,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:03,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 378 transitions, 4746 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:03,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:03,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:03,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:05,146 INFO L124 PetriNetUnfolderBase]: 6122/9509 cut-off events. [2024-06-27 18:55:05,146 INFO L125 PetriNetUnfolderBase]: For 231672/231672 co-relation queries the response was YES. [2024-06-27 18:55:05,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62330 conditions, 9509 events. 6122/9509 cut-off events. For 231672/231672 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 58154 event pairs, 1790 based on Foata normal form. 4/9254 useless extension candidates. Maximal degree in co-relation 62235. Up to 8522 conditions per place. [2024-06-27 18:55:05,260 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 375 selfloop transitions, 44 changer transitions 0/426 dead transitions. [2024-06-27 18:55:05,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 426 transitions, 5797 flow [2024-06-27 18:55:05,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:55:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:55:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2024-06-27 18:55:05,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48641304347826086 [2024-06-27 18:55:05,261 INFO L175 Difference]: Start difference. First operand has 191 places, 378 transitions, 4746 flow. Second operand 8 states and 179 transitions. [2024-06-27 18:55:05,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 426 transitions, 5797 flow [2024-06-27 18:55:05,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 426 transitions, 5673 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-27 18:55:05,712 INFO L231 Difference]: Finished difference. Result has 194 places, 380 transitions, 4782 flow [2024-06-27 18:55:05,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4622, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4782, PETRI_PLACES=194, PETRI_TRANSITIONS=380} [2024-06-27 18:55:05,713 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 142 predicate places. [2024-06-27 18:55:05,713 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 380 transitions, 4782 flow [2024-06-27 18:55:05,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:05,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:05,714 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:55:05,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 18:55:05,714 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:05,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:05,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1048550565, now seen corresponding path program 1 times [2024-06-27 18:55:05,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:05,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748788855] [2024-06-27 18:55:05,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:05,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:06,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:06,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748788855] [2024-06-27 18:55:06,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748788855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:06,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:06,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:06,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721977621] [2024-06-27 18:55:06,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:06,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:06,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:06,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:06,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:06,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:06,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 380 transitions, 4782 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:06,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:06,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:06,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:08,204 INFO L124 PetriNetUnfolderBase]: 6563/10127 cut-off events. [2024-06-27 18:55:08,204 INFO L125 PetriNetUnfolderBase]: For 279720/279723 co-relation queries the response was YES. [2024-06-27 18:55:08,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68551 conditions, 10127 events. 6563/10127 cut-off events. For 279720/279723 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 62038 event pairs, 936 based on Foata normal form. 18/9903 useless extension candidates. Maximal degree in co-relation 68455. Up to 7396 conditions per place. [2024-06-27 18:55:08,323 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 358 selfloop transitions, 129 changer transitions 0/494 dead transitions. [2024-06-27 18:55:08,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 494 transitions, 6687 flow [2024-06-27 18:55:08,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:55:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:55:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-27 18:55:08,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538647342995169 [2024-06-27 18:55:08,325 INFO L175 Difference]: Start difference. First operand has 194 places, 380 transitions, 4782 flow. Second operand 9 states and 223 transitions. [2024-06-27 18:55:08,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 494 transitions, 6687 flow [2024-06-27 18:55:08,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 494 transitions, 6539 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-27 18:55:08,950 INFO L231 Difference]: Finished difference. Result has 200 places, 409 transitions, 5452 flow [2024-06-27 18:55:08,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4648, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5452, PETRI_PLACES=200, PETRI_TRANSITIONS=409} [2024-06-27 18:55:08,951 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 148 predicate places. [2024-06-27 18:55:08,951 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 409 transitions, 5452 flow [2024-06-27 18:55:08,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:08,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:08,951 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:55:08,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 18:55:08,952 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:08,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash 815789853, now seen corresponding path program 2 times [2024-06-27 18:55:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:08,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913757980] [2024-06-27 18:55:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:08,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:09,701 INFO L134 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:55:09,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913757980] [2024-06-27 18:55:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913757980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:09,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:09,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546377222] [2024-06-27 18:55:09,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:09,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:09,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:09,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:09,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:09,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 409 transitions, 5452 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:09,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:09,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:09,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:11,879 INFO L124 PetriNetUnfolderBase]: 6947/10766 cut-off events. [2024-06-27 18:55:11,880 INFO L125 PetriNetUnfolderBase]: For 312787/312790 co-relation queries the response was YES. [2024-06-27 18:55:11,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75635 conditions, 10766 events. 6947/10766 cut-off events. For 312787/312790 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 67179 event pairs, 1472 based on Foata normal form. 18/10525 useless extension candidates. Maximal degree in co-relation 75535. Up to 8482 conditions per place. [2024-06-27 18:55:12,002 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 363 selfloop transitions, 136 changer transitions 0/506 dead transitions. [2024-06-27 18:55:12,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 506 transitions, 7214 flow [2024-06-27 18:55:12,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:55:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:55:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2024-06-27 18:55:12,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5413043478260869 [2024-06-27 18:55:12,004 INFO L175 Difference]: Start difference. First operand has 200 places, 409 transitions, 5452 flow. Second operand 10 states and 249 transitions. [2024-06-27 18:55:12,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 506 transitions, 7214 flow [2024-06-27 18:55:12,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 506 transitions, 7034 flow, removed 60 selfloop flow, removed 3 redundant places. [2024-06-27 18:55:12,945 INFO L231 Difference]: Finished difference. Result has 209 places, 419 transitions, 5836 flow [2024-06-27 18:55:12,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5306, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5836, PETRI_PLACES=209, PETRI_TRANSITIONS=419} [2024-06-27 18:55:12,945 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 157 predicate places. [2024-06-27 18:55:12,946 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 419 transitions, 5836 flow [2024-06-27 18:55:12,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:12,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:12,946 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:55:12,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 18:55:12,946 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:12,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:12,947 INFO L85 PathProgramCache]: Analyzing trace with hash 815793573, now seen corresponding path program 3 times [2024-06-27 18:55:12,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:12,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768670107] [2024-06-27 18:55:12,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:12,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:13,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:13,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768670107] [2024-06-27 18:55:13,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768670107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:13,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:13,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:13,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144360261] [2024-06-27 18:55:13,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:13,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:13,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:13,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:13,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:13,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:13,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 419 transitions, 5836 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:13,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:13,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:13,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:15,929 INFO L124 PetriNetUnfolderBase]: 6911/10740 cut-off events. [2024-06-27 18:55:15,929 INFO L125 PetriNetUnfolderBase]: For 303573/303576 co-relation queries the response was YES. [2024-06-27 18:55:16,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75146 conditions, 10740 events. 6911/10740 cut-off events. For 303573/303576 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 67305 event pairs, 1508 based on Foata normal form. 22/10493 useless extension candidates. Maximal degree in co-relation 75042. Up to 8702 conditions per place. [2024-06-27 18:55:16,057 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 364 selfloop transitions, 139 changer transitions 0/510 dead transitions. [2024-06-27 18:55:16,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 510 transitions, 7300 flow [2024-06-27 18:55:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:55:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:55:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 265 transitions. [2024-06-27 18:55:16,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5237154150197628 [2024-06-27 18:55:16,059 INFO L175 Difference]: Start difference. First operand has 209 places, 419 transitions, 5836 flow. Second operand 11 states and 265 transitions. [2024-06-27 18:55:16,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 510 transitions, 7300 flow [2024-06-27 18:55:16,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 510 transitions, 7073 flow, removed 38 selfloop flow, removed 5 redundant places. [2024-06-27 18:55:16,922 INFO L231 Difference]: Finished difference. Result has 216 places, 422 transitions, 5993 flow [2024-06-27 18:55:16,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5624, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5993, PETRI_PLACES=216, PETRI_TRANSITIONS=422} [2024-06-27 18:55:16,923 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 164 predicate places. [2024-06-27 18:55:16,923 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 422 transitions, 5993 flow [2024-06-27 18:55:16,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:16,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:16,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:55:16,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 18:55:16,924 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:16,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:16,924 INFO L85 PathProgramCache]: Analyzing trace with hash 181540637, now seen corresponding path program 4 times [2024-06-27 18:55:16,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:16,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832613876] [2024-06-27 18:55:16,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:16,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:17,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832613876] [2024-06-27 18:55:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832613876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:17,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:17,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:17,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022450082] [2024-06-27 18:55:17,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:17,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:17,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:17,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:17,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:17,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:17,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 422 transitions, 5993 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:17,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:17,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:17,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:19,951 INFO L124 PetriNetUnfolderBase]: 7271/11204 cut-off events. [2024-06-27 18:55:19,952 INFO L125 PetriNetUnfolderBase]: For 328428/328431 co-relation queries the response was YES. [2024-06-27 18:55:20,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80594 conditions, 11204 events. 7271/11204 cut-off events. For 328428/328431 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 69637 event pairs, 1346 based on Foata normal form. 16/10982 useless extension candidates. Maximal degree in co-relation 80487. Up to 9074 conditions per place. [2024-06-27 18:55:20,072 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 387 selfloop transitions, 115 changer transitions 0/509 dead transitions. [2024-06-27 18:55:20,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 509 transitions, 7876 flow [2024-06-27 18:55:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:55:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:55:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2024-06-27 18:55:20,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458937198067633 [2024-06-27 18:55:20,074 INFO L175 Difference]: Start difference. First operand has 216 places, 422 transitions, 5993 flow. Second operand 9 states and 226 transitions. [2024-06-27 18:55:20,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 509 transitions, 7876 flow [2024-06-27 18:55:20,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 509 transitions, 7616 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 18:55:20,828 INFO L231 Difference]: Finished difference. Result has 218 places, 434 transitions, 6252 flow [2024-06-27 18:55:20,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5733, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6252, PETRI_PLACES=218, PETRI_TRANSITIONS=434} [2024-06-27 18:55:20,829 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 166 predicate places. [2024-06-27 18:55:20,829 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 434 transitions, 6252 flow [2024-06-27 18:55:20,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:20,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:20,830 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:55:20,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 18:55:20,830 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:20,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash -139842655, now seen corresponding path program 5 times [2024-06-27 18:55:20,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:20,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327132714] [2024-06-27 18:55:20,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:21,461 INFO L134 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:55:21,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:21,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327132714] [2024-06-27 18:55:21,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327132714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:21,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:21,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:21,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93503606] [2024-06-27 18:55:21,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:21,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:21,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:21,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:21,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:21,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 434 transitions, 6252 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:21,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:21,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:21,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:24,065 INFO L124 PetriNetUnfolderBase]: 7448/11468 cut-off events. [2024-06-27 18:55:24,065 INFO L125 PetriNetUnfolderBase]: For 355491/355494 co-relation queries the response was YES. [2024-06-27 18:55:24,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84033 conditions, 11468 events. 7448/11468 cut-off events. For 355491/355494 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 71657 event pairs, 1682 based on Foata normal form. 20/11251 useless extension candidates. Maximal degree in co-relation 83924. Up to 9882 conditions per place. [2024-06-27 18:55:24,193 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 394 selfloop transitions, 107 changer transitions 0/508 dead transitions. [2024-06-27 18:55:24,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 508 transitions, 7832 flow [2024-06-27 18:55:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:55:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:55:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2024-06-27 18:55:24,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.533816425120773 [2024-06-27 18:55:24,200 INFO L175 Difference]: Start difference. First operand has 218 places, 434 transitions, 6252 flow. Second operand 9 states and 221 transitions. [2024-06-27 18:55:24,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 508 transitions, 7832 flow [2024-06-27 18:55:25,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 508 transitions, 7683 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-27 18:55:25,101 INFO L231 Difference]: Finished difference. Result has 223 places, 438 transitions, 6451 flow [2024-06-27 18:55:25,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6111, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6451, PETRI_PLACES=223, PETRI_TRANSITIONS=438} [2024-06-27 18:55:25,103 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 171 predicate places. [2024-06-27 18:55:25,103 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 438 transitions, 6451 flow [2024-06-27 18:55:25,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:25,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:25,103 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:55:25,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 18:55:25,104 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:25,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash -139698505, now seen corresponding path program 6 times [2024-06-27 18:55:25,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:25,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929037763] [2024-06-27 18:55:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:25,801 INFO L134 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:55:25,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:25,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929037763] [2024-06-27 18:55:25,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929037763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:25,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:25,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:25,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696026627] [2024-06-27 18:55:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:25,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:25,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:25,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:25,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:25,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:25,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 438 transitions, 6451 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:25,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:25,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:25,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:28,330 INFO L124 PetriNetUnfolderBase]: 7637/11754 cut-off events. [2024-06-27 18:55:28,330 INFO L125 PetriNetUnfolderBase]: For 371246/371249 co-relation queries the response was YES. [2024-06-27 18:55:28,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87003 conditions, 11754 events. 7637/11754 cut-off events. For 371246/371249 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 73663 event pairs, 1721 based on Foata normal form. 20/11536 useless extension candidates. Maximal degree in co-relation 86892. Up to 10328 conditions per place. [2024-06-27 18:55:28,465 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 420 selfloop transitions, 88 changer transitions 0/515 dead transitions. [2024-06-27 18:55:28,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 515 transitions, 8056 flow [2024-06-27 18:55:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:55:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:55:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2024-06-27 18:55:28,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5169082125603864 [2024-06-27 18:55:28,467 INFO L175 Difference]: Start difference. First operand has 223 places, 438 transitions, 6451 flow. Second operand 9 states and 214 transitions. [2024-06-27 18:55:28,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 515 transitions, 8056 flow [2024-06-27 18:55:29,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 515 transitions, 7806 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-27 18:55:29,446 INFO L231 Difference]: Finished difference. Result has 227 places, 451 transitions, 6749 flow [2024-06-27 18:55:29,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6217, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6749, PETRI_PLACES=227, PETRI_TRANSITIONS=451} [2024-06-27 18:55:29,446 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 175 predicate places. [2024-06-27 18:55:29,446 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 451 transitions, 6749 flow [2024-06-27 18:55:29,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:29,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:29,447 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:55:29,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 18:55:29,447 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:29,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:29,447 INFO L85 PathProgramCache]: Analyzing trace with hash 416329121, now seen corresponding path program 1 times [2024-06-27 18:55:29,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:29,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465662492] [2024-06-27 18:55:29,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:29,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:30,191 INFO L134 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:55:30,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:30,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465662492] [2024-06-27 18:55:30,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465662492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:30,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:30,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:30,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107267322] [2024-06-27 18:55:30,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:30,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:30,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:30,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:30,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:30,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:30,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 451 transitions, 6749 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:30,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:30,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:30,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:32,579 INFO L124 PetriNetUnfolderBase]: 7687/11932 cut-off events. [2024-06-27 18:55:32,580 INFO L125 PetriNetUnfolderBase]: For 373233/373236 co-relation queries the response was YES. [2024-06-27 18:55:32,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87957 conditions, 11932 events. 7687/11932 cut-off events. For 373233/373236 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 75981 event pairs, 1730 based on Foata normal form. 6/11665 useless extension candidates. Maximal degree in co-relation 87843. Up to 10602 conditions per place. [2024-06-27 18:55:32,962 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 430 selfloop transitions, 75 changer transitions 0/512 dead transitions. [2024-06-27 18:55:32,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 512 transitions, 8134 flow [2024-06-27 18:55:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:55:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:55:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-27 18:55:32,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190217391304348 [2024-06-27 18:55:32,964 INFO L175 Difference]: Start difference. First operand has 227 places, 451 transitions, 6749 flow. Second operand 8 states and 191 transitions. [2024-06-27 18:55:32,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 512 transitions, 8134 flow [2024-06-27 18:55:33,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 512 transitions, 7838 flow, removed 65 selfloop flow, removed 5 redundant places. [2024-06-27 18:55:33,971 INFO L231 Difference]: Finished difference. Result has 230 places, 454 transitions, 6727 flow [2024-06-27 18:55:33,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6477, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6727, PETRI_PLACES=230, PETRI_TRANSITIONS=454} [2024-06-27 18:55:33,972 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 178 predicate places. [2024-06-27 18:55:33,972 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 454 transitions, 6727 flow [2024-06-27 18:55:33,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:33,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:33,972 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:55:33,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 18:55:33,973 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:33,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:33,973 INFO L85 PathProgramCache]: Analyzing trace with hash 421893311, now seen corresponding path program 2 times [2024-06-27 18:55:33,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:33,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432963147] [2024-06-27 18:55:33,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:33,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:34,702 INFO L134 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:55:34,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:34,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432963147] [2024-06-27 18:55:34,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432963147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:34,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:34,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:34,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848765520] [2024-06-27 18:55:34,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:34,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:34,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:34,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:34,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:34,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:34,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 454 transitions, 6727 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:34,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:34,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:34,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:37,254 INFO L124 PetriNetUnfolderBase]: 7737/12021 cut-off events. [2024-06-27 18:55:37,254 INFO L125 PetriNetUnfolderBase]: For 385674/385677 co-relation queries the response was YES. [2024-06-27 18:55:37,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88792 conditions, 12021 events. 7737/12021 cut-off events. For 385674/385677 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 76720 event pairs, 1763 based on Foata normal form. 6/11749 useless extension candidates. Maximal degree in co-relation 88677. Up to 10676 conditions per place. [2024-06-27 18:55:37,415 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 438 selfloop transitions, 69 changer transitions 0/514 dead transitions. [2024-06-27 18:55:37,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 514 transitions, 8122 flow [2024-06-27 18:55:37,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:55:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:55:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-06-27 18:55:37,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081521739130435 [2024-06-27 18:55:37,417 INFO L175 Difference]: Start difference. First operand has 230 places, 454 transitions, 6727 flow. Second operand 8 states and 187 transitions. [2024-06-27 18:55:37,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 514 transitions, 8122 flow [2024-06-27 18:55:38,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 514 transitions, 7913 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-27 18:55:38,479 INFO L231 Difference]: Finished difference. Result has 232 places, 457 transitions, 6762 flow [2024-06-27 18:55:38,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6518, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6762, PETRI_PLACES=232, PETRI_TRANSITIONS=457} [2024-06-27 18:55:38,480 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 180 predicate places. [2024-06-27 18:55:38,480 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 457 transitions, 6762 flow [2024-06-27 18:55:38,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:38,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:38,480 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:55:38,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 18:55:38,481 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:38,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:38,481 INFO L85 PathProgramCache]: Analyzing trace with hash 421685549, now seen corresponding path program 7 times [2024-06-27 18:55:38,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:38,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233652427] [2024-06-27 18:55:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:38,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:39,208 INFO L134 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:55:39,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:39,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233652427] [2024-06-27 18:55:39,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233652427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:39,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:39,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:39,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742823427] [2024-06-27 18:55:39,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:39,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:39,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:39,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:39,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:39,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:39,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 457 transitions, 6762 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:39,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:39,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:39,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:41,917 INFO L124 PetriNetUnfolderBase]: 8013/12439 cut-off events. [2024-06-27 18:55:41,917 INFO L125 PetriNetUnfolderBase]: For 436366/436369 co-relation queries the response was YES. [2024-06-27 18:55:42,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92814 conditions, 12439 events. 8013/12439 cut-off events. For 436366/436369 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 79685 event pairs, 1819 based on Foata normal form. 34/12197 useless extension candidates. Maximal degree in co-relation 92698. Up to 10702 conditions per place. [2024-06-27 18:55:42,081 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 446 selfloop transitions, 78 changer transitions 0/531 dead transitions. [2024-06-27 18:55:42,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 531 transitions, 8304 flow [2024-06-27 18:55:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:55:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:55:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2024-06-27 18:55:42,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5169082125603864 [2024-06-27 18:55:42,083 INFO L175 Difference]: Start difference. First operand has 232 places, 457 transitions, 6762 flow. Second operand 9 states and 214 transitions. [2024-06-27 18:55:42,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 531 transitions, 8304 flow [2024-06-27 18:55:43,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 531 transitions, 8090 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-27 18:55:43,284 INFO L231 Difference]: Finished difference. Result has 235 places, 461 transitions, 6862 flow [2024-06-27 18:55:43,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6561, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6862, PETRI_PLACES=235, PETRI_TRANSITIONS=461} [2024-06-27 18:55:43,286 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 183 predicate places. [2024-06-27 18:55:43,290 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 461 transitions, 6862 flow [2024-06-27 18:55:43,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:43,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:43,291 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:55:43,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 18:55:43,291 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:43,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:43,293 INFO L85 PathProgramCache]: Analyzing trace with hash 421900751, now seen corresponding path program 3 times [2024-06-27 18:55:43,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:43,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338211098] [2024-06-27 18:55:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:43,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:44,072 INFO L134 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:55:44,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:44,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338211098] [2024-06-27 18:55:44,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338211098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:44,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:44,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:44,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952287045] [2024-06-27 18:55:44,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:44,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:44,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:44,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:44,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:44,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:44,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 461 transitions, 6862 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:44,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:44,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:44,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:46,761 INFO L124 PetriNetUnfolderBase]: 8063/12519 cut-off events. [2024-06-27 18:55:46,761 INFO L125 PetriNetUnfolderBase]: For 430952/430955 co-relation queries the response was YES. [2024-06-27 18:55:46,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93867 conditions, 12519 events. 8063/12519 cut-off events. For 430952/430955 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 80306 event pairs, 1790 based on Foata normal form. 6/12247 useless extension candidates. Maximal degree in co-relation 93750. Up to 10926 conditions per place. [2024-06-27 18:55:46,921 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 438 selfloop transitions, 79 changer transitions 0/524 dead transitions. [2024-06-27 18:55:46,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 524 transitions, 8352 flow [2024-06-27 18:55:46,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:55:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:55:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-06-27 18:55:46,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081521739130435 [2024-06-27 18:55:46,923 INFO L175 Difference]: Start difference. First operand has 235 places, 461 transitions, 6862 flow. Second operand 8 states and 187 transitions. [2024-06-27 18:55:46,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 524 transitions, 8352 flow [2024-06-27 18:55:48,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 524 transitions, 8162 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-27 18:55:48,117 INFO L231 Difference]: Finished difference. Result has 236 places, 464 transitions, 6950 flow [2024-06-27 18:55:48,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6677, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6950, PETRI_PLACES=236, PETRI_TRANSITIONS=464} [2024-06-27 18:55:48,118 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 184 predicate places. [2024-06-27 18:55:48,118 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 464 transitions, 6950 flow [2024-06-27 18:55:48,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:48,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:48,119 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:55:48,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 18:55:48,119 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:48,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash 458745764, now seen corresponding path program 1 times [2024-06-27 18:55:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:48,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855222726] [2024-06-27 18:55:48,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:48,571 INFO L134 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:55:48,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:48,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855222726] [2024-06-27 18:55:48,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855222726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:48,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:48,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:55:48,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480439229] [2024-06-27 18:55:48,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:48,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:55:48,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:48,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:55:48,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:55:48,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:48,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 464 transitions, 6950 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:48,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:48,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:48,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:51,231 INFO L124 PetriNetUnfolderBase]: 8111/12475 cut-off events. [2024-06-27 18:55:51,232 INFO L125 PetriNetUnfolderBase]: For 431400/431400 co-relation queries the response was YES. [2024-06-27 18:55:51,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94246 conditions, 12475 events. 8111/12475 cut-off events. For 431400/431400 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 78739 event pairs, 2059 based on Foata normal form. 2/12236 useless extension candidates. Maximal degree in co-relation 94128. Up to 11620 conditions per place. [2024-06-27 18:55:51,411 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 469 selfloop transitions, 39 changer transitions 0/515 dead transitions. [2024-06-27 18:55:51,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 515 transitions, 8425 flow [2024-06-27 18:55:51,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:55:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:55:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2024-06-27 18:55:51,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4813664596273292 [2024-06-27 18:55:51,413 INFO L175 Difference]: Start difference. First operand has 236 places, 464 transitions, 6950 flow. Second operand 7 states and 155 transitions. [2024-06-27 18:55:51,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 515 transitions, 8425 flow [2024-06-27 18:55:52,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 515 transitions, 8199 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-27 18:55:52,883 INFO L231 Difference]: Finished difference. Result has 239 places, 481 transitions, 7088 flow [2024-06-27 18:55:52,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6724, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7088, PETRI_PLACES=239, PETRI_TRANSITIONS=481} [2024-06-27 18:55:52,883 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 187 predicate places. [2024-06-27 18:55:52,884 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 481 transitions, 7088 flow [2024-06-27 18:55:52,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:52,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:52,884 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:55:52,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 18:55:52,884 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:52,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:52,885 INFO L85 PathProgramCache]: Analyzing trace with hash 60387667, now seen corresponding path program 4 times [2024-06-27 18:55:52,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:52,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905518674] [2024-06-27 18:55:52,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:52,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:55:53,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:53,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905518674] [2024-06-27 18:55:53,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905518674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:53,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:53,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:53,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321967565] [2024-06-27 18:55:53,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:53,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:53,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:53,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:53,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:53,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:53,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 481 transitions, 7088 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:53,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:53,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:53,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:55:56,404 INFO L124 PetriNetUnfolderBase]: 8153/12571 cut-off events. [2024-06-27 18:55:56,404 INFO L125 PetriNetUnfolderBase]: For 448872/448875 co-relation queries the response was YES. [2024-06-27 18:55:56,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94621 conditions, 12571 events. 8153/12571 cut-off events. For 448872/448875 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 79344 event pairs, 2255 based on Foata normal form. 6/12324 useless extension candidates. Maximal degree in co-relation 94500. Up to 11611 conditions per place. [2024-06-27 18:55:56,615 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 490 selfloop transitions, 33 changer transitions 0/530 dead transitions. [2024-06-27 18:55:56,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 530 transitions, 8360 flow [2024-06-27 18:55:56,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:55:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:55:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2024-06-27 18:55:56,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48641304347826086 [2024-06-27 18:55:56,617 INFO L175 Difference]: Start difference. First operand has 239 places, 481 transitions, 7088 flow. Second operand 8 states and 179 transitions. [2024-06-27 18:55:56,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 530 transitions, 8360 flow [2024-06-27 18:55:58,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 530 transitions, 8271 flow, removed 36 selfloop flow, removed 2 redundant places. [2024-06-27 18:55:58,195 INFO L231 Difference]: Finished difference. Result has 245 places, 483 transitions, 7138 flow [2024-06-27 18:55:58,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6999, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7138, PETRI_PLACES=245, PETRI_TRANSITIONS=483} [2024-06-27 18:55:58,195 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 193 predicate places. [2024-06-27 18:55:58,196 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 483 transitions, 7138 flow [2024-06-27 18:55:58,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:58,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:55:58,196 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:55:58,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 18:55:58,196 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:55:58,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:55:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash 257404577, now seen corresponding path program 5 times [2024-06-27 18:55:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:55:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573001643] [2024-06-27 18:55:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:55:58,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:55:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:55:59,046 INFO L134 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:55:59,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:55:59,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573001643] [2024-06-27 18:55:59,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573001643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:55:59,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:55:59,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:55:59,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493051325] [2024-06-27 18:55:59,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:55:59,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:55:59,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:55:59,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:55:59,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:55:59,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:55:59,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 483 transitions, 7138 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:55:59,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:55:59,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:55:59,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:01,940 INFO L124 PetriNetUnfolderBase]: 8237/12814 cut-off events. [2024-06-27 18:56:01,940 INFO L125 PetriNetUnfolderBase]: For 484353/484356 co-relation queries the response was YES. [2024-06-27 18:56:02,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96711 conditions, 12814 events. 8237/12814 cut-off events. For 484353/484356 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 82223 event pairs, 3653 based on Foata normal form. 10/12556 useless extension candidates. Maximal degree in co-relation 96588. Up to 11652 conditions per place. [2024-06-27 18:56:02,161 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 476 selfloop transitions, 54 changer transitions 0/537 dead transitions. [2024-06-27 18:56:02,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 537 transitions, 8563 flow [2024-06-27 18:56:02,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:56:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:56:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-06-27 18:56:02,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463768115942029 [2024-06-27 18:56:02,163 INFO L175 Difference]: Start difference. First operand has 245 places, 483 transitions, 7138 flow. Second operand 9 states and 192 transitions. [2024-06-27 18:56:02,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 537 transitions, 8563 flow [2024-06-27 18:56:03,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 537 transitions, 8448 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-27 18:56:03,572 INFO L231 Difference]: Finished difference. Result has 249 places, 488 transitions, 7305 flow [2024-06-27 18:56:03,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7025, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7305, PETRI_PLACES=249, PETRI_TRANSITIONS=488} [2024-06-27 18:56:03,573 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 197 predicate places. [2024-06-27 18:56:03,573 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 488 transitions, 7305 flow [2024-06-27 18:56:03,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:03,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:03,573 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:56:03,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 18:56:03,574 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:03,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:03,574 INFO L85 PathProgramCache]: Analyzing trace with hash -19651940, now seen corresponding path program 1 times [2024-06-27 18:56:03,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:03,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635362286] [2024-06-27 18:56:03,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:03,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:04,447 INFO L134 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:56:04,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:04,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635362286] [2024-06-27 18:56:04,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635362286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:04,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:04,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:56:04,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314117451] [2024-06-27 18:56:04,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:04,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:56:04,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:04,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:56:04,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:56:04,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:56:04,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 488 transitions, 7305 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:04,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:04,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:56:04,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:07,634 INFO L124 PetriNetUnfolderBase]: 8248/12835 cut-off events. [2024-06-27 18:56:07,634 INFO L125 PetriNetUnfolderBase]: For 491221/491224 co-relation queries the response was YES. [2024-06-27 18:56:07,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97354 conditions, 12835 events. 8248/12835 cut-off events. For 491221/491224 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 82381 event pairs, 3649 based on Foata normal form. 4/12569 useless extension candidates. Maximal degree in co-relation 97229. Up to 11672 conditions per place. [2024-06-27 18:56:07,811 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 471 selfloop transitions, 64 changer transitions 0/542 dead transitions. [2024-06-27 18:56:07,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 542 transitions, 8753 flow [2024-06-27 18:56:07,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:56:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:56:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2024-06-27 18:56:07,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945652173913043 [2024-06-27 18:56:07,812 INFO L175 Difference]: Start difference. First operand has 249 places, 488 transitions, 7305 flow. Second operand 8 states and 182 transitions. [2024-06-27 18:56:07,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 542 transitions, 8753 flow [2024-06-27 18:56:09,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 542 transitions, 8535 flow, removed 68 selfloop flow, removed 5 redundant places. [2024-06-27 18:56:09,166 INFO L231 Difference]: Finished difference. Result has 252 places, 495 transitions, 7455 flow [2024-06-27 18:56:09,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7109, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7455, PETRI_PLACES=252, PETRI_TRANSITIONS=495} [2024-06-27 18:56:09,168 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 200 predicate places. [2024-06-27 18:56:09,168 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 495 transitions, 7455 flow [2024-06-27 18:56:09,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:09,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:09,168 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:56:09,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 18:56:09,168 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:09,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash 257412017, now seen corresponding path program 6 times [2024-06-27 18:56:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:09,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636868317] [2024-06-27 18:56:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:09,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:09,948 INFO L134 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:56:09,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:09,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636868317] [2024-06-27 18:56:09,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636868317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:09,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:09,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:56:09,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244027241] [2024-06-27 18:56:09,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:09,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:56:09,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:09,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:56:09,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:56:10,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:56:10,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 495 transitions, 7455 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:10,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:10,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:56:10,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:12,608 INFO L124 PetriNetUnfolderBase]: 8245/12818 cut-off events. [2024-06-27 18:56:12,608 INFO L125 PetriNetUnfolderBase]: For 508638/508641 co-relation queries the response was YES. [2024-06-27 18:56:12,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97417 conditions, 12818 events. 8245/12818 cut-off events. For 508638/508641 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 82203 event pairs, 3640 based on Foata normal form. 10/12562 useless extension candidates. Maximal degree in co-relation 97290. Up to 11482 conditions per place. [2024-06-27 18:56:12,801 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 485 selfloop transitions, 57 changer transitions 0/549 dead transitions. [2024-06-27 18:56:12,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 549 transitions, 8908 flow [2024-06-27 18:56:12,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:56:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:56:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2024-06-27 18:56:12,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945652173913043 [2024-06-27 18:56:12,803 INFO L175 Difference]: Start difference. First operand has 252 places, 495 transitions, 7455 flow. Second operand 8 states and 182 transitions. [2024-06-27 18:56:12,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 549 transitions, 8908 flow [2024-06-27 18:56:14,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 549 transitions, 8690 flow, removed 54 selfloop flow, removed 6 redundant places. [2024-06-27 18:56:14,295 INFO L231 Difference]: Finished difference. Result has 254 places, 498 transitions, 7483 flow [2024-06-27 18:56:14,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7237, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7483, PETRI_PLACES=254, PETRI_TRANSITIONS=498} [2024-06-27 18:56:14,295 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 202 predicate places. [2024-06-27 18:56:14,296 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 498 transitions, 7483 flow [2024-06-27 18:56:14,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:14,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:14,296 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:56:14,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 18:56:14,296 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:14,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash -27009325, now seen corresponding path program 8 times [2024-06-27 18:56:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:14,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217746331] [2024-06-27 18:56:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:14,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:56:14,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:14,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217746331] [2024-06-27 18:56:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217746331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:14,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:56:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340124663] [2024-06-27 18:56:14,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:14,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:56:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:14,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:56:14,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:56:14,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:56:14,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 498 transitions, 7483 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:14,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:14,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:56:14,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:17,663 INFO L124 PetriNetUnfolderBase]: 8331/12907 cut-off events. [2024-06-27 18:56:17,663 INFO L125 PetriNetUnfolderBase]: For 539491/539494 co-relation queries the response was YES. [2024-06-27 18:56:17,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98493 conditions, 12907 events. 8331/12907 cut-off events. For 539491/539494 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 82492 event pairs, 3658 based on Foata normal form. 34/12690 useless extension candidates. Maximal degree in co-relation 98365. Up to 11520 conditions per place. [2024-06-27 18:56:17,868 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 513 selfloop transitions, 38 changer transitions 0/558 dead transitions. [2024-06-27 18:56:17,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 558 transitions, 8945 flow [2024-06-27 18:56:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:56:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:56:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2024-06-27 18:56:17,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49033816425120774 [2024-06-27 18:56:17,871 INFO L175 Difference]: Start difference. First operand has 254 places, 498 transitions, 7483 flow. Second operand 9 states and 203 transitions. [2024-06-27 18:56:17,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 558 transitions, 8945 flow [2024-06-27 18:56:19,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 558 transitions, 8742 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-27 18:56:19,492 INFO L231 Difference]: Finished difference. Result has 257 places, 501 transitions, 7489 flow [2024-06-27 18:56:19,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7282, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7489, PETRI_PLACES=257, PETRI_TRANSITIONS=501} [2024-06-27 18:56:19,492 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 205 predicate places. [2024-06-27 18:56:19,493 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 501 transitions, 7489 flow [2024-06-27 18:56:19,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:19,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:19,493 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:56:19,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 18:56:19,493 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:19,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:19,494 INFO L85 PathProgramCache]: Analyzing trace with hash 842052704, now seen corresponding path program 2 times [2024-06-27 18:56:19,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:19,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216871909] [2024-06-27 18:56:19,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:19,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:19,908 INFO L134 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:56:19,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:19,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216871909] [2024-06-27 18:56:19,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216871909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:19,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:19,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381514628] [2024-06-27 18:56:19,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:19,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:19,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:19,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:19,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:19,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:56:19,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 501 transitions, 7489 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:19,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:19,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:56:19,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:23,363 INFO L124 PetriNetUnfolderBase]: 8364/12935 cut-off events. [2024-06-27 18:56:23,363 INFO L125 PetriNetUnfolderBase]: For 512585/512585 co-relation queries the response was YES. [2024-06-27 18:56:23,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98283 conditions, 12935 events. 8364/12935 cut-off events. For 512585/512585 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 82362 event pairs, 3726 based on Foata normal form. 2/12692 useless extension candidates. Maximal degree in co-relation 98154. Up to 12066 conditions per place. [2024-06-27 18:56:23,655 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 493 selfloop transitions, 28 changer transitions 0/528 dead transitions. [2024-06-27 18:56:23,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 528 transitions, 8692 flow [2024-06-27 18:56:23,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:56:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:56:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2024-06-27 18:56:23,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4601449275362319 [2024-06-27 18:56:23,657 INFO L175 Difference]: Start difference. First operand has 257 places, 501 transitions, 7489 flow. Second operand 6 states and 127 transitions. [2024-06-27 18:56:23,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 528 transitions, 8692 flow [2024-06-27 18:56:25,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 528 transitions, 8571 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-27 18:56:25,230 INFO L231 Difference]: Finished difference. Result has 257 places, 510 transitions, 7555 flow [2024-06-27 18:56:25,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7368, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7555, PETRI_PLACES=257, PETRI_TRANSITIONS=510} [2024-06-27 18:56:25,231 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 205 predicate places. [2024-06-27 18:56:25,231 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 510 transitions, 7555 flow [2024-06-27 18:56:25,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:25,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:25,231 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:56:25,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 18:56:25,232 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:25,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash 577714114, now seen corresponding path program 3 times [2024-06-27 18:56:25,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:25,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268687473] [2024-06-27 18:56:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:25,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:25,728 INFO L134 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:56:25,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:25,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268687473] [2024-06-27 18:56:25,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268687473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:25,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:25,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:25,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591040987] [2024-06-27 18:56:25,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:25,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:25,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:25,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:25,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:25,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:56:25,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 510 transitions, 7555 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:25,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:25,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:56:25,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:28,897 INFO L124 PetriNetUnfolderBase]: 8379/12885 cut-off events. [2024-06-27 18:56:28,898 INFO L125 PetriNetUnfolderBase]: For 503695/503707 co-relation queries the response was YES. [2024-06-27 18:56:29,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98164 conditions, 12885 events. 8379/12885 cut-off events. For 503695/503707 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 81287 event pairs, 2727 based on Foata normal form. 14/12654 useless extension candidates. Maximal degree in co-relation 98033. Up to 11996 conditions per place. [2024-06-27 18:56:29,083 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 485 selfloop transitions, 51 changer transitions 0/543 dead transitions. [2024-06-27 18:56:29,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 543 transitions, 8934 flow [2024-06-27 18:56:29,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:56:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:56:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-06-27 18:56:29,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2024-06-27 18:56:29,100 INFO L175 Difference]: Start difference. First operand has 257 places, 510 transitions, 7555 flow. Second operand 6 states and 137 transitions. [2024-06-27 18:56:29,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 543 transitions, 8934 flow [2024-06-27 18:56:30,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 543 transitions, 8878 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-27 18:56:30,924 INFO L231 Difference]: Finished difference. Result has 262 places, 516 transitions, 7752 flow [2024-06-27 18:56:30,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7499, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7752, PETRI_PLACES=262, PETRI_TRANSITIONS=516} [2024-06-27 18:56:30,940 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 210 predicate places. [2024-06-27 18:56:30,940 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 516 transitions, 7752 flow [2024-06-27 18:56:30,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:30,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:30,941 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:56:30,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 18:56:30,941 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:30,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash 664570791, now seen corresponding path program 1 times [2024-06-27 18:56:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:30,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591266298] [2024-06-27 18:56:30,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:30,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:31,492 INFO L134 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:56:31,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:31,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591266298] [2024-06-27 18:56:31,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591266298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:31,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:31,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:31,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745720405] [2024-06-27 18:56:31,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:31,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:31,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:31,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:31,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:31,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:56:31,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 516 transitions, 7752 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:31,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:31,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:56:31,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:35,065 INFO L124 PetriNetUnfolderBase]: 8419/13084 cut-off events. [2024-06-27 18:56:35,065 INFO L125 PetriNetUnfolderBase]: For 525889/525889 co-relation queries the response was YES. [2024-06-27 18:56:35,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99406 conditions, 13084 events. 8419/13084 cut-off events. For 525889/525889 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 84039 event pairs, 3721 based on Foata normal form. 2/12816 useless extension candidates. Maximal degree in co-relation 99272. Up to 12032 conditions per place. [2024-06-27 18:56:35,250 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 504 selfloop transitions, 46 changer transitions 0/557 dead transitions. [2024-06-27 18:56:35,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 557 transitions, 9234 flow [2024-06-27 18:56:35,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:56:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:56:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-06-27 18:56:35,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48757763975155277 [2024-06-27 18:56:35,251 INFO L175 Difference]: Start difference. First operand has 262 places, 516 transitions, 7752 flow. Second operand 7 states and 157 transitions. [2024-06-27 18:56:35,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 557 transitions, 9234 flow [2024-06-27 18:56:36,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 557 transitions, 9124 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-27 18:56:36,875 INFO L231 Difference]: Finished difference. Result has 265 places, 522 transitions, 7882 flow [2024-06-27 18:56:36,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7648, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7882, PETRI_PLACES=265, PETRI_TRANSITIONS=522} [2024-06-27 18:56:36,876 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 213 predicate places. [2024-06-27 18:56:36,876 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 522 transitions, 7882 flow [2024-06-27 18:56:36,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:36,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:36,877 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:56:36,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 18:56:36,877 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:36,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:36,878 INFO L85 PathProgramCache]: Analyzing trace with hash 664690761, now seen corresponding path program 2 times [2024-06-27 18:56:36,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:36,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321753426] [2024-06-27 18:56:36,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:37,464 INFO L134 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:56:37,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:37,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321753426] [2024-06-27 18:56:37,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321753426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:37,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:37,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:37,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20583955] [2024-06-27 18:56:37,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:37,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:37,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:37,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:37,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:37,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:56:37,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 522 transitions, 7882 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:37,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:37,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:56:37,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:40,784 INFO L124 PetriNetUnfolderBase]: 8479/13168 cut-off events. [2024-06-27 18:56:40,784 INFO L125 PetriNetUnfolderBase]: For 533225/533225 co-relation queries the response was YES. [2024-06-27 18:56:40,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100584 conditions, 13168 events. 8479/13168 cut-off events. For 533225/533225 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 84523 event pairs, 3737 based on Foata normal form. 2/12899 useless extension candidates. Maximal degree in co-relation 100450. Up to 12181 conditions per place. [2024-06-27 18:56:40,990 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 510 selfloop transitions, 46 changer transitions 0/563 dead transitions. [2024-06-27 18:56:40,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 563 transitions, 9297 flow [2024-06-27 18:56:40,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:56:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:56:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2024-06-27 18:56:40,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468944099378882 [2024-06-27 18:56:40,991 INFO L175 Difference]: Start difference. First operand has 265 places, 522 transitions, 7882 flow. Second operand 7 states and 151 transitions. [2024-06-27 18:56:40,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 563 transitions, 9297 flow [2024-06-27 18:56:42,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 563 transitions, 9180 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-27 18:56:42,596 INFO L231 Difference]: Finished difference. Result has 269 places, 533 transitions, 8054 flow [2024-06-27 18:56:42,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7783, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8054, PETRI_PLACES=269, PETRI_TRANSITIONS=533} [2024-06-27 18:56:42,597 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 217 predicate places. [2024-06-27 18:56:42,597 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 533 transitions, 8054 flow [2024-06-27 18:56:42,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:42,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:42,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:56:42,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 18:56:42,598 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:42,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:42,598 INFO L85 PathProgramCache]: Analyzing trace with hash 664690947, now seen corresponding path program 1 times [2024-06-27 18:56:42,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:42,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539282479] [2024-06-27 18:56:42,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:42,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:43,132 INFO L134 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:56:43,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:43,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539282479] [2024-06-27 18:56:43,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539282479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:43,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:43,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:43,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133142677] [2024-06-27 18:56:43,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:43,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:43,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:43,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:43,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:43,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:56:43,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 533 transitions, 8054 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:43,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:43,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:56:43,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:46,311 INFO L124 PetriNetUnfolderBase]: 8509/13139 cut-off events. [2024-06-27 18:56:46,311 INFO L125 PetriNetUnfolderBase]: For 541315/541315 co-relation queries the response was YES. [2024-06-27 18:56:46,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100761 conditions, 13139 events. 8509/13139 cut-off events. For 541315/541315 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 83670 event pairs, 3740 based on Foata normal form. 2/12893 useless extension candidates. Maximal degree in co-relation 100625. Up to 12196 conditions per place. [2024-06-27 18:56:46,484 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 515 selfloop transitions, 46 changer transitions 0/568 dead transitions. [2024-06-27 18:56:46,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 568 transitions, 9470 flow [2024-06-27 18:56:46,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:56:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:56:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-27 18:56:46,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720496894409938 [2024-06-27 18:56:46,485 INFO L175 Difference]: Start difference. First operand has 269 places, 533 transitions, 8054 flow. Second operand 7 states and 152 transitions. [2024-06-27 18:56:46,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 568 transitions, 9470 flow [2024-06-27 18:56:48,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 568 transitions, 9334 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-27 18:56:48,240 INFO L231 Difference]: Finished difference. Result has 273 places, 539 transitions, 8102 flow [2024-06-27 18:56:48,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7922, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8102, PETRI_PLACES=273, PETRI_TRANSITIONS=539} [2024-06-27 18:56:48,241 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 221 predicate places. [2024-06-27 18:56:48,241 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 539 transitions, 8102 flow [2024-06-27 18:56:48,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:48,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:48,241 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:56:48,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 18:56:48,242 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:48,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:48,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1362282977, now seen corresponding path program 2 times [2024-06-27 18:56:48,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:48,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321904504] [2024-06-27 18:56:48,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:48,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:48,747 INFO L134 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:56:48,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:48,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321904504] [2024-06-27 18:56:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321904504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:48,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:48,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453302271] [2024-06-27 18:56:48,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:48,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:48,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:48,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:56:48,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 539 transitions, 8102 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:48,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:48,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:56:48,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:52,051 INFO L124 PetriNetUnfolderBase]: 8539/13179 cut-off events. [2024-06-27 18:56:52,051 INFO L125 PetriNetUnfolderBase]: For 550829/550829 co-relation queries the response was YES. [2024-06-27 18:56:52,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101092 conditions, 13179 events. 8539/13179 cut-off events. For 550829/550829 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 83891 event pairs, 3741 based on Foata normal form. 2/12933 useless extension candidates. Maximal degree in co-relation 100954. Up to 12223 conditions per place. [2024-06-27 18:56:52,222 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 511 selfloop transitions, 50 changer transitions 0/568 dead transitions. [2024-06-27 18:56:52,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 568 transitions, 9489 flow [2024-06-27 18:56:52,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:56:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:56:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-06-27 18:56:52,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855072463768116 [2024-06-27 18:56:52,224 INFO L175 Difference]: Start difference. First operand has 273 places, 539 transitions, 8102 flow. Second operand 6 states and 134 transitions. [2024-06-27 18:56:52,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 568 transitions, 9489 flow [2024-06-27 18:56:53,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 568 transitions, 9335 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-27 18:56:53,762 INFO L231 Difference]: Finished difference. Result has 275 places, 544 transitions, 8157 flow [2024-06-27 18:56:53,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7958, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8157, PETRI_PLACES=275, PETRI_TRANSITIONS=544} [2024-06-27 18:56:53,763 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 223 predicate places. [2024-06-27 18:56:53,763 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 544 transitions, 8157 flow [2024-06-27 18:56:53,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:53,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:53,764 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:56:53,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 18:56:53,764 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:53,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:53,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1623196679, now seen corresponding path program 3 times [2024-06-27 18:56:53,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:53,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973428274] [2024-06-27 18:56:53,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:53,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:56:54,330 INFO L134 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:56:54,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:56:54,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973428274] [2024-06-27 18:56:54,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973428274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:56:54,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:56:54,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:56:54,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826700012] [2024-06-27 18:56:54,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:56:54,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:56:54,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:56:54,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:56:54,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:56:54,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:56:54,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 544 transitions, 8157 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:54,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:56:54,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:56:54,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:56:57,720 INFO L124 PetriNetUnfolderBase]: 8533/13246 cut-off events. [2024-06-27 18:56:57,720 INFO L125 PetriNetUnfolderBase]: For 558066/558066 co-relation queries the response was YES. [2024-06-27 18:56:57,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101208 conditions, 13246 events. 8533/13246 cut-off events. For 558066/558066 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 85023 event pairs, 3730 based on Foata normal form. 2/12975 useless extension candidates. Maximal degree in co-relation 101070. Up to 12189 conditions per place. [2024-06-27 18:56:57,896 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 508 selfloop transitions, 56 changer transitions 0/571 dead transitions. [2024-06-27 18:56:57,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 571 transitions, 9386 flow [2024-06-27 18:56:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:56:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:56:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-27 18:56:57,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2024-06-27 18:56:57,897 INFO L175 Difference]: Start difference. First operand has 275 places, 544 transitions, 8157 flow. Second operand 6 states and 136 transitions. [2024-06-27 18:56:57,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 571 transitions, 9386 flow [2024-06-27 18:56:59,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 571 transitions, 9261 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-27 18:56:59,685 INFO L231 Difference]: Finished difference. Result has 277 places, 544 transitions, 8170 flow [2024-06-27 18:56:59,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8033, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8170, PETRI_PLACES=277, PETRI_TRANSITIONS=544} [2024-06-27 18:56:59,685 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 225 predicate places. [2024-06-27 18:56:59,685 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 544 transitions, 8170 flow [2024-06-27 18:56:59,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:56:59,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:56:59,686 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:56:59,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 18:56:59,686 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:56:59,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:56:59,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1362520127, now seen corresponding path program 3 times [2024-06-27 18:56:59,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:56:59,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795965474] [2024-06-27 18:56:59,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:56:59,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:56:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:00,214 INFO L134 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:57:00,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:00,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795965474] [2024-06-27 18:57:00,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795965474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:00,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:00,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:57:00,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660274007] [2024-06-27 18:57:00,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:00,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:57:00,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:00,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:57:00,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:57:00,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:57:00,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 544 transitions, 8170 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:00,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:00,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:57:00,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:57:03,439 INFO L124 PetriNetUnfolderBase]: 8527/13166 cut-off events. [2024-06-27 18:57:03,439 INFO L125 PetriNetUnfolderBase]: For 554563/554566 co-relation queries the response was YES. [2024-06-27 18:57:03,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100862 conditions, 13166 events. 8527/13166 cut-off events. For 554563/554566 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 83894 event pairs, 3745 based on Foata normal form. 4/12921 useless extension candidates. Maximal degree in co-relation 100724. Up to 12210 conditions per place. [2024-06-27 18:57:03,613 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 507 selfloop transitions, 49 changer transitions 0/563 dead transitions. [2024-06-27 18:57:03,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 563 transitions, 9358 flow [2024-06-27 18:57:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:57:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:57:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2024-06-27 18:57:03,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463768115942029 [2024-06-27 18:57:03,614 INFO L175 Difference]: Start difference. First operand has 277 places, 544 transitions, 8170 flow. Second operand 6 states and 128 transitions. [2024-06-27 18:57:03,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 563 transitions, 9358 flow [2024-06-27 18:57:05,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 563 transitions, 9224 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-27 18:57:05,180 INFO L231 Difference]: Finished difference. Result has 278 places, 545 transitions, 8154 flow [2024-06-27 18:57:05,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8038, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8154, PETRI_PLACES=278, PETRI_TRANSITIONS=545} [2024-06-27 18:57:05,181 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 226 predicate places. [2024-06-27 18:57:05,181 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 545 transitions, 8154 flow [2024-06-27 18:57:05,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:05,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:57:05,181 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:57:05,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 18:57:05,181 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:57:05,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:57:05,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1362529055, now seen corresponding path program 1 times [2024-06-27 18:57:05,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:57:05,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780047688] [2024-06-27 18:57:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:57:05,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:57:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:57:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:57:06,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:57:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780047688] [2024-06-27 18:57:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780047688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:57:06,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:57:06,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:57:06,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130612649] [2024-06-27 18:57:06,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:57:06,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:57:06,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:57:06,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:57:06,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:57:06,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 18:57:06,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 545 transitions, 8154 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:57:06,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:57:06,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 18:57:06,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand