./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix015.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix015.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/mix015.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix015.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-28 01:25:24,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:25:24,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:25:24,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:25:24,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:25:24,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:25:24,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:25:24,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:25:24,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:25:24,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:25:24,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:25:24,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:25:24,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:25:24,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:25:24,975 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:25:24,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:25:24,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:25:24,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:25:24,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:25:24,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:25:24,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:25:24,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:25:24,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:25:24,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:25:24,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:25:24,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:25:24,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:25:24,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:25:24,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:25:24,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:25:24,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:25:24,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:25:24,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:25:24,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:25:24,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:25:24,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:25:24,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:25:24,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:25:24,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:25:24,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:25:24,981 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:25:24,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:25:24,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:25:24,982 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-28 01:25:25,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:25:25,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:25:25,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:25:25,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:25:25,242 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:25:25,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.opt.i [2024-06-28 01:25:26,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:25:26,632 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:25:26,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.opt.i [2024-06-28 01:25:26,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffa4db3dd/f21a3c53600d4344bf509be4c8ae5223/FLAGf56d09cc2 [2024-06-28 01:25:26,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffa4db3dd/f21a3c53600d4344bf509be4c8ae5223 [2024-06-28 01:25:26,658 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:25:26,659 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:25:26,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix015.opt.yml/witness.yml [2024-06-28 01:25:26,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:25:26,785 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:25:26,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:25:26,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:25:26,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:25:26,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:25:26" (1/2) ... [2024-06-28 01:25:26,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ba3a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:25:26, skipping insertion in model container [2024-06-28 01:25:26,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:25:26" (1/2) ... [2024-06-28 01:25:26,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@46de30c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:25:26, skipping insertion in model container [2024-06-28 01:25:26,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:25:26" (2/2) ... [2024-06-28 01:25:26,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ba3a75 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:26, skipping insertion in model container [2024-06-28 01:25:26,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:25:26" (2/2) ... [2024-06-28 01:25:26,794 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:25:26,877 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:25:26,878 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] (((((((((((((((((((((! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0) [2024-06-28 01:25:26,878 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] (((((((((((((((((((((! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0) [2024-06-28 01:25:26,878 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] (((((((((((((((((((((! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0) [2024-06-28 01:25:26,879 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:25:26,879 INFO L106 edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1; [2024-06-28 01:25:26,916 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:25:27,051 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/mix015.opt.i[944,957] [2024-06-28 01:25:27,245 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:25:27,254 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:25:27,287 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/mix015.opt.i[944,957] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:25:27,381 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:25:27,419 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:25:27,420 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27 WrapperNode [2024-06-28 01:25:27,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:25:27,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:25:27,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:25:27,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:25:27,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (1/1) ... [2024-06-28 01:25:27,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (1/1) ... [2024-06-28 01:25:27,487 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2024-06-28 01:25:27,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:25:27,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:25:27,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:25:27,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:25:27,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (1/1) ... [2024-06-28 01:25:27,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (1/1) ... [2024-06-28 01:25:27,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (1/1) ... [2024-06-28 01:25:27,530 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-28 01:25:27,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (1/1) ... [2024-06-28 01:25:27,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (1/1) ... [2024-06-28 01:25:27,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (1/1) ... [2024-06-28 01:25:27,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (1/1) ... [2024-06-28 01:25:27,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (1/1) ... [2024-06-28 01:25:27,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (1/1) ... [2024-06-28 01:25:27,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:25:27,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:25:27,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:25:27,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:25:27,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (1/1) ... [2024-06-28 01:25:27,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:25:27,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:25:27,588 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-28 01:25:27,604 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-28 01:25:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:25:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:25:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:25:27,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:25:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:25:27,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:25:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:25:27,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:25:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:25:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:25:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:25:27,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:25:27,620 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:25:27,753 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:25:27,756 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:25:28,092 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:25:28,092 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:25:28,244 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:25:28,244 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:25:28,245 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:25:28 BoogieIcfgContainer [2024-06-28 01:25:28,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:25:28,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:25:28,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:25:28,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:25:28,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:25:26" (1/4) ... [2024-06-28 01:25:28,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebaf098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:25:28, skipping insertion in model container [2024-06-28 01:25:28,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:25:26" (2/4) ... [2024-06-28 01:25:28,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebaf098 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:25:28, skipping insertion in model container [2024-06-28 01:25:28,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:25:27" (3/4) ... [2024-06-28 01:25:28,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebaf098 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:25:28, skipping insertion in model container [2024-06-28 01:25:28,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:25:28" (4/4) ... [2024-06-28 01:25:28,255 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.opt.i [2024-06-28 01:25:28,292 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:25:28,292 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 01:25:28,292 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:25:28,332 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:25:28,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 110 flow [2024-06-28 01:25:28,390 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-06-28 01:25:28,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:25:28,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-06-28 01:25:28,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 49 transitions, 110 flow [2024-06-28 01:25:28,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 46 transitions, 101 flow [2024-06-28 01:25:28,413 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:25:28,449 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;@6b75207c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:25:28,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-28 01:25:28,453 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:25:28,453 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:25:28,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:25:28,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:28,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:25:28,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:28,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:28,458 INFO L85 PathProgramCache]: Analyzing trace with hash 365488672, now seen corresponding path program 1 times [2024-06-28 01:25:28,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:28,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049285375] [2024-06-28 01:25:28,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:28,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:29,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:29,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049285375] [2024-06-28 01:25:29,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049285375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:29,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:29,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:25:29,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642623723] [2024-06-28 01:25:29,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:29,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:25:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:29,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:25:29,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:25:29,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-06-28 01:25:29,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:29,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:29,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-06-28 01:25:29,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:30,156 INFO L124 PetriNetUnfolderBase]: 3005/5065 cut-off events. [2024-06-28 01:25:30,156 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-28 01:25:30,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9480 conditions, 5065 events. 3005/5065 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 34105 event pairs, 2435 based on Foata normal form. 151/4779 useless extension candidates. Maximal degree in co-relation 9468. Up to 4336 conditions per place. [2024-06-28 01:25:30,184 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 40 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2024-06-28 01:25:30,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 225 flow [2024-06-28 01:25:30,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:25:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:25:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-06-28 01:25:30,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7074829931972789 [2024-06-28 01:25:30,194 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 101 flow. Second operand 3 states and 104 transitions. [2024-06-28 01:25:30,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 225 flow [2024-06-28 01:25:30,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 01:25:30,198 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 133 flow [2024-06-28 01:25:30,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-06-28 01:25:30,202 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2024-06-28 01:25:30,202 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 133 flow [2024-06-28 01:25:30,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:30,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:30,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:30,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:25:30,203 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:30,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash -951392059, now seen corresponding path program 1 times [2024-06-28 01:25:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:30,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398775449] [2024-06-28 01:25:30,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:30,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:30,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:30,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398775449] [2024-06-28 01:25:30,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398775449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:30,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:30,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:25:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848295496] [2024-06-28 01:25:30,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:30,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:25:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:30,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:25:30,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:25:31,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-06-28 01:25:31,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:31,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:31,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-06-28 01:25:31,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:31,532 INFO L124 PetriNetUnfolderBase]: 3428/5690 cut-off events. [2024-06-28 01:25:31,532 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2024-06-28 01:25:31,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11900 conditions, 5690 events. 3428/5690 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37939 event pairs, 2437 based on Foata normal form. 3/5301 useless extension candidates. Maximal degree in co-relation 11888. Up to 4908 conditions per place. [2024-06-28 01:25:31,558 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 52 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2024-06-28 01:25:31,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 321 flow [2024-06-28 01:25:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:25:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:25:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-06-28 01:25:31,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2024-06-28 01:25:31,563 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 133 flow. Second operand 4 states and 132 transitions. [2024-06-28 01:25:31,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 321 flow [2024-06-28 01:25:31,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:25:31,567 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 179 flow [2024-06-28 01:25:31,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-06-28 01:25:31,568 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2024-06-28 01:25:31,568 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 179 flow [2024-06-28 01:25:31,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:31,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:31,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:31,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:25:31,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:31,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:31,576 INFO L85 PathProgramCache]: Analyzing trace with hash 571617775, now seen corresponding path program 1 times [2024-06-28 01:25:31,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:31,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873382287] [2024-06-28 01:25:31,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:31,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:32,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:32,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873382287] [2024-06-28 01:25:32,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873382287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:32,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:32,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:25:32,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663955179] [2024-06-28 01:25:32,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:32,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:25:32,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:32,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:25:32,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:25:32,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-28 01:25:32,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:32,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:32,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-28 01:25:32,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:33,064 INFO L124 PetriNetUnfolderBase]: 4170/6067 cut-off events. [2024-06-28 01:25:33,065 INFO L125 PetriNetUnfolderBase]: For 2296/2296 co-relation queries the response was YES. [2024-06-28 01:25:33,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14851 conditions, 6067 events. 4170/6067 cut-off events. For 2296/2296 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 34769 event pairs, 1859 based on Foata normal form. 3/5843 useless extension candidates. Maximal degree in co-relation 14837. Up to 5928 conditions per place. [2024-06-28 01:25:33,095 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 64 selfloop transitions, 13 changer transitions 0/90 dead transitions. [2024-06-28 01:25:33,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 90 transitions, 431 flow [2024-06-28 01:25:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:25:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:25:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-06-28 01:25:33,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2024-06-28 01:25:33,100 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 179 flow. Second operand 5 states and 160 transitions. [2024-06-28 01:25:33,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 90 transitions, 431 flow [2024-06-28 01:25:33,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 412 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-28 01:25:33,105 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 225 flow [2024-06-28 01:25:33,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-06-28 01:25:33,106 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2024-06-28 01:25:33,107 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 225 flow [2024-06-28 01:25:33,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:33,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:33,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:33,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:25:33,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:33,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash -706470946, now seen corresponding path program 1 times [2024-06-28 01:25:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:33,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181152386] [2024-06-28 01:25:33,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:33,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:34,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:34,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181152386] [2024-06-28 01:25:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181152386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:34,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:34,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:25:34,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690540091] [2024-06-28 01:25:34,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:34,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:25:34,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:34,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:25:34,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:25:34,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-28 01:25:34,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:34,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:34,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-28 01:25:34,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:34,764 INFO L124 PetriNetUnfolderBase]: 4163/6090 cut-off events. [2024-06-28 01:25:34,764 INFO L125 PetriNetUnfolderBase]: For 4278/4278 co-relation queries the response was YES. [2024-06-28 01:25:34,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16162 conditions, 6090 events. 4163/6090 cut-off events. For 4278/4278 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 35307 event pairs, 1514 based on Foata normal form. 3/5878 useless extension candidates. Maximal degree in co-relation 16147. Up to 5895 conditions per place. [2024-06-28 01:25:34,793 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 75 selfloop transitions, 17 changer transitions 0/105 dead transitions. [2024-06-28 01:25:34,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 105 transitions, 539 flow [2024-06-28 01:25:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:25:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:25:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2024-06-28 01:25:34,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6496598639455783 [2024-06-28 01:25:34,795 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 225 flow. Second operand 6 states and 191 transitions. [2024-06-28 01:25:34,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 105 transitions, 539 flow [2024-06-28 01:25:34,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 105 transitions, 506 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-28 01:25:34,799 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 271 flow [2024-06-28 01:25:34,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-06-28 01:25:34,800 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2024-06-28 01:25:34,800 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 271 flow [2024-06-28 01:25:34,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:34,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:34,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:34,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:25:34,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:34,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:34,802 INFO L85 PathProgramCache]: Analyzing trace with hash -462540568, now seen corresponding path program 1 times [2024-06-28 01:25:34,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:34,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620052694] [2024-06-28 01:25:34,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:35,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:35,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620052694] [2024-06-28 01:25:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620052694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:35,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:35,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:25:35,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432822487] [2024-06-28 01:25:35,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:35,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:25:35,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:35,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:25:35,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:25:35,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:25:35,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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-28 01:25:35,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:35,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:25:35,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:36,340 INFO L124 PetriNetUnfolderBase]: 4692/7169 cut-off events. [2024-06-28 01:25:36,340 INFO L125 PetriNetUnfolderBase]: For 7177/7177 co-relation queries the response was YES. [2024-06-28 01:25:36,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19840 conditions, 7169 events. 4692/7169 cut-off events. For 7177/7177 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 43242 event pairs, 1825 based on Foata normal form. 4/6890 useless extension candidates. Maximal degree in co-relation 19823. Up to 6639 conditions per place. [2024-06-28 01:25:36,371 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 64 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2024-06-28 01:25:36,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 87 transitions, 495 flow [2024-06-28 01:25:36,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:25:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:25:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-06-28 01:25:36,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-06-28 01:25:36,373 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 271 flow. Second operand 5 states and 140 transitions. [2024-06-28 01:25:36,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 87 transitions, 495 flow [2024-06-28 01:25:36,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 448 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-28 01:25:36,380 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 287 flow [2024-06-28 01:25:36,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-06-28 01:25:36,383 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 10 predicate places. [2024-06-28 01:25:36,384 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 287 flow [2024-06-28 01:25:36,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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-28 01:25:36,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:36,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:36,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:25:36,385 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:36,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1474987870, now seen corresponding path program 1 times [2024-06-28 01:25:36,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:36,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472811175] [2024-06-28 01:25:36,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:36,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:36,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472811175] [2024-06-28 01:25:36,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472811175] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:36,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:36,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:25:36,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844272365] [2024-06-28 01:25:36,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:36,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:25:36,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:36,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:25:36,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:25:36,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 49 [2024-06-28 01:25:36,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 287 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:36,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:36,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 49 [2024-06-28 01:25:36,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:36,695 INFO L124 PetriNetUnfolderBase]: 1351/2674 cut-off events. [2024-06-28 01:25:36,696 INFO L125 PetriNetUnfolderBase]: For 3325/3495 co-relation queries the response was YES. [2024-06-28 01:25:36,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6429 conditions, 2674 events. 1351/2674 cut-off events. For 3325/3495 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 19953 event pairs, 243 based on Foata normal form. 2/2470 useless extension candidates. Maximal degree in co-relation 6411. Up to 1674 conditions per place. [2024-06-28 01:25:36,750 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 26 selfloop transitions, 7 changer transitions 0/67 dead transitions. [2024-06-28 01:25:36,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 67 transitions, 326 flow [2024-06-28 01:25:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:25:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:25:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-06-28 01:25:36,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7482993197278912 [2024-06-28 01:25:36,751 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 287 flow. Second operand 3 states and 110 transitions. [2024-06-28 01:25:36,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 67 transitions, 326 flow [2024-06-28 01:25:36,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 67 transitions, 304 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-28 01:25:36,754 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 236 flow [2024-06-28 01:25:36,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-06-28 01:25:36,754 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2024-06-28 01:25:36,755 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 236 flow [2024-06-28 01:25:36,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:36,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:36,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:36,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:25:36,755 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:36,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:36,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2107101739, now seen corresponding path program 1 times [2024-06-28 01:25:36,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:36,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036160650] [2024-06-28 01:25:36,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:36,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:37,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036160650] [2024-06-28 01:25:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036160650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:37,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:37,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:25:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934233001] [2024-06-28 01:25:37,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:37,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:25:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:37,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:25:37,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:25:37,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:25:37,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:37,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:37,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:25:37,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:38,484 INFO L124 PetriNetUnfolderBase]: 4711/6938 cut-off events. [2024-06-28 01:25:38,484 INFO L125 PetriNetUnfolderBase]: For 11829/11829 co-relation queries the response was YES. [2024-06-28 01:25:38,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19890 conditions, 6938 events. 4711/6938 cut-off events. For 11829/11829 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 39391 event pairs, 1748 based on Foata normal form. 4/6934 useless extension candidates. Maximal degree in co-relation 19872. Up to 6601 conditions per place. [2024-06-28 01:25:38,516 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 74 selfloop transitions, 16 changer transitions 1/103 dead transitions. [2024-06-28 01:25:38,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 568 flow [2024-06-28 01:25:38,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:25:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:25:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-06-28 01:25:38,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-06-28 01:25:38,518 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 236 flow. Second operand 6 states and 168 transitions. [2024-06-28 01:25:38,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 568 flow [2024-06-28 01:25:38,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 103 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:25:38,522 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 308 flow [2024-06-28 01:25:38,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2024-06-28 01:25:38,523 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2024-06-28 01:25:38,523 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 308 flow [2024-06-28 01:25:38,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:38,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:38,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:38,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:25:38,524 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:38,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1135611021, now seen corresponding path program 1 times [2024-06-28 01:25:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:38,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728479759] [2024-06-28 01:25:38,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:38,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:39,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:39,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728479759] [2024-06-28 01:25:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728479759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:39,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:39,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:25:39,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790919462] [2024-06-28 01:25:39,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:39,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:25:39,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:39,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:25:39,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:25:39,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:25:39,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 308 flow. Second operand has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:39,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:39,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:25:39,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:40,657 INFO L124 PetriNetUnfolderBase]: 4321/6295 cut-off events. [2024-06-28 01:25:40,657 INFO L125 PetriNetUnfolderBase]: For 13115/13115 co-relation queries the response was YES. [2024-06-28 01:25:40,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19235 conditions, 6295 events. 4321/6295 cut-off events. For 13115/13115 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 35136 event pairs, 1070 based on Foata normal form. 6/6297 useless extension candidates. Maximal degree in co-relation 19216. Up to 6048 conditions per place. [2024-06-28 01:25:40,687 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 96 selfloop transitions, 18 changer transitions 7/133 dead transitions. [2024-06-28 01:25:40,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 133 transitions, 724 flow [2024-06-28 01:25:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:25:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:25:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 235 transitions. [2024-06-28 01:25:40,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5994897959183674 [2024-06-28 01:25:40,688 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 308 flow. Second operand 8 states and 235 transitions. [2024-06-28 01:25:40,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 133 transitions, 724 flow [2024-06-28 01:25:40,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 133 transitions, 702 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-28 01:25:40,696 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 361 flow [2024-06-28 01:25:40,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=361, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-06-28 01:25:40,697 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2024-06-28 01:25:40,697 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 361 flow [2024-06-28 01:25:40,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:40,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:40,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:40,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:25:40,698 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:40,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:40,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1565642547, now seen corresponding path program 2 times [2024-06-28 01:25:40,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:40,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135079131] [2024-06-28 01:25:40,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:40,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:41,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:41,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135079131] [2024-06-28 01:25:41,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135079131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:41,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:41,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:25:41,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538523569] [2024-06-28 01:25:41,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:41,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:25:41,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:41,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:25:41,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:25:41,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:25:41,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 361 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:41,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:41,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:25:41,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:42,290 INFO L124 PetriNetUnfolderBase]: 4099/6075 cut-off events. [2024-06-28 01:25:42,290 INFO L125 PetriNetUnfolderBase]: For 17087/17102 co-relation queries the response was YES. [2024-06-28 01:25:42,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19583 conditions, 6075 events. 4099/6075 cut-off events. For 17087/17102 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 34182 event pairs, 1240 based on Foata normal form. 14/6083 useless extension candidates. Maximal degree in co-relation 19561. Up to 5761 conditions per place. [2024-06-28 01:25:42,322 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 69 selfloop transitions, 16 changer transitions 0/97 dead transitions. [2024-06-28 01:25:42,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 97 transitions, 597 flow [2024-06-28 01:25:42,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:25:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:25:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-06-28 01:25:42,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5340136054421769 [2024-06-28 01:25:42,323 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 361 flow. Second operand 6 states and 157 transitions. [2024-06-28 01:25:42,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 97 transitions, 597 flow [2024-06-28 01:25:42,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 97 transitions, 536 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-28 01:25:42,332 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 340 flow [2024-06-28 01:25:42,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=340, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-06-28 01:25:42,334 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2024-06-28 01:25:42,334 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 340 flow [2024-06-28 01:25:42,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:42,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:42,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:42,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:25:42,336 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:42,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:42,339 INFO L85 PathProgramCache]: Analyzing trace with hash -168902193, now seen corresponding path program 1 times [2024-06-28 01:25:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:42,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446717109] [2024-06-28 01:25:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:43,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:43,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446717109] [2024-06-28 01:25:43,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446717109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:43,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:43,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:25:43,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965976640] [2024-06-28 01:25:43,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:43,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:25:43,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:43,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:25:43,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:25:43,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:25:43,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 340 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:43,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:43,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:25:43,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:44,064 INFO L124 PetriNetUnfolderBase]: 4625/6811 cut-off events. [2024-06-28 01:25:44,064 INFO L125 PetriNetUnfolderBase]: For 20903/20907 co-relation queries the response was YES. [2024-06-28 01:25:44,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22252 conditions, 6811 events. 4625/6811 cut-off events. For 20903/20907 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 37818 event pairs, 1161 based on Foata normal form. 8/6800 useless extension candidates. Maximal degree in co-relation 22228. Up to 6150 conditions per place. [2024-06-28 01:25:44,103 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 102 selfloop transitions, 42 changer transitions 0/154 dead transitions. [2024-06-28 01:25:44,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 154 transitions, 1067 flow [2024-06-28 01:25:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:25:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:25:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2024-06-28 01:25:44,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5561224489795918 [2024-06-28 01:25:44,105 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 340 flow. Second operand 8 states and 218 transitions. [2024-06-28 01:25:44,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 154 transitions, 1067 flow [2024-06-28 01:25:44,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 154 transitions, 1002 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 01:25:44,117 INFO L231 Difference]: Finished difference. Result has 79 places, 96 transitions, 630 flow [2024-06-28 01:25:44,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=630, PETRI_PLACES=79, PETRI_TRANSITIONS=96} [2024-06-28 01:25:44,118 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 24 predicate places. [2024-06-28 01:25:44,118 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 630 flow [2024-06-28 01:25:44,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:44,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:44,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:44,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:25:44,119 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:44,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1331612669, now seen corresponding path program 2 times [2024-06-28 01:25:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:44,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573727463] [2024-06-28 01:25:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:44,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:44,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:44,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573727463] [2024-06-28 01:25:44,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573727463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:44,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:44,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:25:44,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601876245] [2024-06-28 01:25:44,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:44,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:25:44,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:44,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:25:44,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:25:44,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:25:44,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 630 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:44,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:44,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:25:44,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:46,169 INFO L124 PetriNetUnfolderBase]: 4705/6917 cut-off events. [2024-06-28 01:25:46,169 INFO L125 PetriNetUnfolderBase]: For 26797/26805 co-relation queries the response was YES. [2024-06-28 01:25:46,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24710 conditions, 6917 events. 4705/6917 cut-off events. For 26797/26805 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 38414 event pairs, 1171 based on Foata normal form. 16/6917 useless extension candidates. Maximal degree in co-relation 24682. Up to 6219 conditions per place. [2024-06-28 01:25:46,208 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 93 selfloop transitions, 49 changer transitions 0/152 dead transitions. [2024-06-28 01:25:46,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 152 transitions, 1172 flow [2024-06-28 01:25:46,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:25:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:25:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-06-28 01:25:46,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5451895043731778 [2024-06-28 01:25:46,210 INFO L175 Difference]: Start difference. First operand has 79 places, 96 transitions, 630 flow. Second operand 7 states and 187 transitions. [2024-06-28 01:25:46,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 152 transitions, 1172 flow [2024-06-28 01:25:46,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 152 transitions, 1140 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-28 01:25:46,235 INFO L231 Difference]: Finished difference. Result has 84 places, 102 transitions, 781 flow [2024-06-28 01:25:46,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=781, PETRI_PLACES=84, PETRI_TRANSITIONS=102} [2024-06-28 01:25:46,235 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 29 predicate places. [2024-06-28 01:25:46,235 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 102 transitions, 781 flow [2024-06-28 01:25:46,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:46,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:46,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:46,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:25:46,236 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:46,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:46,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1054105073, now seen corresponding path program 3 times [2024-06-28 01:25:46,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:46,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28054049] [2024-06-28 01:25:46,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:46,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:46,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:46,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28054049] [2024-06-28 01:25:46,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28054049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:46,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:46,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:25:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432033177] [2024-06-28 01:25:46,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:46,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:25:46,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:46,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:25:46,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:25:47,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:25:47,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 102 transitions, 781 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:47,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:47,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:25:47,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:48,097 INFO L124 PetriNetUnfolderBase]: 4823/7098 cut-off events. [2024-06-28 01:25:48,097 INFO L125 PetriNetUnfolderBase]: For 31451/31451 co-relation queries the response was YES. [2024-06-28 01:25:48,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26490 conditions, 7098 events. 4823/7098 cut-off events. For 31451/31451 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 39519 event pairs, 1172 based on Foata normal form. 10/7088 useless extension candidates. Maximal degree in co-relation 26460. Up to 6321 conditions per place. [2024-06-28 01:25:48,141 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 93 selfloop transitions, 55 changer transitions 0/158 dead transitions. [2024-06-28 01:25:48,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 158 transitions, 1376 flow [2024-06-28 01:25:48,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:25:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:25:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2024-06-28 01:25:48,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5393586005830904 [2024-06-28 01:25:48,144 INFO L175 Difference]: Start difference. First operand has 84 places, 102 transitions, 781 flow. Second operand 7 states and 185 transitions. [2024-06-28 01:25:48,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 158 transitions, 1376 flow [2024-06-28 01:25:48,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 158 transitions, 1235 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-28 01:25:48,218 INFO L231 Difference]: Finished difference. Result has 86 places, 111 transitions, 888 flow [2024-06-28 01:25:48,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=888, PETRI_PLACES=86, PETRI_TRANSITIONS=111} [2024-06-28 01:25:48,220 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 31 predicate places. [2024-06-28 01:25:48,220 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 111 transitions, 888 flow [2024-06-28 01:25:48,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:48,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:48,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:48,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:25:48,221 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:48,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash -652086897, now seen corresponding path program 4 times [2024-06-28 01:25:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:48,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746003165] [2024-06-28 01:25:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:48,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:49,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:49,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746003165] [2024-06-28 01:25:49,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746003165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:49,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:49,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:25:49,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101697381] [2024-06-28 01:25:49,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:49,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:25:49,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:49,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:25:49,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:25:49,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:25:49,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 111 transitions, 888 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:49,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:49,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:25:49,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:50,166 INFO L124 PetriNetUnfolderBase]: 4801/7066 cut-off events. [2024-06-28 01:25:50,166 INFO L125 PetriNetUnfolderBase]: For 31105/31120 co-relation queries the response was YES. [2024-06-28 01:25:50,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26072 conditions, 7066 events. 4801/7066 cut-off events. For 31105/31120 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 39278 event pairs, 1187 based on Foata normal form. 18/7060 useless extension candidates. Maximal degree in co-relation 26042. Up to 6303 conditions per place. [2024-06-28 01:25:50,205 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 88 selfloop transitions, 55 changer transitions 0/153 dead transitions. [2024-06-28 01:25:50,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 153 transitions, 1306 flow [2024-06-28 01:25:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:25:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:25:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-06-28 01:25:50,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521865889212828 [2024-06-28 01:25:50,207 INFO L175 Difference]: Start difference. First operand has 86 places, 111 transitions, 888 flow. Second operand 7 states and 179 transitions. [2024-06-28 01:25:50,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 153 transitions, 1306 flow [2024-06-28 01:25:50,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 153 transitions, 1149 flow, removed 42 selfloop flow, removed 4 redundant places. [2024-06-28 01:25:50,250 INFO L231 Difference]: Finished difference. Result has 89 places, 111 transitions, 856 flow [2024-06-28 01:25:50,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=856, PETRI_PLACES=89, PETRI_TRANSITIONS=111} [2024-06-28 01:25:50,251 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 34 predicate places. [2024-06-28 01:25:50,251 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 111 transitions, 856 flow [2024-06-28 01:25:50,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:50,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:50,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:50,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:25:50,252 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:50,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:50,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1290588263, now seen corresponding path program 1 times [2024-06-28 01:25:50,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:50,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565770703] [2024-06-28 01:25:50,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:50,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:51,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:51,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565770703] [2024-06-28 01:25:51,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565770703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:51,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:51,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:25:51,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057211627] [2024-06-28 01:25:51,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:51,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:25:51,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:51,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:25:51,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:25:51,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:25:51,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 111 transitions, 856 flow. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:51,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:51,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:25:51,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:52,180 INFO L124 PetriNetUnfolderBase]: 3936/6182 cut-off events. [2024-06-28 01:25:52,180 INFO L125 PetriNetUnfolderBase]: For 27188/27188 co-relation queries the response was YES. [2024-06-28 01:25:52,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22034 conditions, 6182 events. 3936/6182 cut-off events. For 27188/27188 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 37315 event pairs, 1079 based on Foata normal form. 4/6140 useless extension candidates. Maximal degree in co-relation 22003. Up to 5524 conditions per place. [2024-06-28 01:25:52,220 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 115 selfloop transitions, 13 changer transitions 0/152 dead transitions. [2024-06-28 01:25:52,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 152 transitions, 1257 flow [2024-06-28 01:25:52,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:25:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:25:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-06-28 01:25:52,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364431486880467 [2024-06-28 01:25:52,222 INFO L175 Difference]: Start difference. First operand has 89 places, 111 transitions, 856 flow. Second operand 7 states and 184 transitions. [2024-06-28 01:25:52,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 152 transitions, 1257 flow [2024-06-28 01:25:52,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 152 transitions, 1083 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-28 01:25:52,250 INFO L231 Difference]: Finished difference. Result has 90 places, 116 transitions, 770 flow [2024-06-28 01:25:52,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=770, PETRI_PLACES=90, PETRI_TRANSITIONS=116} [2024-06-28 01:25:52,251 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 35 predicate places. [2024-06-28 01:25:52,251 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 116 transitions, 770 flow [2024-06-28 01:25:52,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:52,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:52,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:52,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:25:52,252 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:52,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -125106810, now seen corresponding path program 1 times [2024-06-28 01:25:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:52,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77899758] [2024-06-28 01:25:52,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:52,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:53,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:53,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77899758] [2024-06-28 01:25:53,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77899758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:53,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:53,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:25:53,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896482725] [2024-06-28 01:25:53,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:53,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:25:53,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:53,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:25:53,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:25:53,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-28 01:25:53,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 116 transitions, 770 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:53,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:53,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-28 01:25:53,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:53,792 INFO L124 PetriNetUnfolderBase]: 3701/6448 cut-off events. [2024-06-28 01:25:53,792 INFO L125 PetriNetUnfolderBase]: For 29662/29667 co-relation queries the response was YES. [2024-06-28 01:25:53,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22199 conditions, 6448 events. 3701/6448 cut-off events. For 29662/29667 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 44741 event pairs, 1562 based on Foata normal form. 6/6288 useless extension candidates. Maximal degree in co-relation 22166. Up to 5346 conditions per place. [2024-06-28 01:25:53,832 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 102 selfloop transitions, 9 changer transitions 0/137 dead transitions. [2024-06-28 01:25:53,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 137 transitions, 1083 flow [2024-06-28 01:25:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:25:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:25:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-06-28 01:25:53,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2024-06-28 01:25:53,833 INFO L175 Difference]: Start difference. First operand has 90 places, 116 transitions, 770 flow. Second operand 5 states and 131 transitions. [2024-06-28 01:25:53,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 137 transitions, 1083 flow [2024-06-28 01:25:53,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 137 transitions, 1036 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:25:53,860 INFO L231 Difference]: Finished difference. Result has 92 places, 123 transitions, 817 flow [2024-06-28 01:25:53,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=817, PETRI_PLACES=92, PETRI_TRANSITIONS=123} [2024-06-28 01:25:53,861 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 37 predicate places. [2024-06-28 01:25:53,861 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 123 transitions, 817 flow [2024-06-28 01:25:53,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:53,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:53,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:53,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:25:53,862 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:53,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:53,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1669532254, now seen corresponding path program 1 times [2024-06-28 01:25:53,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:53,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067582501] [2024-06-28 01:25:53,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:53,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:54,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:54,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067582501] [2024-06-28 01:25:54,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067582501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:54,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:54,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:25:54,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712443281] [2024-06-28 01:25:54,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:54,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:25:54,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:54,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:25:54,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:25:54,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:25:54,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 123 transitions, 817 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:54,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:54,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:25:54,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:56,027 INFO L124 PetriNetUnfolderBase]: 4841/7745 cut-off events. [2024-06-28 01:25:56,027 INFO L125 PetriNetUnfolderBase]: For 39312/39319 co-relation queries the response was YES. [2024-06-28 01:25:56,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28362 conditions, 7745 events. 4841/7745 cut-off events. For 39312/39319 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 48207 event pairs, 1292 based on Foata normal form. 8/7523 useless extension candidates. Maximal degree in co-relation 28327. Up to 6100 conditions per place. [2024-06-28 01:25:56,083 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 109 selfloop transitions, 69 changer transitions 0/188 dead transitions. [2024-06-28 01:25:56,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 188 transitions, 1477 flow [2024-06-28 01:25:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:25:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:25:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-06-28 01:25:56,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-06-28 01:25:56,086 INFO L175 Difference]: Start difference. First operand has 92 places, 123 transitions, 817 flow. Second operand 8 states and 216 transitions. [2024-06-28 01:25:56,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 188 transitions, 1477 flow [2024-06-28 01:25:56,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 188 transitions, 1452 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-28 01:25:56,123 INFO L231 Difference]: Finished difference. Result has 98 places, 129 transitions, 1008 flow [2024-06-28 01:25:56,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1008, PETRI_PLACES=98, PETRI_TRANSITIONS=129} [2024-06-28 01:25:56,124 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 43 predicate places. [2024-06-28 01:25:56,124 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 129 transitions, 1008 flow [2024-06-28 01:25:56,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:56,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:56,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:56,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:25:56,124 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:56,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:56,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1669681984, now seen corresponding path program 2 times [2024-06-28 01:25:56,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:56,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543782934] [2024-06-28 01:25:56,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:56,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:56,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543782934] [2024-06-28 01:25:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543782934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:56,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:56,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:25:56,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428229374] [2024-06-28 01:25:56,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:56,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:25:56,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:25:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:25:57,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:25:57,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 129 transitions, 1008 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:57,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:57,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:25:57,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:25:58,531 INFO L124 PetriNetUnfolderBase]: 4887/7842 cut-off events. [2024-06-28 01:25:58,531 INFO L125 PetriNetUnfolderBase]: For 46922/46929 co-relation queries the response was YES. [2024-06-28 01:25:58,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30362 conditions, 7842 events. 4887/7842 cut-off events. For 46922/46929 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 49121 event pairs, 1279 based on Foata normal form. 8/7609 useless extension candidates. Maximal degree in co-relation 30325. Up to 6139 conditions per place. [2024-06-28 01:25:58,593 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 116 selfloop transitions, 65 changer transitions 0/191 dead transitions. [2024-06-28 01:25:58,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 191 transitions, 1658 flow [2024-06-28 01:25:58,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:25:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:25:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 214 transitions. [2024-06-28 01:25:58,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459183673469388 [2024-06-28 01:25:58,595 INFO L175 Difference]: Start difference. First operand has 98 places, 129 transitions, 1008 flow. Second operand 8 states and 214 transitions. [2024-06-28 01:25:58,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 191 transitions, 1658 flow [2024-06-28 01:25:58,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 191 transitions, 1543 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-28 01:25:58,641 INFO L231 Difference]: Finished difference. Result has 102 places, 132 transitions, 1071 flow [2024-06-28 01:25:58,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1071, PETRI_PLACES=102, PETRI_TRANSITIONS=132} [2024-06-28 01:25:58,642 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 47 predicate places. [2024-06-28 01:25:58,642 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 132 transitions, 1071 flow [2024-06-28 01:25:58,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:58,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:25:58,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:25:58,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:25:58,642 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:25:58,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:25:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1863707748, now seen corresponding path program 3 times [2024-06-28 01:25:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:25:58,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406307128] [2024-06-28 01:25:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:25:58,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:25:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:25:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:25:59,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:25:59,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406307128] [2024-06-28 01:25:59,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406307128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:25:59,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:25:59,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:25:59,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730167783] [2024-06-28 01:25:59,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:25:59,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:25:59,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:25:59,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:25:59,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:25:59,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:25:59,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 132 transitions, 1071 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:25:59,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:25:59,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:25:59,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:00,843 INFO L124 PetriNetUnfolderBase]: 4933/7892 cut-off events. [2024-06-28 01:26:00,844 INFO L125 PetriNetUnfolderBase]: For 50301/50304 co-relation queries the response was YES. [2024-06-28 01:26:00,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31052 conditions, 7892 events. 4933/7892 cut-off events. For 50301/50304 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 49153 event pairs, 1294 based on Foata normal form. 4/7662 useless extension candidates. Maximal degree in co-relation 31013. Up to 6178 conditions per place. [2024-06-28 01:26:00,899 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 116 selfloop transitions, 65 changer transitions 0/191 dead transitions. [2024-06-28 01:26:00,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 191 transitions, 1711 flow [2024-06-28 01:26:00,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:26:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:26:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-06-28 01:26:00,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2024-06-28 01:26:00,901 INFO L175 Difference]: Start difference. First operand has 102 places, 132 transitions, 1071 flow. Second operand 8 states and 212 transitions. [2024-06-28 01:26:00,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 191 transitions, 1711 flow [2024-06-28 01:26:00,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 191 transitions, 1595 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-28 01:26:00,961 INFO L231 Difference]: Finished difference. Result has 105 places, 135 transitions, 1131 flow [2024-06-28 01:26:00,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1131, PETRI_PLACES=105, PETRI_TRANSITIONS=135} [2024-06-28 01:26:00,962 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 50 predicate places. [2024-06-28 01:26:00,962 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 135 transitions, 1131 flow [2024-06-28 01:26:00,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:00,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:00,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:00,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 01:26:00,963 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:00,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1648023256, now seen corresponding path program 4 times [2024-06-28 01:26:00,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:00,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965352583] [2024-06-28 01:26:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:01,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965352583] [2024-06-28 01:26:01,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965352583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:01,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:01,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:26:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169009877] [2024-06-28 01:26:01,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:01,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:26:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:01,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:26:01,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:26:01,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:26:01,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 135 transitions, 1131 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:01,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:01,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:26:01,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:03,032 INFO L124 PetriNetUnfolderBase]: 4923/7352 cut-off events. [2024-06-28 01:26:03,032 INFO L125 PetriNetUnfolderBase]: For 53836/53839 co-relation queries the response was YES. [2024-06-28 01:26:03,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30680 conditions, 7352 events. 4923/7352 cut-off events. For 53836/53839 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 42098 event pairs, 1161 based on Foata normal form. 6/7298 useless extension candidates. Maximal degree in co-relation 30640. Up to 6170 conditions per place. [2024-06-28 01:26:03,082 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 111 selfloop transitions, 65 changer transitions 0/186 dead transitions. [2024-06-28 01:26:03,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 186 transitions, 1657 flow [2024-06-28 01:26:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:26:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:26:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-06-28 01:26:03,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2024-06-28 01:26:03,083 INFO L175 Difference]: Start difference. First operand has 105 places, 135 transitions, 1131 flow. Second operand 8 states and 206 transitions. [2024-06-28 01:26:03,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 186 transitions, 1657 flow [2024-06-28 01:26:03,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 186 transitions, 1529 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-28 01:26:03,152 INFO L231 Difference]: Finished difference. Result has 108 places, 135 transitions, 1143 flow [2024-06-28 01:26:03,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1143, PETRI_PLACES=108, PETRI_TRANSITIONS=135} [2024-06-28 01:26:03,153 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 53 predicate places. [2024-06-28 01:26:03,153 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 135 transitions, 1143 flow [2024-06-28 01:26:03,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:03,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:03,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:03,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:26:03,154 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:03,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:03,154 INFO L85 PathProgramCache]: Analyzing trace with hash 416657453, now seen corresponding path program 1 times [2024-06-28 01:26:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:03,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063349928] [2024-06-28 01:26:03,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:03,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:04,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:04,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063349928] [2024-06-28 01:26:04,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063349928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:04,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:04,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:26:04,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637539429] [2024-06-28 01:26:04,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:04,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:26:04,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:04,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:26:04,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:26:04,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-28 01:26:04,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 135 transitions, 1143 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:04,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:04,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-28 01:26:04,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:04,985 INFO L124 PetriNetUnfolderBase]: 3831/6485 cut-off events. [2024-06-28 01:26:04,985 INFO L125 PetriNetUnfolderBase]: For 48990/48994 co-relation queries the response was YES. [2024-06-28 01:26:05,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25828 conditions, 6485 events. 3831/6485 cut-off events. For 48990/48994 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 43595 event pairs, 1505 based on Foata normal form. 5/6348 useless extension candidates. Maximal degree in co-relation 25787. Up to 5440 conditions per place. [2024-06-28 01:26:05,037 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 115 selfloop transitions, 12 changer transitions 0/157 dead transitions. [2024-06-28 01:26:05,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 157 transitions, 1479 flow [2024-06-28 01:26:05,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:26:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:26:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-06-28 01:26:05,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272108843537415 [2024-06-28 01:26:05,039 INFO L175 Difference]: Start difference. First operand has 108 places, 135 transitions, 1143 flow. Second operand 6 states and 155 transitions. [2024-06-28 01:26:05,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 157 transitions, 1479 flow [2024-06-28 01:26:05,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 157 transitions, 1261 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-28 01:26:05,089 INFO L231 Difference]: Finished difference. Result has 104 places, 138 transitions, 987 flow [2024-06-28 01:26:05,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=987, PETRI_PLACES=104, PETRI_TRANSITIONS=138} [2024-06-28 01:26:05,089 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 49 predicate places. [2024-06-28 01:26:05,089 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 138 transitions, 987 flow [2024-06-28 01:26:05,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:05,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:05,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:05,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 01:26:05,090 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:05,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 215774146, now seen corresponding path program 1 times [2024-06-28 01:26:05,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:05,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258407616] [2024-06-28 01:26:05,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:05,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:06,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:06,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258407616] [2024-06-28 01:26:06,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258407616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:06,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:06,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:26:06,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947929659] [2024-06-28 01:26:06,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:06,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:26:06,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:06,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:26:06,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:26:06,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:26:06,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 138 transitions, 987 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:06,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:06,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:26:06,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:07,608 INFO L124 PetriNetUnfolderBase]: 4973/8101 cut-off events. [2024-06-28 01:26:07,608 INFO L125 PetriNetUnfolderBase]: For 61187/61191 co-relation queries the response was YES. [2024-06-28 01:26:07,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31911 conditions, 8101 events. 4973/8101 cut-off events. For 61187/61191 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 51896 event pairs, 1466 based on Foata normal form. 8/7838 useless extension candidates. Maximal degree in co-relation 31870. Up to 6908 conditions per place. [2024-06-28 01:26:07,652 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 167 selfloop transitions, 30 changer transitions 0/207 dead transitions. [2024-06-28 01:26:07,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 207 transitions, 1633 flow [2024-06-28 01:26:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:26:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:26:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-06-28 01:26:07,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528344671201814 [2024-06-28 01:26:07,654 INFO L175 Difference]: Start difference. First operand has 104 places, 138 transitions, 987 flow. Second operand 9 states and 233 transitions. [2024-06-28 01:26:07,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 207 transitions, 1633 flow [2024-06-28 01:26:07,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 207 transitions, 1593 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:26:07,702 INFO L231 Difference]: Finished difference. Result has 109 places, 141 transitions, 1057 flow [2024-06-28 01:26:07,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1057, PETRI_PLACES=109, PETRI_TRANSITIONS=141} [2024-06-28 01:26:07,703 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 54 predicate places. [2024-06-28 01:26:07,703 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 141 transitions, 1057 flow [2024-06-28 01:26:07,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:07,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:07,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:07,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 01:26:07,703 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:07,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:07,704 INFO L85 PathProgramCache]: Analyzing trace with hash 215894116, now seen corresponding path program 2 times [2024-06-28 01:26:07,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:07,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342908528] [2024-06-28 01:26:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:07,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:08,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:08,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342908528] [2024-06-28 01:26:08,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342908528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:08,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:08,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:26:08,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787385892] [2024-06-28 01:26:08,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:08,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:26:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:08,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:26:08,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:26:08,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:26:08,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 141 transitions, 1057 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:08,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:08,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:26:08,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:10,138 INFO L124 PetriNetUnfolderBase]: 5019/8052 cut-off events. [2024-06-28 01:26:10,139 INFO L125 PetriNetUnfolderBase]: For 68391/68398 co-relation queries the response was YES. [2024-06-28 01:26:10,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33213 conditions, 8052 events. 5019/8052 cut-off events. For 68391/68398 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 50484 event pairs, 1197 based on Foata normal form. 8/7819 useless extension candidates. Maximal degree in co-relation 33171. Up to 6119 conditions per place. [2024-06-28 01:26:10,189 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 122 selfloop transitions, 83 changer transitions 0/215 dead transitions. [2024-06-28 01:26:10,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 215 transitions, 1841 flow [2024-06-28 01:26:10,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:26:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:26:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 243 transitions. [2024-06-28 01:26:10,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-06-28 01:26:10,190 INFO L175 Difference]: Start difference. First operand has 109 places, 141 transitions, 1057 flow. Second operand 9 states and 243 transitions. [2024-06-28 01:26:10,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 215 transitions, 1841 flow [2024-06-28 01:26:10,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 215 transitions, 1755 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-28 01:26:10,244 INFO L231 Difference]: Finished difference. Result has 111 places, 147 transitions, 1235 flow [2024-06-28 01:26:10,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1235, PETRI_PLACES=111, PETRI_TRANSITIONS=147} [2024-06-28 01:26:10,245 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 56 predicate places. [2024-06-28 01:26:10,245 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 147 transitions, 1235 flow [2024-06-28 01:26:10,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:10,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:10,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:10,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 01:26:10,246 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:10,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 220535746, now seen corresponding path program 3 times [2024-06-28 01:26:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:10,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784204724] [2024-06-28 01:26:10,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:10,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784204724] [2024-06-28 01:26:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784204724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:11,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:11,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:26:11,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999372050] [2024-06-28 01:26:11,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:11,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:26:11,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:11,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:26:11,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:26:11,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:26:11,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 147 transitions, 1235 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:11,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:11,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:26:11,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:12,520 INFO L124 PetriNetUnfolderBase]: 5065/8088 cut-off events. [2024-06-28 01:26:12,520 INFO L125 PetriNetUnfolderBase]: For 78085/78092 co-relation queries the response was YES. [2024-06-28 01:26:12,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35006 conditions, 8088 events. 5065/8088 cut-off events. For 78085/78092 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 50318 event pairs, 1186 based on Foata normal form. 8/7871 useless extension candidates. Maximal degree in co-relation 34963. Up to 6158 conditions per place. [2024-06-28 01:26:12,572 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 129 selfloop transitions, 79 changer transitions 0/218 dead transitions. [2024-06-28 01:26:12,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 218 transitions, 1999 flow [2024-06-28 01:26:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:26:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:26:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2024-06-28 01:26:12,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546485260770975 [2024-06-28 01:26:12,574 INFO L175 Difference]: Start difference. First operand has 111 places, 147 transitions, 1235 flow. Second operand 9 states and 241 transitions. [2024-06-28 01:26:12,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 218 transitions, 1999 flow [2024-06-28 01:26:12,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 218 transitions, 1868 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-28 01:26:12,646 INFO L231 Difference]: Finished difference. Result has 115 places, 150 transitions, 1318 flow [2024-06-28 01:26:12,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1318, PETRI_PLACES=115, PETRI_TRANSITIONS=150} [2024-06-28 01:26:12,647 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 60 predicate places. [2024-06-28 01:26:12,647 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 150 transitions, 1318 flow [2024-06-28 01:26:12,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:12,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:12,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:12,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 01:26:12,648 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:12,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:12,648 INFO L85 PathProgramCache]: Analyzing trace with hash -647330938, now seen corresponding path program 1 times [2024-06-28 01:26:12,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:12,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747055946] [2024-06-28 01:26:12,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:12,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:13,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:13,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747055946] [2024-06-28 01:26:13,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747055946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:13,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:13,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:26:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654671372] [2024-06-28 01:26:13,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:13,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:26:13,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:13,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:26:13,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:26:13,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:26:13,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 150 transitions, 1318 flow. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:13,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:13,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:26:13,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:14,890 INFO L124 PetriNetUnfolderBase]: 4847/7978 cut-off events. [2024-06-28 01:26:14,891 INFO L125 PetriNetUnfolderBase]: For 85813/85825 co-relation queries the response was YES. [2024-06-28 01:26:14,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35016 conditions, 7978 events. 4847/7978 cut-off events. For 85813/85825 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 52447 event pairs, 2147 based on Foata normal form. 11/7786 useless extension candidates. Maximal degree in co-relation 34971. Up to 6633 conditions per place. [2024-06-28 01:26:14,952 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 150 selfloop transitions, 43 changer transitions 0/216 dead transitions. [2024-06-28 01:26:14,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 216 transitions, 2053 flow [2024-06-28 01:26:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:26:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:26:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-06-28 01:26:14,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-28 01:26:14,955 INFO L175 Difference]: Start difference. First operand has 115 places, 150 transitions, 1318 flow. Second operand 9 states and 225 transitions. [2024-06-28 01:26:14,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 216 transitions, 2053 flow [2024-06-28 01:26:15,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 216 transitions, 1889 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-28 01:26:15,045 INFO L231 Difference]: Finished difference. Result has 122 places, 167 transitions, 1488 flow [2024-06-28 01:26:15,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1488, PETRI_PLACES=122, PETRI_TRANSITIONS=167} [2024-06-28 01:26:15,046 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 67 predicate places. [2024-06-28 01:26:15,046 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 167 transitions, 1488 flow [2024-06-28 01:26:15,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:15,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:15,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:15,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 01:26:15,047 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:15,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash -875824954, now seen corresponding path program 2 times [2024-06-28 01:26:15,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:15,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205505703] [2024-06-28 01:26:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:15,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:16,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:16,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205505703] [2024-06-28 01:26:16,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205505703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:16,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:16,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:26:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004367107] [2024-06-28 01:26:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:16,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:26:16,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:16,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:26:16,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:26:16,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:26:16,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 167 transitions, 1488 flow. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:16,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:16,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:26:16,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:17,438 INFO L124 PetriNetUnfolderBase]: 4972/8307 cut-off events. [2024-06-28 01:26:17,439 INFO L125 PetriNetUnfolderBase]: For 95547/95561 co-relation queries the response was YES. [2024-06-28 01:26:17,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37071 conditions, 8307 events. 4972/8307 cut-off events. For 95547/95561 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 55876 event pairs, 2220 based on Foata normal form. 15/8077 useless extension candidates. Maximal degree in co-relation 37021. Up to 6777 conditions per place. [2024-06-28 01:26:17,496 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 159 selfloop transitions, 56 changer transitions 0/238 dead transitions. [2024-06-28 01:26:17,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 238 transitions, 2295 flow [2024-06-28 01:26:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:26:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:26:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 238 transitions. [2024-06-28 01:26:17,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-06-28 01:26:17,498 INFO L175 Difference]: Start difference. First operand has 122 places, 167 transitions, 1488 flow. Second operand 9 states and 238 transitions. [2024-06-28 01:26:17,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 238 transitions, 2295 flow [2024-06-28 01:26:17,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 238 transitions, 2189 flow, removed 32 selfloop flow, removed 2 redundant places. [2024-06-28 01:26:17,594 INFO L231 Difference]: Finished difference. Result has 132 places, 183 transitions, 1772 flow [2024-06-28 01:26:17,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1772, PETRI_PLACES=132, PETRI_TRANSITIONS=183} [2024-06-28 01:26:17,594 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 77 predicate places. [2024-06-28 01:26:17,594 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 183 transitions, 1772 flow [2024-06-28 01:26:17,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:17,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:17,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:17,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 01:26:17,595 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:17,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:17,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1671993364, now seen corresponding path program 4 times [2024-06-28 01:26:17,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:17,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431248808] [2024-06-28 01:26:17,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:17,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:18,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:18,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431248808] [2024-06-28 01:26:18,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431248808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:18,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:18,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:26:18,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636213309] [2024-06-28 01:26:18,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:18,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:26:18,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:18,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:26:18,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:26:18,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:26:18,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 183 transitions, 1772 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:18,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:18,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:26:18,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:20,050 INFO L124 PetriNetUnfolderBase]: 6021/9522 cut-off events. [2024-06-28 01:26:20,051 INFO L125 PetriNetUnfolderBase]: For 106560/106567 co-relation queries the response was YES. [2024-06-28 01:26:20,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44323 conditions, 9522 events. 6021/9522 cut-off events. For 106560/106567 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 60763 event pairs, 1719 based on Foata normal form. 8/9358 useless extension candidates. Maximal degree in co-relation 44268. Up to 6849 conditions per place. [2024-06-28 01:26:20,122 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 162 selfloop transitions, 141 changer transitions 0/313 dead transitions. [2024-06-28 01:26:20,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 313 transitions, 3200 flow [2024-06-28 01:26:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:26:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:26:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 270 transitions. [2024-06-28 01:26:20,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-06-28 01:26:20,124 INFO L175 Difference]: Start difference. First operand has 132 places, 183 transitions, 1772 flow. Second operand 10 states and 270 transitions. [2024-06-28 01:26:20,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 313 transitions, 3200 flow [2024-06-28 01:26:20,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 313 transitions, 3085 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-28 01:26:20,271 INFO L231 Difference]: Finished difference. Result has 142 places, 236 transitions, 2479 flow [2024-06-28 01:26:20,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2479, PETRI_PLACES=142, PETRI_TRANSITIONS=236} [2024-06-28 01:26:20,271 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 87 predicate places. [2024-06-28 01:26:20,271 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 236 transitions, 2479 flow [2024-06-28 01:26:20,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:20,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:20,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:20,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 01:26:20,272 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:20,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:20,272 INFO L85 PathProgramCache]: Analyzing trace with hash 256544555, now seen corresponding path program 1 times [2024-06-28 01:26:20,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:20,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32807160] [2024-06-28 01:26:20,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:20,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:21,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:21,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32807160] [2024-06-28 01:26:21,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32807160] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:21,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:21,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:26:21,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255992085] [2024-06-28 01:26:21,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:21,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:26:21,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:21,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:26:21,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:26:21,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:26:21,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 236 transitions, 2479 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:21,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:21,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:26:21,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:21,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L791-->L794: 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][234], [Black: 386#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 269#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 146#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 400#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 231#true, Black: 396#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 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: 139#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 391#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 144#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 402#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 48#$Ultimate##0true, Black: 289#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 168#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 418#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 414#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 422#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 97#true, Black: 309#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P2Thread1of1ForFork2InUse, 28#L858-5true, 12#L761true, 135#true, P1Thread1of1ForFork0InUse, Black: 185#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P0Thread1of1ForFork1InUse, Black: 317#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (or (and (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (and (= ~__unbuffered_p2_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0)))) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 440#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 433#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 444#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 448#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 68#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 446#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 74#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 202#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 81#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 330#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 7#L794true, Black: 211#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 215#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 429#true, Black: 92#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 226#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 228#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 363#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 454#true, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 118#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 342#true]) [2024-06-28 01:26:21,632 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-28 01:26:21,632 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 01:26:21,632 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 01:26:21,633 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 01:26:21,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L799-->L810: Formula: (and (= v_~z$w_buff0_used~0_149 1) (= v_~z$r_buff0_thd0~0_67 v_~z$r_buff1_thd0~0_63) (= v_~z$w_buff0~0_113 v_~z$w_buff1~0_97) (= v_~z$w_buff0~0_112 1) (= v_~z$r_buff0_thd3~0_87 v_~z$r_buff1_thd3~0_75) (= v_~z$r_buff0_thd3~0_86 1) (= v_~z$r_buff0_thd2~0_85 v_~z$r_buff1_thd2~0_87) (= v_~z$w_buff0_used~0_150 v_~z$w_buff1_used~0_138) (not (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_149 256) 0)) (not (= (mod v_~z$w_buff1_used~0_138 256) 0)))) 1 0) 0)) (= v_~z$r_buff0_thd1~0_45 v_~z$r_buff1_thd1~0_47)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_67, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_150, ~z$w_buff0~0=v_~z$w_buff0~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_87, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_45, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_85} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_149, ~z$w_buff0~0=v_~z$w_buff0~0_112, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_75, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_87, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_138, ~z$w_buff1~0=v_~z$w_buff1~0_97, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_67, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_63, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_47, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_86, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_45, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_85} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1][235], [Black: 386#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 269#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 146#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 400#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 231#true, Black: 396#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 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: 139#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 391#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 144#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 402#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 45#L810true, Black: 289#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 9#L789true, Black: 168#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 418#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 414#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 422#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 97#true, Black: 309#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P2Thread1of1ForFork2InUse, 28#L858-5true, 12#L761true, 135#true, P1Thread1of1ForFork0InUse, Black: 185#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P0Thread1of1ForFork1InUse, Black: 317#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (or (and (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (and (= ~__unbuffered_p2_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0)))) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 440#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 433#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 444#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 448#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 446#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 68#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 202#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 74#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 330#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 211#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 215#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 429#true, Black: 92#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 226#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 228#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 363#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 454#true, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 118#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 342#true]) [2024-06-28 01:26:21,634 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-28 01:26:21,634 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 01:26:21,634 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 01:26:21,634 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 01:26:21,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L763-->L766: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][236], [30#L766true, Black: 386#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 269#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 400#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 146#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 231#true, Black: 396#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 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: 139#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 144#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 391#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 402#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 48#$Ultimate##0true, Black: 289#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 9#L789true, Black: 168#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 418#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 414#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 97#true, Black: 422#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), Black: 309#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P2Thread1of1ForFork2InUse, 28#L858-5true, 135#true, P1Thread1of1ForFork0InUse, Black: 185#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P0Thread1of1ForFork1InUse, Black: 317#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (or (and (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (and (= ~__unbuffered_p2_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0)))) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 440#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 433#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 444#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 448#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 68#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 446#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 74#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 202#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 81#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 330#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 211#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 215#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 429#true, Black: 92#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 226#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 228#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), 454#true, Black: 363#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 118#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 342#true]) [2024-06-28 01:26:21,712 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-28 01:26:21,712 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 01:26:21,713 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 01:26:21,713 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 01:26:21,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L791-->L794: 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][234], [Black: 386#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 269#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 400#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 231#true, Black: 146#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 396#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 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: 139#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 144#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 391#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 402#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 48#$Ultimate##0true, Black: 289#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 168#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 418#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 414#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 97#true, Black: 422#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), Black: 309#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P2Thread1of1ForFork2InUse, 12#L761true, P1Thread1of1ForFork0InUse, 135#true, Black: 185#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P0Thread1of1ForFork1InUse, Black: 317#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (or (and (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (and (= ~__unbuffered_p2_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0)))) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 440#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 433#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 444#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 448#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 68#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 446#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 74#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 202#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 81#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 330#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 7#L794true, Black: 211#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 215#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 429#true, Black: 92#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 226#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 228#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 363#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 454#true, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 38#L859true, Black: 118#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 342#true]) [2024-06-28 01:26:21,714 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-28 01:26:21,714 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 01:26:21,714 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 01:26:21,715 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 01:26:21,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L799-->L810: Formula: (and (= v_~z$w_buff0_used~0_149 1) (= v_~z$r_buff0_thd0~0_67 v_~z$r_buff1_thd0~0_63) (= v_~z$w_buff0~0_113 v_~z$w_buff1~0_97) (= v_~z$w_buff0~0_112 1) (= v_~z$r_buff0_thd3~0_87 v_~z$r_buff1_thd3~0_75) (= v_~z$r_buff0_thd3~0_86 1) (= v_~z$r_buff0_thd2~0_85 v_~z$r_buff1_thd2~0_87) (= v_~z$w_buff0_used~0_150 v_~z$w_buff1_used~0_138) (not (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_149 256) 0)) (not (= (mod v_~z$w_buff1_used~0_138 256) 0)))) 1 0) 0)) (= v_~z$r_buff0_thd1~0_45 v_~z$r_buff1_thd1~0_47)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_67, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_150, ~z$w_buff0~0=v_~z$w_buff0~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_87, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_45, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_85} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_149, ~z$w_buff0~0=v_~z$w_buff0~0_112, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_75, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_87, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_138, ~z$w_buff1~0=v_~z$w_buff1~0_97, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_67, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_63, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_47, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_86, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_45, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_85} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1][235], [Black: 386#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 269#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 400#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 231#true, Black: 146#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 396#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 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: 139#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 144#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 391#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 402#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 45#L810true, Black: 289#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 9#L789true, Black: 168#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 418#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 414#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 97#true, Black: 422#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), Black: 309#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P2Thread1of1ForFork2InUse, 12#L761true, P1Thread1of1ForFork0InUse, 135#true, Black: 185#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P0Thread1of1ForFork1InUse, Black: 317#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (or (and (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (and (= ~__unbuffered_p2_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0)))) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 440#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 433#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 444#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 448#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 446#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 68#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 202#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 81#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 330#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 211#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 215#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 429#true, Black: 92#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 226#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 228#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 363#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 454#true, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 38#L859true, Black: 118#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 342#true]) [2024-06-28 01:26:21,715 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-28 01:26:21,716 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 01:26:21,716 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 01:26:21,716 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 01:26:21,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L859-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse1 (not (= |v_#ghost~multithreaded_6| 0))) (.cse20 (< v_~__unbuffered_cnt~0_11 0)) (.cse15 (not (= (mod v_~z$r_buff1_thd2~0_14 256) 0))) (.cse10 (not (= v_~z$w_buff1~0_13 1))) (.cse11 (not (= v_~z$w_buff1~0_13 0))) (.cse31 (not (= v_~a~0_7 1))) (.cse32 (not (= v_~a~0_7 0))) (.cse0 (not (= v_~y~0_7 1))) (.cse2 (not (= v_~y~0_7 0))) (.cse25 (not (= v_~z$read_delayed_var~0.offset_5 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_6 256) 0))) (.cse33 (not (= v_~__unbuffered_p1_EAX~0_6 1))) (.cse34 (not (= v_~__unbuffered_p1_EAX~0_6 0))) (.cse8 (not (= v_~x~0_7 1))) (.cse9 (not (= v_~x~0_7 0))) (.cse14 (not (= (mod v_~z$r_buff1_thd1~0_6 256) 0))) (.cse12 (not (= v_~z$mem_tmp~0_9 0))) (.cse13 (not (= v_~z$mem_tmp~0_9 1))) (.cse26 (not (= v_~z$read_delayed_var~0.base_5 0))) (.cse19 (not (= 0 (mod v_~z$r_buff0_thd1~0_6 256)))) (.cse27 (not (= v_~__unbuffered_p2_EBX~0_6 0))) (.cse28 (not (= v_~__unbuffered_p2_EBX~0_6 1))) (.cse18 (not (= (mod v_~z$r_buff0_thd2~0_14 256) 0))) (.cse21 (not (= v_~z$w_buff0~0_14 1))) (.cse22 (not (= v_~z$w_buff0~0_14 0))) (.cse16 (not (= v_~__unbuffered_p2_EAX~0_6 0))) (.cse17 (not (= v_~__unbuffered_p2_EAX~0_6 1))) (.cse3 (not (= v_~z~0_19 0))) (.cse4 (not (= v_~z~0_19 1))) (.cse7 (not (= (mod v_~z$read_delayed~0_5 256) 0))) (.cse23 (not (= v_~__unbuffered_p0_EBX~0_6 1))) (.cse24 (not (= v_~__unbuffered_p0_EBX~0_6 0))) (.cse6 (not (= (mod v_~z$r_buff1_thd0~0_6 256) 0))) (.cse29 (not (= v_~__unbuffered_p0_EAX~0_6 1))) (.cse30 (not (= v_~__unbuffered_p0_EAX~0_6 0)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4) (and .cse5 .cse1) (and .cse1 .cse6) (and .cse1 .cse7) (and .cse8 .cse1 .cse9) (and .cse1 .cse10 .cse11) (and .cse12 .cse1 .cse13) (and .cse14 .cse1) (and .cse15 .cse1) (and .cse1 .cse16 .cse17) (and .cse1 .cse18) (and .cse1 .cse19) (and .cse20 .cse1) (and .cse21 .cse1 .cse22) (and .cse23 .cse1 .cse24) (and (or .cse25 .cse26) .cse1) (and .cse27 .cse28 .cse1) (and .cse1 .cse29 .cse30) (and .cse31 .cse1 .cse32) (and .cse33 .cse1 .cse34) (and .cse1 (or .cse20 .cse15 (and .cse10 .cse11) (and .cse31 .cse32) (and .cse0 .cse2) .cse25 .cse5 (and .cse33 .cse34) (and .cse8 .cse9) (not (= 0 (mod v_~z$flush_delayed~0_11 256))) .cse14 (and .cse12 .cse13) .cse26 .cse19 (and .cse27 .cse28) .cse18 (and .cse21 .cse22) (and .cse16 .cse17) (and .cse3 .cse4) .cse7 (and .cse23 .cse24) .cse6 (and .cse29 .cse30))))) InVars {~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_14, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_13, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_6, #ghost~multithreaded=|v_#ghost~multithreaded_6|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_6, ~z$w_buff0~0=v_~z$w_buff0~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z~0=v_~z~0_19, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~x~0=v_~x~0_7} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_14, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_13, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_6, #ghost~multithreaded=|v_#ghost~multithreaded_6|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_6, ~z$w_buff0~0=v_~z$w_buff0~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z~0=v_~z~0_19, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[][190], [Black: 386#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 359#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 269#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 146#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 400#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 231#true, Black: 139#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 396#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 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: 398#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 391#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 144#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 402#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 48#$Ultimate##0true, Black: 289#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 9#L789true, Black: 168#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 418#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 414#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 422#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 97#true, Black: 309#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P2Thread1of1ForFork2InUse, 12#L761true, P1Thread1of1ForFork0InUse, 135#true, 380#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 185#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P0Thread1of1ForFork1InUse, Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 317#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (or (and (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (and (= ~__unbuffered_p2_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0)))) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 433#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 444#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 20#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 448#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 68#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 446#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 74#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 202#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 81#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 330#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 211#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 215#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), Black: 92#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 226#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 228#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 363#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 454#true, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 440#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 118#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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))]) [2024-06-28 01:26:21,784 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-06-28 01:26:21,784 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-28 01:26:21,784 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-28 01:26:21,784 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-28 01:26:21,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L763-->L766: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][236], [30#L766true, Black: 386#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 269#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 400#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 146#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 231#true, Black: 396#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 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: 139#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 144#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 391#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 402#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 48#$Ultimate##0true, Black: 289#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 9#L789true, Black: 168#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 418#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 414#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 97#true, Black: 422#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), Black: 309#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P2Thread1of1ForFork2InUse, 135#true, P1Thread1of1ForFork0InUse, Black: 185#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), P0Thread1of1ForFork1InUse, Black: 317#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (or (and (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (and (= ~__unbuffered_p2_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0)))) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 440#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 433#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$mem_tmp~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 444#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 448#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 68#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 446#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 74#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 202#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 81#(and (= ~__unbuffered_cnt~0 0) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 330#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 211#(and (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 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: 215#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#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))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 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)), 429#true, Black: 92#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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: 226#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$r_buff1_thd1~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 228#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 363#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 454#true, Black: 109#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 38#L859true, Black: 118#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$flush_delayed~0 (* (div ~z$flush_delayed~0 256) 256)) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (<= 0 ~z$r_buff0_thd1~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= 0 ~z$flush_delayed~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(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))) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EBX~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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~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)), 342#true]) [2024-06-28 01:26:21,791 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-28 01:26:21,792 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 01:26:21,792 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 01:26:21,792 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 01:26:22,429 INFO L124 PetriNetUnfolderBase]: 5295/8954 cut-off events. [2024-06-28 01:26:22,429 INFO L125 PetriNetUnfolderBase]: For 123252/123335 co-relation queries the response was YES. [2024-06-28 01:26:22,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43901 conditions, 8954 events. 5295/8954 cut-off events. For 123252/123335 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 61970 event pairs, 2309 based on Foata normal form. 23/8619 useless extension candidates. Maximal degree in co-relation 43841. Up to 7423 conditions per place. [2024-06-28 01:26:22,514 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 222 selfloop transitions, 25 changer transitions 0/278 dead transitions. [2024-06-28 01:26:22,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 278 transitions, 3261 flow [2024-06-28 01:26:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:26:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:26:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-28 01:26:22,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276967930029155 [2024-06-28 01:26:22,516 INFO L175 Difference]: Start difference. First operand has 142 places, 236 transitions, 2479 flow. Second operand 7 states and 181 transitions. [2024-06-28 01:26:22,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 278 transitions, 3261 flow [2024-06-28 01:26:22,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 278 transitions, 3056 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-28 01:26:22,673 INFO L231 Difference]: Finished difference. Result has 147 places, 252 transitions, 2585 flow [2024-06-28 01:26:22,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2283, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2585, PETRI_PLACES=147, PETRI_TRANSITIONS=252} [2024-06-28 01:26:22,673 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 92 predicate places. [2024-06-28 01:26:22,673 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 252 transitions, 2585 flow [2024-06-28 01:26:22,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:22,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:22,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:22,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 01:26:22,674 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:22,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash -617250256, now seen corresponding path program 5 times [2024-06-28 01:26:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:22,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950883748] [2024-06-28 01:26:22,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:22,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:23,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:23,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950883748] [2024-06-28 01:26:23,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950883748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:23,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:23,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:26:23,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604734617] [2024-06-28 01:26:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:23,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:26:23,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:23,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:26:23,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:26:23,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:26:23,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 252 transitions, 2585 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:23,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:23,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:26:23,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:25,334 INFO L124 PetriNetUnfolderBase]: 6122/9617 cut-off events. [2024-06-28 01:26:25,334 INFO L125 PetriNetUnfolderBase]: For 126235/126240 co-relation queries the response was YES. [2024-06-28 01:26:25,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47848 conditions, 9617 events. 6122/9617 cut-off events. For 126235/126240 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 61021 event pairs, 1536 based on Foata normal form. 6/9472 useless extension candidates. Maximal degree in co-relation 47786. Up to 6944 conditions per place. [2024-06-28 01:26:25,422 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 163 selfloop transitions, 156 changer transitions 0/329 dead transitions. [2024-06-28 01:26:25,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 329 transitions, 3785 flow [2024-06-28 01:26:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:26:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:26:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-06-28 01:26:25,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5419501133786848 [2024-06-28 01:26:25,424 INFO L175 Difference]: Start difference. First operand has 147 places, 252 transitions, 2585 flow. Second operand 9 states and 239 transitions. [2024-06-28 01:26:25,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 329 transitions, 3785 flow [2024-06-28 01:26:25,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 329 transitions, 3730 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-28 01:26:25,632 INFO L231 Difference]: Finished difference. Result has 153 places, 258 transitions, 2955 flow [2024-06-28 01:26:25,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2530, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2955, PETRI_PLACES=153, PETRI_TRANSITIONS=258} [2024-06-28 01:26:25,633 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 98 predicate places. [2024-06-28 01:26:25,633 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 258 transitions, 2955 flow [2024-06-28 01:26:25,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:25,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:25,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:25,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 01:26:25,634 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:25,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:25,634 INFO L85 PathProgramCache]: Analyzing trace with hash 18101349, now seen corresponding path program 2 times [2024-06-28 01:26:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:25,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89318151] [2024-06-28 01:26:25,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:25,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:26,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:26,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89318151] [2024-06-28 01:26:26,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89318151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:26,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:26,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:26:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029912363] [2024-06-28 01:26:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:26,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:26:26,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:26,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:26:26,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:26:26,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:26:26,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 258 transitions, 2955 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:26,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:26,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:26:26,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:27,756 INFO L124 PetriNetUnfolderBase]: 5348/9057 cut-off events. [2024-06-28 01:26:27,756 INFO L125 PetriNetUnfolderBase]: For 144599/144692 co-relation queries the response was YES. [2024-06-28 01:26:27,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46182 conditions, 9057 events. 5348/9057 cut-off events. For 144599/144692 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 62895 event pairs, 2271 based on Foata normal form. 27/8709 useless extension candidates. Maximal degree in co-relation 46119. Up to 7492 conditions per place. [2024-06-28 01:26:27,818 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 226 selfloop transitions, 27 changer transitions 0/284 dead transitions. [2024-06-28 01:26:27,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 284 transitions, 3581 flow [2024-06-28 01:26:27,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:26:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:26:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-28 01:26:27,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49854227405247814 [2024-06-28 01:26:27,822 INFO L175 Difference]: Start difference. First operand has 153 places, 258 transitions, 2955 flow. Second operand 7 states and 171 transitions. [2024-06-28 01:26:27,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 284 transitions, 3581 flow [2024-06-28 01:26:27,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 284 transitions, 3269 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-28 01:26:27,979 INFO L231 Difference]: Finished difference. Result has 153 places, 265 transitions, 2771 flow [2024-06-28 01:26:27,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2643, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2771, PETRI_PLACES=153, PETRI_TRANSITIONS=265} [2024-06-28 01:26:27,981 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 98 predicate places. [2024-06-28 01:26:27,981 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 265 transitions, 2771 flow [2024-06-28 01:26:27,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:27,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:27,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:27,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 01:26:27,982 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:27,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:27,982 INFO L85 PathProgramCache]: Analyzing trace with hash -990530520, now seen corresponding path program 3 times [2024-06-28 01:26:27,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:27,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043066663] [2024-06-28 01:26:27,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:27,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:29,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:29,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043066663] [2024-06-28 01:26:29,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043066663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:29,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:29,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:26:29,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931283677] [2024-06-28 01:26:29,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:29,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:26:29,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:29,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:26:29,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:26:29,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:26:29,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 265 transitions, 2771 flow. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:29,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:29,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:26:29,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:30,995 INFO L124 PetriNetUnfolderBase]: 5879/9721 cut-off events. [2024-06-28 01:26:30,995 INFO L125 PetriNetUnfolderBase]: For 140790/140820 co-relation queries the response was YES. [2024-06-28 01:26:31,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48217 conditions, 9721 events. 5879/9721 cut-off events. For 140790/140820 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 66409 event pairs, 2311 based on Foata normal form. 27/9446 useless extension candidates. Maximal degree in co-relation 48154. Up to 8010 conditions per place. [2024-06-28 01:26:31,086 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 225 selfloop transitions, 74 changer transitions 0/323 dead transitions. [2024-06-28 01:26:31,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 323 transitions, 3788 flow [2024-06-28 01:26:31,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:26:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:26:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-06-28 01:26:31,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2024-06-28 01:26:31,088 INFO L175 Difference]: Start difference. First operand has 153 places, 265 transitions, 2771 flow. Second operand 9 states and 222 transitions. [2024-06-28 01:26:31,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 323 transitions, 3788 flow [2024-06-28 01:26:31,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 323 transitions, 3735 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-28 01:26:31,270 INFO L231 Difference]: Finished difference. Result has 160 places, 278 transitions, 3111 flow [2024-06-28 01:26:31,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3111, PETRI_PLACES=160, PETRI_TRANSITIONS=278} [2024-06-28 01:26:31,270 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 105 predicate places. [2024-06-28 01:26:31,271 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 278 transitions, 3111 flow [2024-06-28 01:26:31,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:31,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:31,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:31,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 01:26:31,271 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:31,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash -990174330, now seen corresponding path program 4 times [2024-06-28 01:26:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:31,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067551077] [2024-06-28 01:26:31,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:31,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:32,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067551077] [2024-06-28 01:26:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067551077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:32,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:32,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:26:32,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795604364] [2024-06-28 01:26:32,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:32,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:26:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:32,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:26:32,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:26:32,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:26:32,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 278 transitions, 3111 flow. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:32,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:32,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:26:32,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:33,900 INFO L124 PetriNetUnfolderBase]: 5928/9773 cut-off events. [2024-06-28 01:26:33,900 INFO L125 PetriNetUnfolderBase]: For 155949/155979 co-relation queries the response was YES. [2024-06-28 01:26:33,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50224 conditions, 9773 events. 5928/9773 cut-off events. For 155949/155979 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 66576 event pairs, 2250 based on Foata normal form. 27/9472 useless extension candidates. Maximal degree in co-relation 50159. Up to 7851 conditions per place. [2024-06-28 01:26:33,984 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 220 selfloop transitions, 85 changer transitions 0/329 dead transitions. [2024-06-28 01:26:33,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 329 transitions, 4113 flow [2024-06-28 01:26:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:26:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:26:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-06-28 01:26:33,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-28 01:26:33,986 INFO L175 Difference]: Start difference. First operand has 160 places, 278 transitions, 3111 flow. Second operand 9 states and 225 transitions. [2024-06-28 01:26:33,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 329 transitions, 4113 flow [2024-06-28 01:26:34,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 329 transitions, 4006 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-28 01:26:34,190 INFO L231 Difference]: Finished difference. Result has 166 places, 282 transitions, 3281 flow [2024-06-28 01:26:34,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3004, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3281, PETRI_PLACES=166, PETRI_TRANSITIONS=282} [2024-06-28 01:26:34,191 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 111 predicate places. [2024-06-28 01:26:34,191 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 282 transitions, 3281 flow [2024-06-28 01:26:34,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:34,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:34,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:34,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 01:26:34,191 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:34,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:34,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1962895942, now seen corresponding path program 5 times [2024-06-28 01:26:34,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:34,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671251037] [2024-06-28 01:26:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:34,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:35,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:35,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671251037] [2024-06-28 01:26:35,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671251037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:35,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:35,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:26:35,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104434240] [2024-06-28 01:26:35,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:35,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:26:35,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:35,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:26:35,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:26:35,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:26:35,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 282 transitions, 3281 flow. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:35,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:35,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:26:35,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:36,869 INFO L124 PetriNetUnfolderBase]: 5902/9767 cut-off events. [2024-06-28 01:26:36,870 INFO L125 PetriNetUnfolderBase]: For 159877/159907 co-relation queries the response was YES. [2024-06-28 01:26:36,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48913 conditions, 9767 events. 5902/9767 cut-off events. For 159877/159907 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 66803 event pairs, 2333 based on Foata normal form. 27/9473 useless extension candidates. Maximal degree in co-relation 48847. Up to 8049 conditions per place. [2024-06-28 01:26:36,946 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 233 selfloop transitions, 69 changer transitions 0/326 dead transitions. [2024-06-28 01:26:36,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 326 transitions, 4093 flow [2024-06-28 01:26:36,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:26:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:26:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-06-28 01:26:36,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280612244897959 [2024-06-28 01:26:36,948 INFO L175 Difference]: Start difference. First operand has 166 places, 282 transitions, 3281 flow. Second operand 8 states and 207 transitions. [2024-06-28 01:26:36,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 326 transitions, 4093 flow [2024-06-28 01:26:37,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 326 transitions, 3932 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-06-28 01:26:37,147 INFO L231 Difference]: Finished difference. Result has 169 places, 282 transitions, 3266 flow [2024-06-28 01:26:37,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3120, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3266, PETRI_PLACES=169, PETRI_TRANSITIONS=282} [2024-06-28 01:26:37,148 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 114 predicate places. [2024-06-28 01:26:37,148 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 282 transitions, 3266 flow [2024-06-28 01:26:37,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:37,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:37,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:37,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 01:26:37,149 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:37,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:37,149 INFO L85 PathProgramCache]: Analyzing trace with hash -326265002, now seen corresponding path program 6 times [2024-06-28 01:26:37,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:37,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414471455] [2024-06-28 01:26:37,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:37,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:38,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-28 01:26:38,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:38,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414471455] [2024-06-28 01:26:38,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414471455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:38,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:38,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:26:38,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504131172] [2024-06-28 01:26:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:38,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:26:38,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:38,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:26:38,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:26:38,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:26:38,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 282 transitions, 3266 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:38,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:38,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:26:38,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:40,017 INFO L124 PetriNetUnfolderBase]: 6248/10045 cut-off events. [2024-06-28 01:26:40,018 INFO L125 PetriNetUnfolderBase]: For 158993/158995 co-relation queries the response was YES. [2024-06-28 01:26:40,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50480 conditions, 10045 events. 6248/10045 cut-off events. For 158993/158995 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 65878 event pairs, 1612 based on Foata normal form. 6/9794 useless extension candidates. Maximal degree in co-relation 50412. Up to 7103 conditions per place. [2024-06-28 01:26:40,149 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 177 selfloop transitions, 157 changer transitions 0/344 dead transitions. [2024-06-28 01:26:40,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 344 transitions, 4246 flow [2024-06-28 01:26:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:26:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:26:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-06-28 01:26:40,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528344671201814 [2024-06-28 01:26:40,151 INFO L175 Difference]: Start difference. First operand has 169 places, 282 transitions, 3266 flow. Second operand 9 states and 233 transitions. [2024-06-28 01:26:40,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 344 transitions, 4246 flow [2024-06-28 01:26:40,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 344 transitions, 4002 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-28 01:26:40,379 INFO L231 Difference]: Finished difference. Result has 170 places, 282 transitions, 3347 flow [2024-06-28 01:26:40,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3022, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3347, PETRI_PLACES=170, PETRI_TRANSITIONS=282} [2024-06-28 01:26:40,379 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 115 predicate places. [2024-06-28 01:26:40,380 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 282 transitions, 3347 flow [2024-06-28 01:26:40,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:40,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:40,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:40,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 01:26:40,380 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:40,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:40,381 INFO L85 PathProgramCache]: Analyzing trace with hash 31463589, now seen corresponding path program 3 times [2024-06-28 01:26:40,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:40,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455208540] [2024-06-28 01:26:40,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:40,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:41,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455208540] [2024-06-28 01:26:41,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455208540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:41,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:41,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:26:41,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113316950] [2024-06-28 01:26:41,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:41,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:26:41,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:41,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:26:41,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:26:41,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:26:41,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 282 transitions, 3347 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:41,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:41,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:26:41,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:42,675 INFO L124 PetriNetUnfolderBase]: 5465/9125 cut-off events. [2024-06-28 01:26:42,675 INFO L125 PetriNetUnfolderBase]: For 172139/172253 co-relation queries the response was YES. [2024-06-28 01:26:42,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47472 conditions, 9125 events. 5465/9125 cut-off events. For 172139/172253 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 62329 event pairs, 2279 based on Foata normal form. 30/8762 useless extension candidates. Maximal degree in co-relation 47404. Up to 7604 conditions per place. [2024-06-28 01:26:42,763 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 237 selfloop transitions, 35 changer transitions 0/303 dead transitions. [2024-06-28 01:26:42,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 303 transitions, 4005 flow [2024-06-28 01:26:42,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:26:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:26:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-06-28 01:26:42,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49271137026239065 [2024-06-28 01:26:42,765 INFO L175 Difference]: Start difference. First operand has 170 places, 282 transitions, 3347 flow. Second operand 7 states and 169 transitions. [2024-06-28 01:26:42,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 303 transitions, 4005 flow [2024-06-28 01:26:42,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 303 transitions, 3484 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-28 01:26:42,914 INFO L231 Difference]: Finished difference. Result has 167 places, 285 transitions, 2954 flow [2024-06-28 01:26:42,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2826, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2954, PETRI_PLACES=167, PETRI_TRANSITIONS=285} [2024-06-28 01:26:42,914 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 112 predicate places. [2024-06-28 01:26:42,914 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 285 transitions, 2954 flow [2024-06-28 01:26:42,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:42,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:42,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:42,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 01:26:42,915 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:42,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:42,915 INFO L85 PathProgramCache]: Analyzing trace with hash 25727845, now seen corresponding path program 1 times [2024-06-28 01:26:42,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:42,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524959670] [2024-06-28 01:26:42,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:42,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:43,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:43,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524959670] [2024-06-28 01:26:43,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524959670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:43,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:43,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:26:43,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199356667] [2024-06-28 01:26:43,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:43,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:26:43,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:43,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:26:43,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:26:43,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:26:43,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 285 transitions, 2954 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:43,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:43,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:26:43,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:45,007 INFO L124 PetriNetUnfolderBase]: 5354/9043 cut-off events. [2024-06-28 01:26:45,008 INFO L125 PetriNetUnfolderBase]: For 145626/145654 co-relation queries the response was YES. [2024-06-28 01:26:45,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44894 conditions, 9043 events. 5354/9043 cut-off events. For 145626/145654 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 63024 event pairs, 2312 based on Foata normal form. 28/8801 useless extension candidates. Maximal degree in co-relation 44825. Up to 7533 conditions per place. [2024-06-28 01:26:45,104 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 273 selfloop transitions, 14 changer transitions 0/312 dead transitions. [2024-06-28 01:26:45,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 312 transitions, 3681 flow [2024-06-28 01:26:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:26:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:26:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-06-28 01:26:45,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2024-06-28 01:26:45,105 INFO L175 Difference]: Start difference. First operand has 167 places, 285 transitions, 2954 flow. Second operand 6 states and 153 transitions. [2024-06-28 01:26:45,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 312 transitions, 3681 flow [2024-06-28 01:26:45,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 312 transitions, 3575 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-28 01:26:45,302 INFO L231 Difference]: Finished difference. Result has 169 places, 292 transitions, 2980 flow [2024-06-28 01:26:45,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2848, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2980, PETRI_PLACES=169, PETRI_TRANSITIONS=292} [2024-06-28 01:26:45,302 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 114 predicate places. [2024-06-28 01:26:45,303 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 292 transitions, 2980 flow [2024-06-28 01:26:45,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:45,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:45,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:45,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 01:26:45,303 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:45,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash 31471525, now seen corresponding path program 2 times [2024-06-28 01:26:45,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:45,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67465329] [2024-06-28 01:26:45,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:45,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:46,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:46,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67465329] [2024-06-28 01:26:46,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67465329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:46,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:46,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:26:46,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160433132] [2024-06-28 01:26:46,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:46,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:26:46,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:46,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:26:46,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:26:46,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:26:46,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 292 transitions, 2980 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:46,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:46,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:26:46,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:47,436 INFO L124 PetriNetUnfolderBase]: 5376/9159 cut-off events. [2024-06-28 01:26:47,436 INFO L125 PetriNetUnfolderBase]: For 153245/153279 co-relation queries the response was YES. [2024-06-28 01:26:47,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46133 conditions, 9159 events. 5376/9159 cut-off events. For 153245/153279 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 64494 event pairs, 2308 based on Foata normal form. 32/8899 useless extension candidates. Maximal degree in co-relation 46062. Up to 7528 conditions per place. [2024-06-28 01:26:47,500 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 271 selfloop transitions, 19 changer transitions 0/315 dead transitions. [2024-06-28 01:26:47,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 315 transitions, 3682 flow [2024-06-28 01:26:47,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:26:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:26:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-06-28 01:26:47,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 01:26:47,506 INFO L175 Difference]: Start difference. First operand has 169 places, 292 transitions, 2980 flow. Second operand 6 states and 154 transitions. [2024-06-28 01:26:47,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 315 transitions, 3682 flow [2024-06-28 01:26:47,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 315 transitions, 3627 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-28 01:26:47,689 INFO L231 Difference]: Finished difference. Result has 172 places, 295 transitions, 3017 flow [2024-06-28 01:26:47,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2925, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3017, PETRI_PLACES=172, PETRI_TRANSITIONS=295} [2024-06-28 01:26:47,690 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 117 predicate places. [2024-06-28 01:26:47,690 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 295 transitions, 3017 flow [2024-06-28 01:26:47,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:47,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:47,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:47,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 01:26:47,691 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:47,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:47,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1787735252, now seen corresponding path program 1 times [2024-06-28 01:26:47,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:47,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424171285] [2024-06-28 01:26:47,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:47,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:48,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:48,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424171285] [2024-06-28 01:26:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424171285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:48,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:48,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:26:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582124705] [2024-06-28 01:26:48,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:48,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:26:48,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:48,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:26:48,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:26:48,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:26:48,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 295 transitions, 3017 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:48,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:48,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:26:48,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:50,657 INFO L124 PetriNetUnfolderBase]: 6517/10684 cut-off events. [2024-06-28 01:26:50,657 INFO L125 PetriNetUnfolderBase]: For 190482/190496 co-relation queries the response was YES. [2024-06-28 01:26:50,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54929 conditions, 10684 events. 6517/10684 cut-off events. For 190482/190496 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 72799 event pairs, 2252 based on Foata normal form. 11/10424 useless extension candidates. Maximal degree in co-relation 54857. Up to 8405 conditions per place. [2024-06-28 01:26:50,773 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 244 selfloop transitions, 133 changer transitions 0/387 dead transitions. [2024-06-28 01:26:50,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 387 transitions, 4310 flow [2024-06-28 01:26:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:26:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:26:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 259 transitions. [2024-06-28 01:26:50,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 01:26:50,778 INFO L175 Difference]: Start difference. First operand has 172 places, 295 transitions, 3017 flow. Second operand 10 states and 259 transitions. [2024-06-28 01:26:50,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 387 transitions, 4310 flow [2024-06-28 01:26:51,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 387 transitions, 4240 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-28 01:26:51,023 INFO L231 Difference]: Finished difference. Result has 181 places, 323 transitions, 3604 flow [2024-06-28 01:26:51,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2947, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3604, PETRI_PLACES=181, PETRI_TRANSITIONS=323} [2024-06-28 01:26:51,024 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 126 predicate places. [2024-06-28 01:26:51,025 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 323 transitions, 3604 flow [2024-06-28 01:26:51,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:51,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:51,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:51,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 01:26:51,025 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:51,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1979575847, now seen corresponding path program 1 times [2024-06-28 01:26:51,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:51,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883665824] [2024-06-28 01:26:51,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:51,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:51,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:51,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883665824] [2024-06-28 01:26:51,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883665824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:51,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:51,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:26:51,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130279173] [2024-06-28 01:26:51,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:51,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:26:51,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:51,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:26:51,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:26:51,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:26:51,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 323 transitions, 3604 flow. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:51,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:51,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:26:51,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:53,337 INFO L124 PetriNetUnfolderBase]: 6051/10057 cut-off events. [2024-06-28 01:26:53,338 INFO L125 PetriNetUnfolderBase]: For 208697/208750 co-relation queries the response was YES. [2024-06-28 01:26:53,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55695 conditions, 10057 events. 6051/10057 cut-off events. For 208697/208750 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 68903 event pairs, 2278 based on Foata normal form. 16/9776 useless extension candidates. Maximal degree in co-relation 55619. Up to 8464 conditions per place. [2024-06-28 01:26:53,430 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 319 selfloop transitions, 42 changer transitions 0/378 dead transitions. [2024-06-28 01:26:53,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 378 transitions, 4731 flow [2024-06-28 01:26:53,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:26:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:26:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-06-28 01:26:53,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2024-06-28 01:26:53,432 INFO L175 Difference]: Start difference. First operand has 181 places, 323 transitions, 3604 flow. Second operand 8 states and 202 transitions. [2024-06-28 01:26:53,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 378 transitions, 4731 flow [2024-06-28 01:26:53,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 378 transitions, 4481 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-28 01:26:53,690 INFO L231 Difference]: Finished difference. Result has 186 places, 344 transitions, 3786 flow [2024-06-28 01:26:53,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3366, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3786, PETRI_PLACES=186, PETRI_TRANSITIONS=344} [2024-06-28 01:26:53,691 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 131 predicate places. [2024-06-28 01:26:53,691 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 344 transitions, 3786 flow [2024-06-28 01:26:53,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:53,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:53,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:53,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 01:26:53,691 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:53,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:53,692 INFO L85 PathProgramCache]: Analyzing trace with hash -759815256, now seen corresponding path program 2 times [2024-06-28 01:26:53,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:53,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917454776] [2024-06-28 01:26:53,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:53,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917454776] [2024-06-28 01:26:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917454776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:26:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795835274] [2024-06-28 01:26:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:54,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:26:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:26:54,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:26:54,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:26:54,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 344 transitions, 3786 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:54,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:54,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:26:54,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:26:56,699 INFO L124 PetriNetUnfolderBase]: 6602/10759 cut-off events. [2024-06-28 01:26:56,699 INFO L125 PetriNetUnfolderBase]: For 219907/219921 co-relation queries the response was YES. [2024-06-28 01:26:56,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59353 conditions, 10759 events. 6602/10759 cut-off events. For 219907/219921 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 72762 event pairs, 2237 based on Foata normal form. 11/10503 useless extension candidates. Maximal degree in co-relation 59275. Up to 8502 conditions per place. [2024-06-28 01:26:56,803 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 266 selfloop transitions, 147 changer transitions 0/423 dead transitions. [2024-06-28 01:26:56,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 423 transitions, 5102 flow [2024-06-28 01:26:56,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:26:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:26:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 259 transitions. [2024-06-28 01:26:56,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 01:26:56,805 INFO L175 Difference]: Start difference. First operand has 186 places, 344 transitions, 3786 flow. Second operand 10 states and 259 transitions. [2024-06-28 01:26:56,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 423 transitions, 5102 flow [2024-06-28 01:26:57,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 423 transitions, 4977 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-06-28 01:26:57,078 INFO L231 Difference]: Finished difference. Result has 193 places, 354 transitions, 4115 flow [2024-06-28 01:26:57,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3679, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4115, PETRI_PLACES=193, PETRI_TRANSITIONS=354} [2024-06-28 01:26:57,079 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 138 predicate places. [2024-06-28 01:26:57,079 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 354 transitions, 4115 flow [2024-06-28 01:26:57,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:57,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:26:57,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:26:57,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 01:26:57,080 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:26:57,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:26:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2047697278, now seen corresponding path program 3 times [2024-06-28 01:26:57,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:26:57,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330644885] [2024-06-28 01:26:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:26:57,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:26:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:26:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:26:58,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:26:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330644885] [2024-06-28 01:26:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330644885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:26:58,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:26:58,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:26:58,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417838709] [2024-06-28 01:26:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:26:58,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:26:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:26:58,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:26:58,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:26:58,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:26:58,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 354 transitions, 4115 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:26:58,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:26:58,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:26:58,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:00,079 INFO L124 PetriNetUnfolderBase]: 6681/10889 cut-off events. [2024-06-28 01:27:00,079 INFO L125 PetriNetUnfolderBase]: For 237691/237699 co-relation queries the response was YES. [2024-06-28 01:27:00,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62402 conditions, 10889 events. 6681/10889 cut-off events. For 237691/237699 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 73815 event pairs, 2246 based on Foata normal form. 5/10629 useless extension candidates. Maximal degree in co-relation 62322. Up to 8627 conditions per place. [2024-06-28 01:27:00,186 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 272 selfloop transitions, 154 changer transitions 0/436 dead transitions. [2024-06-28 01:27:00,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 436 transitions, 5566 flow [2024-06-28 01:27:00,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:27:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:27:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 258 transitions. [2024-06-28 01:27:00,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2024-06-28 01:27:00,188 INFO L175 Difference]: Start difference. First operand has 193 places, 354 transitions, 4115 flow. Second operand 10 states and 258 transitions. [2024-06-28 01:27:00,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 436 transitions, 5566 flow [2024-06-28 01:27:00,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 436 transitions, 5223 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-28 01:27:00,562 INFO L231 Difference]: Finished difference. Result has 197 places, 367 transitions, 4340 flow [2024-06-28 01:27:00,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3792, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4340, PETRI_PLACES=197, PETRI_TRANSITIONS=367} [2024-06-28 01:27:00,568 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 142 predicate places. [2024-06-28 01:27:00,568 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 367 transitions, 4340 flow [2024-06-28 01:27:00,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:00,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:00,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:00,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 01:27:00,569 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:00,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash 299822648, now seen corresponding path program 4 times [2024-06-28 01:27:00,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:00,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55787813] [2024-06-28 01:27:00,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:00,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:01,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:01,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55787813] [2024-06-28 01:27:01,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55787813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:01,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:01,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:27:01,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972488649] [2024-06-28 01:27:01,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:01,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:27:01,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:01,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:27:01,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:27:01,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:27:01,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 367 transitions, 4340 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:01,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:01,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:27:01,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:03,809 INFO L124 PetriNetUnfolderBase]: 6763/11082 cut-off events. [2024-06-28 01:27:03,810 INFO L125 PetriNetUnfolderBase]: For 256555/256563 co-relation queries the response was YES. [2024-06-28 01:27:03,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64750 conditions, 11082 events. 6763/11082 cut-off events. For 256555/256563 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 75775 event pairs, 2205 based on Foata normal form. 5/10802 useless extension candidates. Maximal degree in co-relation 64668. Up to 8484 conditions per place. [2024-06-28 01:27:03,955 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 266 selfloop transitions, 166 changer transitions 0/442 dead transitions. [2024-06-28 01:27:03,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 442 transitions, 5821 flow [2024-06-28 01:27:03,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:27:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:27:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 261 transitions. [2024-06-28 01:27:03,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5326530612244897 [2024-06-28 01:27:03,957 INFO L175 Difference]: Start difference. First operand has 197 places, 367 transitions, 4340 flow. Second operand 10 states and 261 transitions. [2024-06-28 01:27:03,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 442 transitions, 5821 flow [2024-06-28 01:27:04,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 442 transitions, 5568 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-28 01:27:04,338 INFO L231 Difference]: Finished difference. Result has 202 places, 371 transitions, 4547 flow [2024-06-28 01:27:04,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4095, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4547, PETRI_PLACES=202, PETRI_TRANSITIONS=371} [2024-06-28 01:27:04,338 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 147 predicate places. [2024-06-28 01:27:04,339 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 371 transitions, 4547 flow [2024-06-28 01:27:04,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:04,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:04,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:04,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 01:27:04,339 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:04,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash 292404038, now seen corresponding path program 5 times [2024-06-28 01:27:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:04,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228655472] [2024-06-28 01:27:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:05,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:05,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228655472] [2024-06-28 01:27:05,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228655472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:05,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:05,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:27:05,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867300373] [2024-06-28 01:27:05,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:05,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:27:05,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:05,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:27:05,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:27:05,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:27:05,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 371 transitions, 4547 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:05,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:05,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:27:05,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:07,360 INFO L124 PetriNetUnfolderBase]: 6755/11038 cut-off events. [2024-06-28 01:27:07,361 INFO L125 PetriNetUnfolderBase]: For 263233/263241 co-relation queries the response was YES. [2024-06-28 01:27:07,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63800 conditions, 11038 events. 6755/11038 cut-off events. For 263233/263241 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 75259 event pairs, 2280 based on Foata normal form. 5/10768 useless extension candidates. Maximal degree in co-relation 63718. Up to 8737 conditions per place. [2024-06-28 01:27:07,515 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 278 selfloop transitions, 151 changer transitions 0/439 dead transitions. [2024-06-28 01:27:07,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 439 transitions, 5776 flow [2024-06-28 01:27:07,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:27:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:27:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 259 transitions. [2024-06-28 01:27:07,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 01:27:07,516 INFO L175 Difference]: Start difference. First operand has 202 places, 371 transitions, 4547 flow. Second operand 10 states and 259 transitions. [2024-06-28 01:27:07,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 439 transitions, 5776 flow [2024-06-28 01:27:07,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 439 transitions, 5511 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-06-28 01:27:07,925 INFO L231 Difference]: Finished difference. Result has 206 places, 371 transitions, 4592 flow [2024-06-28 01:27:07,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4282, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4592, PETRI_PLACES=206, PETRI_TRANSITIONS=371} [2024-06-28 01:27:07,926 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 151 predicate places. [2024-06-28 01:27:07,926 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 371 transitions, 4592 flow [2024-06-28 01:27:07,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:07,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:07,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:07,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 01:27:07,927 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:07,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:07,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1311283985, now seen corresponding path program 2 times [2024-06-28 01:27:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:07,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823104963] [2024-06-28 01:27:07,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:08,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-28 01:27:08,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:08,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823104963] [2024-06-28 01:27:08,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823104963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:08,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:08,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:27:08,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986555973] [2024-06-28 01:27:08,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:08,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:27:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:08,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:27:08,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:27:08,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:27:08,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 371 transitions, 4592 flow. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:08,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:08,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:27:08,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:10,367 INFO L124 PetriNetUnfolderBase]: 6306/10466 cut-off events. [2024-06-28 01:27:10,368 INFO L125 PetriNetUnfolderBase]: For 272778/272829 co-relation queries the response was YES. [2024-06-28 01:27:10,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62193 conditions, 10466 events. 6306/10466 cut-off events. For 272778/272829 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 71998 event pairs, 2271 based on Foata normal form. 18/10159 useless extension candidates. Maximal degree in co-relation 62109. Up to 8828 conditions per place. [2024-06-28 01:27:10,480 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 348 selfloop transitions, 46 changer transitions 0/411 dead transitions. [2024-06-28 01:27:10,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 411 transitions, 5584 flow [2024-06-28 01:27:10,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:27:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:27:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-06-28 01:27:10,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2024-06-28 01:27:10,482 INFO L175 Difference]: Start difference. First operand has 206 places, 371 transitions, 4592 flow. Second operand 8 states and 202 transitions. [2024-06-28 01:27:10,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 411 transitions, 5584 flow [2024-06-28 01:27:10,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 411 transitions, 5210 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-28 01:27:10,826 INFO L231 Difference]: Finished difference. Result has 205 places, 379 transitions, 4408 flow [2024-06-28 01:27:10,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4218, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4408, PETRI_PLACES=205, PETRI_TRANSITIONS=379} [2024-06-28 01:27:10,827 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 150 predicate places. [2024-06-28 01:27:10,827 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 379 transitions, 4408 flow [2024-06-28 01:27:10,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:10,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:10,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:10,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 01:27:10,828 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:10,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash -637052585, now seen corresponding path program 3 times [2024-06-28 01:27:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:10,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116577833] [2024-06-28 01:27:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:11,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116577833] [2024-06-28 01:27:11,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116577833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:11,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:11,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:27:11,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159523724] [2024-06-28 01:27:11,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:11,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:27:11,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:11,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:27:11,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:27:11,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:27:11,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 379 transitions, 4408 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:11,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:11,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:27:11,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:13,215 INFO L124 PetriNetUnfolderBase]: 6323/10498 cut-off events. [2024-06-28 01:27:13,216 INFO L125 PetriNetUnfolderBase]: For 281059/281108 co-relation queries the response was YES. [2024-06-28 01:27:13,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62343 conditions, 10498 events. 6323/10498 cut-off events. For 281059/281108 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 72215 event pairs, 2263 based on Foata normal form. 12/10193 useless extension candidates. Maximal degree in co-relation 62258. Up to 8807 conditions per place. [2024-06-28 01:27:13,337 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 340 selfloop transitions, 56 changer transitions 0/413 dead transitions. [2024-06-28 01:27:13,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 413 transitions, 5396 flow [2024-06-28 01:27:13,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:27:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:27:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-06-28 01:27:13,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-28 01:27:13,338 INFO L175 Difference]: Start difference. First operand has 205 places, 379 transitions, 4408 flow. Second operand 8 states and 200 transitions. [2024-06-28 01:27:13,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 413 transitions, 5396 flow [2024-06-28 01:27:13,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 413 transitions, 5305 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-28 01:27:13,736 INFO L231 Difference]: Finished difference. Result has 210 places, 382 transitions, 4504 flow [2024-06-28 01:27:13,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4317, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4504, PETRI_PLACES=210, PETRI_TRANSITIONS=382} [2024-06-28 01:27:13,737 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 155 predicate places. [2024-06-28 01:27:13,737 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 382 transitions, 4504 flow [2024-06-28 01:27:13,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:13,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:13,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:13,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 01:27:13,738 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:13,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:13,738 INFO L85 PathProgramCache]: Analyzing trace with hash -637052120, now seen corresponding path program 1 times [2024-06-28 01:27:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:13,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377515659] [2024-06-28 01:27:13,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:14,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:14,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377515659] [2024-06-28 01:27:14,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377515659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:14,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:14,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:27:14,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460476488] [2024-06-28 01:27:14,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:14,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:27:14,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:14,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:27:14,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:27:14,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:27:14,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 382 transitions, 4504 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:14,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:14,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:27:14,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:16,270 INFO L124 PetriNetUnfolderBase]: 5964/10082 cut-off events. [2024-06-28 01:27:16,270 INFO L125 PetriNetUnfolderBase]: For 286042/286113 co-relation queries the response was YES. [2024-06-28 01:27:16,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59886 conditions, 10082 events. 5964/10082 cut-off events. For 286042/286113 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 71118 event pairs, 2330 based on Foata normal form. 26/9769 useless extension candidates. Maximal degree in co-relation 59800. Up to 8226 conditions per place. [2024-06-28 01:27:16,384 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 324 selfloop transitions, 32 changer transitions 0/416 dead transitions. [2024-06-28 01:27:16,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 416 transitions, 5400 flow [2024-06-28 01:27:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:27:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:27:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-06-28 01:27:16,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2024-06-28 01:27:16,386 INFO L175 Difference]: Start difference. First operand has 210 places, 382 transitions, 4504 flow. Second operand 8 states and 204 transitions. [2024-06-28 01:27:16,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 416 transitions, 5400 flow [2024-06-28 01:27:16,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 416 transitions, 5237 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-28 01:27:16,926 INFO L231 Difference]: Finished difference. Result has 212 places, 385 transitions, 4468 flow [2024-06-28 01:27:16,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4341, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4468, PETRI_PLACES=212, PETRI_TRANSITIONS=385} [2024-06-28 01:27:16,926 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 157 predicate places. [2024-06-28 01:27:16,926 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 385 transitions, 4468 flow [2024-06-28 01:27:16,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:16,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:16,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:16,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 01:27:16,927 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:16,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1288076556, now seen corresponding path program 6 times [2024-06-28 01:27:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:16,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013359281] [2024-06-28 01:27:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:16,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:17,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:17,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013359281] [2024-06-28 01:27:17,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013359281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:17,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:17,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:27:17,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879844462] [2024-06-28 01:27:17,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:17,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:27:17,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:17,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:27:17,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:27:17,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:27:17,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 385 transitions, 4468 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:17,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:17,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:27:17,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:20,139 INFO L124 PetriNetUnfolderBase]: 6860/11186 cut-off events. [2024-06-28 01:27:20,139 INFO L125 PetriNetUnfolderBase]: For 303189/303203 co-relation queries the response was YES. [2024-06-28 01:27:20,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67110 conditions, 11186 events. 6860/11186 cut-off events. For 303189/303203 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 76211 event pairs, 2285 based on Foata normal form. 11/10926 useless extension candidates. Maximal degree in co-relation 67023. Up to 8783 conditions per place. [2024-06-28 01:27:20,247 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 277 selfloop transitions, 169 changer transitions 0/456 dead transitions. [2024-06-28 01:27:20,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 456 transitions, 5870 flow [2024-06-28 01:27:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:27:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:27:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 232 transitions. [2024-06-28 01:27:20,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260770975056689 [2024-06-28 01:27:20,248 INFO L175 Difference]: Start difference. First operand has 212 places, 385 transitions, 4468 flow. Second operand 9 states and 232 transitions. [2024-06-28 01:27:20,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 456 transitions, 5870 flow [2024-06-28 01:27:20,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 456 transitions, 5767 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-28 01:27:20,618 INFO L231 Difference]: Finished difference. Result has 216 places, 392 transitions, 4871 flow [2024-06-28 01:27:20,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4365, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4871, PETRI_PLACES=216, PETRI_TRANSITIONS=392} [2024-06-28 01:27:20,619 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 161 predicate places. [2024-06-28 01:27:20,619 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 392 transitions, 4871 flow [2024-06-28 01:27:20,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:20,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:20,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:20,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 01:27:20,619 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:20,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1947521606, now seen corresponding path program 7 times [2024-06-28 01:27:20,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:20,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656350071] [2024-06-28 01:27:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:20,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:21,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:21,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656350071] [2024-06-28 01:27:21,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656350071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:21,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:21,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:27:21,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655848368] [2024-06-28 01:27:21,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:21,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:27:21,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:21,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:27:21,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:27:21,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:27:21,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 392 transitions, 4871 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:21,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:21,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:27:21,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:24,195 INFO L124 PetriNetUnfolderBase]: 6969/11419 cut-off events. [2024-06-28 01:27:24,195 INFO L125 PetriNetUnfolderBase]: For 326323/326331 co-relation queries the response was YES. [2024-06-28 01:27:24,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70969 conditions, 11419 events. 6969/11419 cut-off events. For 326323/326331 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 78686 event pairs, 2254 based on Foata normal form. 5/11139 useless extension candidates. Maximal degree in co-relation 70880. Up to 8963 conditions per place. [2024-06-28 01:27:24,331 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 294 selfloop transitions, 179 changer transitions 0/483 dead transitions. [2024-06-28 01:27:24,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 483 transitions, 6687 flow [2024-06-28 01:27:24,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:27:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:27:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-06-28 01:27:24,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215419501133787 [2024-06-28 01:27:24,333 INFO L175 Difference]: Start difference. First operand has 216 places, 392 transitions, 4871 flow. Second operand 9 states and 230 transitions. [2024-06-28 01:27:24,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 483 transitions, 6687 flow [2024-06-28 01:27:24,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 483 transitions, 6259 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-28 01:27:24,853 INFO L231 Difference]: Finished difference. Result has 220 places, 415 transitions, 5260 flow [2024-06-28 01:27:24,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4491, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5260, PETRI_PLACES=220, PETRI_TRANSITIONS=415} [2024-06-28 01:27:24,854 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 165 predicate places. [2024-06-28 01:27:24,854 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 415 transitions, 5260 flow [2024-06-28 01:27:24,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:24,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:24,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:24,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 01:27:24,855 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:24,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1954671446, now seen corresponding path program 8 times [2024-06-28 01:27:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993593236] [2024-06-28 01:27:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:24,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:25,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:25,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993593236] [2024-06-28 01:27:25,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993593236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:25,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:25,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:27:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163413051] [2024-06-28 01:27:25,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:25,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:27:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:25,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:27:25,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:27:26,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:27:26,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 415 transitions, 5260 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:26,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:26,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:27:26,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:28,188 INFO L124 PetriNetUnfolderBase]: 7006/11455 cut-off events. [2024-06-28 01:27:28,189 INFO L125 PetriNetUnfolderBase]: For 315482/315490 co-relation queries the response was YES. [2024-06-28 01:27:28,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71497 conditions, 11455 events. 7006/11455 cut-off events. For 315482/315490 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 78687 event pairs, 2241 based on Foata normal form. 5/11175 useless extension candidates. Maximal degree in co-relation 71406. Up to 9018 conditions per place. [2024-06-28 01:27:28,320 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 296 selfloop transitions, 176 changer transitions 0/482 dead transitions. [2024-06-28 01:27:28,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 482 transitions, 6712 flow [2024-06-28 01:27:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:27:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:27:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-06-28 01:27:28,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 01:27:28,322 INFO L175 Difference]: Start difference. First operand has 220 places, 415 transitions, 5260 flow. Second operand 9 states and 231 transitions. [2024-06-28 01:27:28,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 482 transitions, 6712 flow [2024-06-28 01:27:28,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 482 transitions, 6420 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-28 01:27:28,844 INFO L231 Difference]: Finished difference. Result has 225 places, 417 transitions, 5404 flow [2024-06-28 01:27:28,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4976, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5404, PETRI_PLACES=225, PETRI_TRANSITIONS=417} [2024-06-28 01:27:28,845 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 170 predicate places. [2024-06-28 01:27:28,845 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 417 transitions, 5404 flow [2024-06-28 01:27:28,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:28,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:28,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:28,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 01:27:28,846 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:28,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:28,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1407579134, now seen corresponding path program 9 times [2024-06-28 01:27:28,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:28,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127842694] [2024-06-28 01:27:28,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:28,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:29,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127842694] [2024-06-28 01:27:29,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127842694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:29,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:29,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:27:29,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359924070] [2024-06-28 01:27:29,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:29,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:27:29,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:29,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:27:29,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:27:30,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:27:30,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 417 transitions, 5404 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:30,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:30,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:27:30,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:32,101 INFO L124 PetriNetUnfolderBase]: 7043/11538 cut-off events. [2024-06-28 01:27:32,102 INFO L125 PetriNetUnfolderBase]: For 315400/315408 co-relation queries the response was YES. [2024-06-28 01:27:32,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70819 conditions, 11538 events. 7043/11538 cut-off events. For 315400/315408 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 79499 event pairs, 2187 based on Foata normal form. 5/11253 useless extension candidates. Maximal degree in co-relation 70727. Up to 8637 conditions per place. [2024-06-28 01:27:32,237 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 278 selfloop transitions, 197 changer transitions 0/485 dead transitions. [2024-06-28 01:27:32,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 485 transitions, 6850 flow [2024-06-28 01:27:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:27:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:27:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-06-28 01:27:32,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 01:27:32,239 INFO L175 Difference]: Start difference. First operand has 225 places, 417 transitions, 5404 flow. Second operand 9 states and 231 transitions. [2024-06-28 01:27:32,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 485 transitions, 6850 flow [2024-06-28 01:27:32,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 485 transitions, 6361 flow, removed 31 selfloop flow, removed 10 redundant places. [2024-06-28 01:27:32,780 INFO L231 Difference]: Finished difference. Result has 224 places, 419 transitions, 5386 flow [2024-06-28 01:27:32,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4915, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5386, PETRI_PLACES=224, PETRI_TRANSITIONS=419} [2024-06-28 01:27:32,781 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 169 predicate places. [2024-06-28 01:27:32,781 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 419 transitions, 5386 flow [2024-06-28 01:27:32,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:32,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:32,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:32,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 01:27:32,781 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:32,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash 560783641, now seen corresponding path program 4 times [2024-06-28 01:27:32,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:32,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616781517] [2024-06-28 01:27:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:33,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:33,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616781517] [2024-06-28 01:27:33,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616781517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:33,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:33,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:27:33,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849138989] [2024-06-28 01:27:33,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:33,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:27:33,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:33,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:27:33,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:27:33,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:27:33,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 419 transitions, 5386 flow. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:33,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:33,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:27:33,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:35,358 INFO L124 PetriNetUnfolderBase]: 6577/10947 cut-off events. [2024-06-28 01:27:35,359 INFO L125 PetriNetUnfolderBase]: For 322196/322252 co-relation queries the response was YES. [2024-06-28 01:27:35,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68716 conditions, 10947 events. 6577/10947 cut-off events. For 322196/322252 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 76084 event pairs, 2351 based on Foata normal form. 19/10637 useless extension candidates. Maximal degree in co-relation 68626. Up to 9198 conditions per place. [2024-06-28 01:27:35,489 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 386 selfloop transitions, 48 changer transitions 0/451 dead transitions. [2024-06-28 01:27:35,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 451 transitions, 6450 flow [2024-06-28 01:27:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:27:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:27:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-06-28 01:27:35,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160349854227405 [2024-06-28 01:27:35,490 INFO L175 Difference]: Start difference. First operand has 224 places, 419 transitions, 5386 flow. Second operand 7 states and 177 transitions. [2024-06-28 01:27:35,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 451 transitions, 6450 flow [2024-06-28 01:27:35,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 451 transitions, 6001 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-28 01:27:35,969 INFO L231 Difference]: Finished difference. Result has 223 places, 422 transitions, 5129 flow [2024-06-28 01:27:35,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4937, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5129, PETRI_PLACES=223, PETRI_TRANSITIONS=422} [2024-06-28 01:27:35,970 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 168 predicate places. [2024-06-28 01:27:35,970 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 422 transitions, 5129 flow [2024-06-28 01:27:35,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:35,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:35,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:35,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 01:27:35,971 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:35,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:35,971 INFO L85 PathProgramCache]: Analyzing trace with hash 561143086, now seen corresponding path program 2 times [2024-06-28 01:27:35,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:35,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524693631] [2024-06-28 01:27:35,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:37,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524693631] [2024-06-28 01:27:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524693631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:37,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:37,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:27:37,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157989429] [2024-06-28 01:27:37,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:37,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:27:37,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:37,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:27:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:27:37,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:27:37,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 422 transitions, 5129 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:37,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:37,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:27:37,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:38,806 INFO L124 PetriNetUnfolderBase]: 6225/10558 cut-off events. [2024-06-28 01:27:38,807 INFO L125 PetriNetUnfolderBase]: For 308490/308559 co-relation queries the response was YES. [2024-06-28 01:27:38,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64296 conditions, 10558 events. 6225/10558 cut-off events. For 308490/308559 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 75279 event pairs, 2325 based on Foata normal form. 31/10252 useless extension candidates. Maximal degree in co-relation 64206. Up to 8509 conditions per place. [2024-06-28 01:27:38,933 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 341 selfloop transitions, 35 changer transitions 0/451 dead transitions. [2024-06-28 01:27:38,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 451 transitions, 6059 flow [2024-06-28 01:27:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:27:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:27:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-06-28 01:27:38,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189504373177842 [2024-06-28 01:27:38,934 INFO L175 Difference]: Start difference. First operand has 223 places, 422 transitions, 5129 flow. Second operand 7 states and 178 transitions. [2024-06-28 01:27:38,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 451 transitions, 6059 flow [2024-06-28 01:27:39,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 451 transitions, 5905 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-06-28 01:27:39,484 INFO L231 Difference]: Finished difference. Result has 225 places, 425 transitions, 5120 flow [2024-06-28 01:27:39,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4979, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5120, PETRI_PLACES=225, PETRI_TRANSITIONS=425} [2024-06-28 01:27:39,485 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 170 predicate places. [2024-06-28 01:27:39,485 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 425 transitions, 5120 flow [2024-06-28 01:27:39,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:39,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:39,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:39,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 01:27:39,486 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:39,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash 561142621, now seen corresponding path program 5 times [2024-06-28 01:27:39,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:39,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072589513] [2024-06-28 01:27:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:39,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:40,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:40,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072589513] [2024-06-28 01:27:40,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072589513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:40,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:40,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:27:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776382342] [2024-06-28 01:27:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:40,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:27:40,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:40,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:27:40,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:27:40,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:27:40,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 425 transitions, 5120 flow. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:40,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:40,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:27:40,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:42,271 INFO L124 PetriNetUnfolderBase]: 6611/10997 cut-off events. [2024-06-28 01:27:42,272 INFO L125 PetriNetUnfolderBase]: For 301919/301968 co-relation queries the response was YES. [2024-06-28 01:27:42,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67218 conditions, 10997 events. 6611/10997 cut-off events. For 301919/301968 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 76464 event pairs, 2215 based on Foata normal form. 12/10684 useless extension candidates. Maximal degree in co-relation 67127. Up to 9189 conditions per place. [2024-06-28 01:27:42,380 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 378 selfloop transitions, 59 changer transitions 0/454 dead transitions. [2024-06-28 01:27:42,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 454 transitions, 6182 flow [2024-06-28 01:27:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:27:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:27:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-06-28 01:27:42,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072886297376094 [2024-06-28 01:27:42,382 INFO L175 Difference]: Start difference. First operand has 225 places, 425 transitions, 5120 flow. Second operand 7 states and 174 transitions. [2024-06-28 01:27:42,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 454 transitions, 6182 flow [2024-06-28 01:27:42,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 454 transitions, 6069 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-28 01:27:42,771 INFO L231 Difference]: Finished difference. Result has 227 places, 428 transitions, 5210 flow [2024-06-28 01:27:42,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5009, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5210, PETRI_PLACES=227, PETRI_TRANSITIONS=428} [2024-06-28 01:27:42,771 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 172 predicate places. [2024-06-28 01:27:42,772 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 428 transitions, 5210 flow [2024-06-28 01:27:42,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:42,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:42,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:42,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 01:27:42,772 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:42,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:42,773 INFO L85 PathProgramCache]: Analyzing trace with hash -955372546, now seen corresponding path program 10 times [2024-06-28 01:27:42,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:42,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612969537] [2024-06-28 01:27:42,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:42,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:43,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:43,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612969537] [2024-06-28 01:27:43,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612969537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:43,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:43,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:27:43,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044423687] [2024-06-28 01:27:43,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:43,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:27:43,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:43,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:27:43,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:27:43,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:27:43,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 428 transitions, 5210 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:43,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:43,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:27:43,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:45,970 INFO L124 PetriNetUnfolderBase]: 7248/11696 cut-off events. [2024-06-28 01:27:45,970 INFO L125 PetriNetUnfolderBase]: For 307726/307740 co-relation queries the response was YES. [2024-06-28 01:27:46,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71713 conditions, 11696 events. 7248/11696 cut-off events. For 307726/307740 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 79576 event pairs, 1730 based on Foata normal form. 12/11442 useless extension candidates. Maximal degree in co-relation 71621. Up to 9291 conditions per place. [2024-06-28 01:27:46,093 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 308 selfloop transitions, 198 changer transitions 0/516 dead transitions. [2024-06-28 01:27:46,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 516 transitions, 7180 flow [2024-06-28 01:27:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:27:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:27:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-06-28 01:27:46,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215419501133787 [2024-06-28 01:27:46,095 INFO L175 Difference]: Start difference. First operand has 227 places, 428 transitions, 5210 flow. Second operand 9 states and 230 transitions. [2024-06-28 01:27:46,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 516 transitions, 7180 flow [2024-06-28 01:27:46,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 516 transitions, 7003 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-28 01:27:46,610 INFO L231 Difference]: Finished difference. Result has 232 places, 453 transitions, 5925 flow [2024-06-28 01:27:46,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5039, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5925, PETRI_PLACES=232, PETRI_TRANSITIONS=453} [2024-06-28 01:27:46,610 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 177 predicate places. [2024-06-28 01:27:46,610 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 453 transitions, 5925 flow [2024-06-28 01:27:46,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:46,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:46,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:46,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 01:27:46,611 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:46,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash -955641316, now seen corresponding path program 11 times [2024-06-28 01:27:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:46,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337393598] [2024-06-28 01:27:46,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:46,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:47,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:47,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337393598] [2024-06-28 01:27:47,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337393598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:47,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:47,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:27:47,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353896664] [2024-06-28 01:27:47,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:47,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:27:47,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:47,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:27:47,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:27:47,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:27:47,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 453 transitions, 5925 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:47,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:47,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:27:47,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:49,862 INFO L124 PetriNetUnfolderBase]: 7240/11704 cut-off events. [2024-06-28 01:27:49,862 INFO L125 PetriNetUnfolderBase]: For 309691/309705 co-relation queries the response was YES. [2024-06-28 01:27:49,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72939 conditions, 11704 events. 7240/11704 cut-off events. For 309691/309705 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 79818 event pairs, 1759 based on Foata normal form. 12/11447 useless extension candidates. Maximal degree in co-relation 72845. Up to 9369 conditions per place. [2024-06-28 01:27:50,004 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 306 selfloop transitions, 196 changer transitions 0/512 dead transitions. [2024-06-28 01:27:50,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 512 transitions, 7319 flow [2024-06-28 01:27:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:27:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:27:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2024-06-28 01:27:50,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124716553287982 [2024-06-28 01:27:50,006 INFO L175 Difference]: Start difference. First operand has 232 places, 453 transitions, 5925 flow. Second operand 9 states and 226 transitions. [2024-06-28 01:27:50,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 512 transitions, 7319 flow [2024-06-28 01:27:50,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 512 transitions, 7156 flow, removed 60 selfloop flow, removed 2 redundant places. [2024-06-28 01:27:50,548 INFO L231 Difference]: Finished difference. Result has 239 places, 453 transitions, 6164 flow [2024-06-28 01:27:50,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5762, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6164, PETRI_PLACES=239, PETRI_TRANSITIONS=453} [2024-06-28 01:27:50,549 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 184 predicate places. [2024-06-28 01:27:50,549 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 453 transitions, 6164 flow [2024-06-28 01:27:50,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:50,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:50,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:50,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 01:27:50,554 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:50,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:50,555 INFO L85 PathProgramCache]: Analyzing trace with hash -630631426, now seen corresponding path program 12 times [2024-06-28 01:27:50,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:50,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634743503] [2024-06-28 01:27:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:50,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:51,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:51,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634743503] [2024-06-28 01:27:51,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634743503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:51,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:51,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:27:51,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624119479] [2024-06-28 01:27:51,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:51,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:27:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:51,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:27:51,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:27:51,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:27:51,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 453 transitions, 6164 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:51,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:51,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:27:51,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:53,939 INFO L124 PetriNetUnfolderBase]: 7277/11697 cut-off events. [2024-06-28 01:27:53,940 INFO L125 PetriNetUnfolderBase]: For 319034/319048 co-relation queries the response was YES. [2024-06-28 01:27:54,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73148 conditions, 11697 events. 7277/11697 cut-off events. For 319034/319048 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 78900 event pairs, 1552 based on Foata normal form. 12/11455 useless extension candidates. Maximal degree in co-relation 73052. Up to 8574 conditions per place. [2024-06-28 01:27:54,089 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 279 selfloop transitions, 228 changer transitions 0/517 dead transitions. [2024-06-28 01:27:54,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 517 transitions, 7802 flow [2024-06-28 01:27:54,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:27:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:27:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-06-28 01:27:54,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215419501133787 [2024-06-28 01:27:54,091 INFO L175 Difference]: Start difference. First operand has 239 places, 453 transitions, 6164 flow. Second operand 9 states and 230 transitions. [2024-06-28 01:27:54,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 517 transitions, 7802 flow [2024-06-28 01:27:54,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 517 transitions, 7399 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 01:27:54,679 INFO L231 Difference]: Finished difference. Result has 240 places, 457 transitions, 6364 flow [2024-06-28 01:27:54,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5761, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6364, PETRI_PLACES=240, PETRI_TRANSITIONS=457} [2024-06-28 01:27:54,679 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 185 predicate places. [2024-06-28 01:27:54,680 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 457 transitions, 6364 flow [2024-06-28 01:27:54,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:54,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:54,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:54,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 01:27:54,680 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:54,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash -727648936, now seen corresponding path program 13 times [2024-06-28 01:27:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:54,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937404534] [2024-06-28 01:27:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:27:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:27:55,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:27:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937404534] [2024-06-28 01:27:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937404534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:27:55,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:27:55,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:27:55,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015104581] [2024-06-28 01:27:55,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:27:55,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:27:55,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:27:55,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:27:55,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:27:55,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:27:55,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 457 transitions, 6364 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:55,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:27:55,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:27:55,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:27:58,234 INFO L124 PetriNetUnfolderBase]: 7386/11912 cut-off events. [2024-06-28 01:27:58,234 INFO L125 PetriNetUnfolderBase]: For 337867/337881 co-relation queries the response was YES. [2024-06-28 01:27:58,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75771 conditions, 11912 events. 7386/11912 cut-off events. For 337867/337881 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 81251 event pairs, 1830 based on Foata normal form. 12/11655 useless extension candidates. Maximal degree in co-relation 75674. Up to 9555 conditions per place. [2024-06-28 01:27:58,405 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 314 selfloop transitions, 202 changer transitions 0/526 dead transitions. [2024-06-28 01:27:58,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 526 transitions, 8022 flow [2024-06-28 01:27:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:27:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:27:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2024-06-28 01:27:58,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147392290249433 [2024-06-28 01:27:58,407 INFO L175 Difference]: Start difference. First operand has 240 places, 457 transitions, 6364 flow. Second operand 9 states and 227 transitions. [2024-06-28 01:27:58,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 526 transitions, 8022 flow [2024-06-28 01:27:59,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 526 transitions, 7694 flow, removed 46 selfloop flow, removed 5 redundant places. [2024-06-28 01:27:59,060 INFO L231 Difference]: Finished difference. Result has 244 places, 471 transitions, 6740 flow [2024-06-28 01:27:59,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6058, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6740, PETRI_PLACES=244, PETRI_TRANSITIONS=471} [2024-06-28 01:27:59,061 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 189 predicate places. [2024-06-28 01:27:59,061 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 471 transitions, 6740 flow [2024-06-28 01:27:59,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:27:59,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:27:59,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:27:59,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 01:27:59,061 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:27:59,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:27:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1203802694, now seen corresponding path program 14 times [2024-06-28 01:27:59,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:27:59,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114900585] [2024-06-28 01:27:59,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:27:59,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:27:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:00,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:00,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114900585] [2024-06-28 01:28:00,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114900585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:00,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:00,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:28:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596102370] [2024-06-28 01:28:00,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:00,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:28:00,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:00,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:28:00,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:28:00,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:28:00,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 471 transitions, 6740 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:00,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:00,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:28:00,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:02,272 INFO L124 PetriNetUnfolderBase]: 7423/11978 cut-off events. [2024-06-28 01:28:02,272 INFO L125 PetriNetUnfolderBase]: For 339422/339436 co-relation queries the response was YES. [2024-06-28 01:28:02,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76479 conditions, 11978 events. 7423/11978 cut-off events. For 339422/339436 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 81726 event pairs, 1825 based on Foata normal form. 12/11718 useless extension candidates. Maximal degree in co-relation 76380. Up to 9610 conditions per place. [2024-06-28 01:28:02,437 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 324 selfloop transitions, 199 changer transitions 0/533 dead transitions. [2024-06-28 01:28:02,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 533 transitions, 8266 flow [2024-06-28 01:28:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:28:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:28:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-06-28 01:28:02,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2024-06-28 01:28:02,438 INFO L175 Difference]: Start difference. First operand has 244 places, 471 transitions, 6740 flow. Second operand 9 states and 228 transitions. [2024-06-28 01:28:02,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 533 transitions, 8266 flow [2024-06-28 01:28:03,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 533 transitions, 7733 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-28 01:28:03,176 INFO L231 Difference]: Finished difference. Result has 245 places, 473 transitions, 6685 flow [2024-06-28 01:28:03,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6207, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6685, PETRI_PLACES=245, PETRI_TRANSITIONS=473} [2024-06-28 01:28:03,177 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 190 predicate places. [2024-06-28 01:28:03,177 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 473 transitions, 6685 flow [2024-06-28 01:28:03,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:03,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:03,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:03,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 01:28:03,177 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:03,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:03,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1203533924, now seen corresponding path program 15 times [2024-06-28 01:28:03,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:03,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671258130] [2024-06-28 01:28:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:03,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:04,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:04,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671258130] [2024-06-28 01:28:04,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671258130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:04,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:04,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:28:04,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126728304] [2024-06-28 01:28:04,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:04,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:28:04,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:04,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:28:04,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:28:04,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:28:04,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 473 transitions, 6685 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:04,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:04,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:28:04,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:06,726 INFO L124 PetriNetUnfolderBase]: 7415/11950 cut-off events. [2024-06-28 01:28:06,726 INFO L125 PetriNetUnfolderBase]: For 342329/342343 co-relation queries the response was YES. [2024-06-28 01:28:06,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75638 conditions, 11950 events. 7415/11950 cut-off events. For 342329/342343 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 81517 event pairs, 1827 based on Foata normal form. 12/11696 useless extension candidates. Maximal degree in co-relation 75540. Up to 9462 conditions per place. [2024-06-28 01:28:06,893 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 319 selfloop transitions, 203 changer transitions 0/532 dead transitions. [2024-06-28 01:28:06,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 532 transitions, 8109 flow [2024-06-28 01:28:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:28:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:28:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2024-06-28 01:28:06,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192743764172335 [2024-06-28 01:28:06,894 INFO L175 Difference]: Start difference. First operand has 245 places, 473 transitions, 6685 flow. Second operand 9 states and 229 transitions. [2024-06-28 01:28:06,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 532 transitions, 8109 flow [2024-06-28 01:28:07,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 532 transitions, 7578 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-28 01:28:07,564 INFO L231 Difference]: Finished difference. Result has 248 places, 473 transitions, 6567 flow [2024-06-28 01:28:07,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6154, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6567, PETRI_PLACES=248, PETRI_TRANSITIONS=473} [2024-06-28 01:28:07,565 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 193 predicate places. [2024-06-28 01:28:07,565 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 473 transitions, 6567 flow [2024-06-28 01:28:07,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:07,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:07,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:07,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 01:28:07,565 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:07,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:07,566 INFO L85 PathProgramCache]: Analyzing trace with hash 975877516, now seen corresponding path program 3 times [2024-06-28 01:28:07,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:07,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632053248] [2024-06-28 01:28:07,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:07,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:08,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:08,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632053248] [2024-06-28 01:28:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632053248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:08,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:08,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:28:08,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351004859] [2024-06-28 01:28:08,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:08,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:28:08,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:08,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:28:08,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:28:08,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:28:08,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 473 transitions, 6567 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:08,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:08,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:28:08,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:10,404 INFO L124 PetriNetUnfolderBase]: 6534/11270 cut-off events. [2024-06-28 01:28:10,404 INFO L125 PetriNetUnfolderBase]: For 345408/345485 co-relation queries the response was YES. [2024-06-28 01:28:10,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69082 conditions, 11270 events. 6534/11270 cut-off events. For 345408/345485 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 82473 event pairs, 2388 based on Foata normal form. 37/10900 useless extension candidates. Maximal degree in co-relation 68983. Up to 8838 conditions per place. [2024-06-28 01:28:10,540 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 365 selfloop transitions, 46 changer transitions 0/505 dead transitions. [2024-06-28 01:28:10,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 505 transitions, 7715 flow [2024-06-28 01:28:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:28:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:28:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-06-28 01:28:10,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160349854227405 [2024-06-28 01:28:10,541 INFO L175 Difference]: Start difference. First operand has 248 places, 473 transitions, 6567 flow. Second operand 7 states and 177 transitions. [2024-06-28 01:28:10,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 505 transitions, 7715 flow [2024-06-28 01:28:11,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 505 transitions, 7022 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-28 01:28:11,068 INFO L231 Difference]: Finished difference. Result has 247 places, 481 transitions, 6114 flow [2024-06-28 01:28:11,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5874, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6114, PETRI_PLACES=247, PETRI_TRANSITIONS=481} [2024-06-28 01:28:11,078 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 192 predicate places. [2024-06-28 01:28:11,078 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 481 transitions, 6114 flow [2024-06-28 01:28:11,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:11,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:11,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:11,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 01:28:11,079 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:11,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:11,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1474298483, now seen corresponding path program 6 times [2024-06-28 01:28:11,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:11,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124433557] [2024-06-28 01:28:11,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:11,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:11,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:11,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124433557] [2024-06-28 01:28:11,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124433557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:11,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:11,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:28:11,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411487125] [2024-06-28 01:28:11,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:11,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:28:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:28:11,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:28:12,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:28:12,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 481 transitions, 6114 flow. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:12,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:12,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:28:12,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:13,807 INFO L124 PetriNetUnfolderBase]: 6969/11535 cut-off events. [2024-06-28 01:28:13,807 INFO L125 PetriNetUnfolderBase]: For 354699/354757 co-relation queries the response was YES. [2024-06-28 01:28:13,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71740 conditions, 11535 events. 6969/11535 cut-off events. For 354699/354757 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 80609 event pairs, 1804 based on Foata normal form. 17/11186 useless extension candidates. Maximal degree in co-relation 71640. Up to 9652 conditions per place. [2024-06-28 01:28:13,937 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 427 selfloop transitions, 63 changer transitions 0/507 dead transitions. [2024-06-28 01:28:13,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 507 transitions, 7278 flow [2024-06-28 01:28:13,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:28:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:28:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-28 01:28:13,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49854227405247814 [2024-06-28 01:28:13,938 INFO L175 Difference]: Start difference. First operand has 247 places, 481 transitions, 6114 flow. Second operand 7 states and 171 transitions. [2024-06-28 01:28:13,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 507 transitions, 7278 flow [2024-06-28 01:28:14,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 507 transitions, 7189 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-28 01:28:14,623 INFO L231 Difference]: Finished difference. Result has 251 places, 484 transitions, 6231 flow [2024-06-28 01:28:14,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6025, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6231, PETRI_PLACES=251, PETRI_TRANSITIONS=484} [2024-06-28 01:28:14,625 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 196 predicate places. [2024-06-28 01:28:14,625 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 484 transitions, 6231 flow [2024-06-28 01:28:14,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:14,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:14,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:14,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 01:28:14,626 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:14,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:14,626 INFO L85 PathProgramCache]: Analyzing trace with hash -746539056, now seen corresponding path program 4 times [2024-06-28 01:28:14,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:14,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576648068] [2024-06-28 01:28:14,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:15,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-28 01:28:15,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:15,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576648068] [2024-06-28 01:28:15,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576648068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:15,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:15,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:28:15,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081769808] [2024-06-28 01:28:15,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:15,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:28:15,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:15,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:28:15,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:28:15,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:28:15,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 484 transitions, 6231 flow. Second operand has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 9 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:15,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:15,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:28:15,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:17,714 INFO L124 PetriNetUnfolderBase]: 6516/11259 cut-off events. [2024-06-28 01:28:17,715 INFO L125 PetriNetUnfolderBase]: For 365776/365858 co-relation queries the response was YES. [2024-06-28 01:28:17,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68541 conditions, 11259 events. 6516/11259 cut-off events. For 365776/365858 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 82430 event pairs, 2385 based on Foata normal form. 38/10898 useless extension candidates. Maximal degree in co-relation 68439. Up to 8871 conditions per place. [2024-06-28 01:28:17,858 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 377 selfloop transitions, 36 changer transitions 0/508 dead transitions. [2024-06-28 01:28:17,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 508 transitions, 7180 flow [2024-06-28 01:28:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:28:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:28:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-06-28 01:28:17,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-28 01:28:17,859 INFO L175 Difference]: Start difference. First operand has 251 places, 484 transitions, 6231 flow. Second operand 7 states and 175 transitions. [2024-06-28 01:28:17,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 508 transitions, 7180 flow [2024-06-28 01:28:18,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 508 transitions, 6960 flow, removed 49 selfloop flow, removed 5 redundant places. [2024-06-28 01:28:18,512 INFO L231 Difference]: Finished difference. Result has 253 places, 485 transitions, 6098 flow [2024-06-28 01:28:18,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6011, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6098, PETRI_PLACES=253, PETRI_TRANSITIONS=485} [2024-06-28 01:28:18,512 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 198 predicate places. [2024-06-28 01:28:18,513 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 485 transitions, 6098 flow [2024-06-28 01:28:18,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 9 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:18,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:18,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:18,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 01:28:18,513 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:18,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1192323419, now seen corresponding path program 1 times [2024-06-28 01:28:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:18,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695535067] [2024-06-28 01:28:18,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:18,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:19,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:19,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695535067] [2024-06-28 01:28:19,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695535067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:19,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:19,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:28:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837707902] [2024-06-28 01:28:19,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:19,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:28:19,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:19,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:28:19,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:28:19,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:28:19,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 485 transitions, 6098 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:19,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:19,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:28:19,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:21,672 INFO L124 PetriNetUnfolderBase]: 6606/11266 cut-off events. [2024-06-28 01:28:21,672 INFO L125 PetriNetUnfolderBase]: For 364196/364250 co-relation queries the response was YES. [2024-06-28 01:28:21,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68726 conditions, 11266 events. 6606/11266 cut-off events. For 364196/364250 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 82572 event pairs, 2486 based on Foata normal form. 16/10972 useless extension candidates. Maximal degree in co-relation 68623. Up to 9033 conditions per place. [2024-06-28 01:28:21,871 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 402 selfloop transitions, 21 changer transitions 0/517 dead transitions. [2024-06-28 01:28:21,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 517 transitions, 7130 flow [2024-06-28 01:28:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:28:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:28:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-06-28 01:28:21,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247813411078717 [2024-06-28 01:28:21,873 INFO L175 Difference]: Start difference. First operand has 253 places, 485 transitions, 6098 flow. Second operand 7 states and 180 transitions. [2024-06-28 01:28:21,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 517 transitions, 7130 flow [2024-06-28 01:28:22,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 517 transitions, 7054 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 01:28:22,692 INFO L231 Difference]: Finished difference. Result has 255 places, 488 transitions, 6130 flow [2024-06-28 01:28:22,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6022, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6130, PETRI_PLACES=255, PETRI_TRANSITIONS=488} [2024-06-28 01:28:22,693 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 200 predicate places. [2024-06-28 01:28:22,693 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 488 transitions, 6130 flow [2024-06-28 01:28:22,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:22,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:22,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:22,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 01:28:22,693 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:22,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:22,694 INFO L85 PathProgramCache]: Analyzing trace with hash 797564462, now seen corresponding path program 1 times [2024-06-28 01:28:22,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:22,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891412558] [2024-06-28 01:28:22,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:22,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:23,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:23,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891412558] [2024-06-28 01:28:23,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891412558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:23,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:23,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:28:23,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301196635] [2024-06-28 01:28:23,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:23,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:28:23,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:23,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:28:23,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:28:23,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:28:23,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 488 transitions, 6130 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:23,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:23,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:28:23,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:25,792 INFO L124 PetriNetUnfolderBase]: 6656/11335 cut-off events. [2024-06-28 01:28:25,792 INFO L125 PetriNetUnfolderBase]: For 384653/384707 co-relation queries the response was YES. [2024-06-28 01:28:25,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69956 conditions, 11335 events. 6656/11335 cut-off events. For 384653/384707 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 82932 event pairs, 2488 based on Foata normal form. 21/11049 useless extension candidates. Maximal degree in co-relation 69852. Up to 9069 conditions per place. [2024-06-28 01:28:25,977 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 406 selfloop transitions, 18 changer transitions 0/518 dead transitions. [2024-06-28 01:28:25,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 518 transitions, 7144 flow [2024-06-28 01:28:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:28:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:28:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-06-28 01:28:25,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189504373177842 [2024-06-28 01:28:25,979 INFO L175 Difference]: Start difference. First operand has 255 places, 488 transitions, 6130 flow. Second operand 7 states and 178 transitions. [2024-06-28 01:28:25,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 518 transitions, 7144 flow [2024-06-28 01:28:27,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 518 transitions, 7058 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-28 01:28:27,019 INFO L231 Difference]: Finished difference. Result has 257 places, 492 transitions, 6139 flow [2024-06-28 01:28:27,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6044, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6139, PETRI_PLACES=257, PETRI_TRANSITIONS=492} [2024-06-28 01:28:27,019 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 202 predicate places. [2024-06-28 01:28:27,019 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 492 transitions, 6139 flow [2024-06-28 01:28:27,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:27,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:27,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:27,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 01:28:27,020 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:27,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:27,021 INFO L85 PathProgramCache]: Analyzing trace with hash 975618542, now seen corresponding path program 2 times [2024-06-28 01:28:27,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:27,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881511330] [2024-06-28 01:28:27,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:27,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:28,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:28,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881511330] [2024-06-28 01:28:28,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881511330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:28,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:28,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:28:28,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050244690] [2024-06-28 01:28:28,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:28,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:28:28,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:28,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:28:28,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:28:28,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:28:28,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 492 transitions, 6139 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:28,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:28,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:28:28,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:30,492 INFO L124 PetriNetUnfolderBase]: 6739/11526 cut-off events. [2024-06-28 01:28:30,493 INFO L125 PetriNetUnfolderBase]: For 399248/399308 co-relation queries the response was YES. [2024-06-28 01:28:30,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72110 conditions, 11526 events. 6739/11526 cut-off events. For 399248/399308 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 84832 event pairs, 2481 based on Foata normal form. 25/11223 useless extension candidates. Maximal degree in co-relation 72005. Up to 9142 conditions per place. [2024-06-28 01:28:30,619 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 405 selfloop transitions, 23 changer transitions 0/522 dead transitions. [2024-06-28 01:28:30,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 522 transitions, 7179 flow [2024-06-28 01:28:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:28:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:28:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-06-28 01:28:30,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521865889212828 [2024-06-28 01:28:30,620 INFO L175 Difference]: Start difference. First operand has 257 places, 492 transitions, 6139 flow. Second operand 7 states and 179 transitions. [2024-06-28 01:28:30,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 522 transitions, 7179 flow [2024-06-28 01:28:31,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 522 transitions, 7114 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-28 01:28:31,343 INFO L231 Difference]: Finished difference. Result has 259 places, 496 transitions, 6187 flow [2024-06-28 01:28:31,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6074, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6187, PETRI_PLACES=259, PETRI_TRANSITIONS=496} [2024-06-28 01:28:31,345 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 204 predicate places. [2024-06-28 01:28:31,345 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 496 transitions, 6187 flow [2024-06-28 01:28:31,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:31,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:31,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:31,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-28 01:28:31,346 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:31,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash 975885452, now seen corresponding path program 3 times [2024-06-28 01:28:31,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:31,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128131438] [2024-06-28 01:28:31,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:31,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:32,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:32,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128131438] [2024-06-28 01:28:32,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128131438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:32,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:32,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:28:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879723982] [2024-06-28 01:28:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:32,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:28:32,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:32,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:28:32,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:28:32,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:28:32,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 496 transitions, 6187 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:32,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:32,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:28:32,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:34,444 INFO L124 PetriNetUnfolderBase]: 6760/11588 cut-off events. [2024-06-28 01:28:34,444 INFO L125 PetriNetUnfolderBase]: For 406342/406402 co-relation queries the response was YES. [2024-06-28 01:28:34,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73429 conditions, 11588 events. 6760/11588 cut-off events. For 406342/406402 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 85683 event pairs, 2484 based on Foata normal form. 22/11272 useless extension candidates. Maximal degree in co-relation 73323. Up to 9072 conditions per place. [2024-06-28 01:28:34,621 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 399 selfloop transitions, 36 changer transitions 0/529 dead transitions. [2024-06-28 01:28:34,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 529 transitions, 7391 flow [2024-06-28 01:28:34,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:28:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:28:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-28 01:28:34,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276967930029155 [2024-06-28 01:28:34,623 INFO L175 Difference]: Start difference. First operand has 259 places, 496 transitions, 6187 flow. Second operand 7 states and 181 transitions. [2024-06-28 01:28:34,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 529 transitions, 7391 flow [2024-06-28 01:28:35,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 529 transitions, 7308 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-28 01:28:35,445 INFO L231 Difference]: Finished difference. Result has 262 places, 502 transitions, 6306 flow [2024-06-28 01:28:35,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6104, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6306, PETRI_PLACES=262, PETRI_TRANSITIONS=502} [2024-06-28 01:28:35,446 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 207 predicate places. [2024-06-28 01:28:35,446 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 502 transitions, 6306 flow [2024-06-28 01:28:35,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:35,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:35,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:35,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-28 01:28:35,447 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:35,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:35,447 INFO L85 PathProgramCache]: Analyzing trace with hash 975895372, now seen corresponding path program 1 times [2024-06-28 01:28:35,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:35,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694233746] [2024-06-28 01:28:35,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:35,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:36,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:36,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694233746] [2024-06-28 01:28:36,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694233746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:36,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:36,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:28:36,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876146301] [2024-06-28 01:28:36,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:36,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:28:36,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:36,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:28:36,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:28:36,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-28 01:28:36,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 502 transitions, 6306 flow. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:36,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:36,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-28 01:28:36,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:38,761 INFO L124 PetriNetUnfolderBase]: 6704/11525 cut-off events. [2024-06-28 01:28:38,761 INFO L125 PetriNetUnfolderBase]: For 432549/432616 co-relation queries the response was YES. [2024-06-28 01:28:38,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74335 conditions, 11525 events. 6704/11525 cut-off events. For 432549/432616 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 84603 event pairs, 2590 based on Foata normal form. 26/11145 useless extension candidates. Maximal degree in co-relation 74227. Up to 9214 conditions per place. [2024-06-28 01:28:38,904 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 412 selfloop transitions, 18 changer transitions 0/525 dead transitions. [2024-06-28 01:28:38,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 525 transitions, 7282 flow [2024-06-28 01:28:38,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:28:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:28:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-06-28 01:28:38,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072886297376094 [2024-06-28 01:28:38,905 INFO L175 Difference]: Start difference. First operand has 262 places, 502 transitions, 6306 flow. Second operand 7 states and 174 transitions. [2024-06-28 01:28:38,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 525 transitions, 7282 flow [2024-06-28 01:28:39,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 525 transitions, 7195 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-28 01:28:39,620 INFO L231 Difference]: Finished difference. Result has 266 places, 502 transitions, 6263 flow [2024-06-28 01:28:39,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6219, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6263, PETRI_PLACES=266, PETRI_TRANSITIONS=502} [2024-06-28 01:28:39,621 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 211 predicate places. [2024-06-28 01:28:39,621 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 502 transitions, 6263 flow [2024-06-28 01:28:39,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:39,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:39,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:39,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-28 01:28:39,622 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:39,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:39,622 INFO L85 PathProgramCache]: Analyzing trace with hash -507484645, now seen corresponding path program 1 times [2024-06-28 01:28:39,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:39,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831353008] [2024-06-28 01:28:39,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:39,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:40,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:40,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831353008] [2024-06-28 01:28:40,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831353008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:40,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:40,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:28:40,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820763697] [2024-06-28 01:28:40,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:40,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:28:40,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:40,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:28:40,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:28:40,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:28:40,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 502 transitions, 6263 flow. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:40,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:40,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:28:40,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:43,245 INFO L124 PetriNetUnfolderBase]: 8139/13196 cut-off events. [2024-06-28 01:28:43,246 INFO L125 PetriNetUnfolderBase]: For 495601/495615 co-relation queries the response was YES. [2024-06-28 01:28:43,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87566 conditions, 13196 events. 8139/13196 cut-off events. For 495601/495615 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 92158 event pairs, 2548 based on Foata normal form. 30/12930 useless extension candidates. Maximal degree in co-relation 87456. Up to 10831 conditions per place. [2024-06-28 01:28:43,431 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 519 selfloop transitions, 83 changer transitions 0/612 dead transitions. [2024-06-28 01:28:43,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 612 transitions, 8319 flow [2024-06-28 01:28:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:28:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:28:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 315 transitions. [2024-06-28 01:28:43,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-06-28 01:28:43,433 INFO L175 Difference]: Start difference. First operand has 266 places, 502 transitions, 6263 flow. Second operand 12 states and 315 transitions. [2024-06-28 01:28:43,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 612 transitions, 8319 flow [2024-06-28 01:28:44,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 612 transitions, 8221 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-28 01:28:44,627 INFO L231 Difference]: Finished difference. Result has 275 places, 522 transitions, 6621 flow [2024-06-28 01:28:44,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6165, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6621, PETRI_PLACES=275, PETRI_TRANSITIONS=522} [2024-06-28 01:28:44,628 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 220 predicate places. [2024-06-28 01:28:44,628 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 522 transitions, 6621 flow [2024-06-28 01:28:44,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:44,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:44,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:44,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-28 01:28:44,628 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:44,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1509616689, now seen corresponding path program 2 times [2024-06-28 01:28:44,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:44,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699533010] [2024-06-28 01:28:44,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:44,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:45,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:45,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699533010] [2024-06-28 01:28:45,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699533010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:45,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:28:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060311732] [2024-06-28 01:28:45,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:45,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:28:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:45,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:28:45,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:28:45,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:28:45,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 522 transitions, 6621 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:45,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:45,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:28:45,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:48,448 INFO L124 PetriNetUnfolderBase]: 9465/15598 cut-off events. [2024-06-28 01:28:48,448 INFO L125 PetriNetUnfolderBase]: For 626480/626504 co-relation queries the response was YES. [2024-06-28 01:28:48,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105136 conditions, 15598 events. 9465/15598 cut-off events. For 626480/626504 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 113568 event pairs, 2343 based on Foata normal form. 35/15252 useless extension candidates. Maximal degree in co-relation 105022. Up to 9841 conditions per place. [2024-06-28 01:28:48,644 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 303 selfloop transitions, 344 changer transitions 0/657 dead transitions. [2024-06-28 01:28:48,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 657 transitions, 9134 flow [2024-06-28 01:28:48,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:28:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:28:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 276 transitions. [2024-06-28 01:28:48,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.563265306122449 [2024-06-28 01:28:48,646 INFO L175 Difference]: Start difference. First operand has 275 places, 522 transitions, 6621 flow. Second operand 10 states and 276 transitions. [2024-06-28 01:28:48,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 657 transitions, 9134 flow [2024-06-28 01:28:50,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 657 transitions, 9018 flow, removed 42 selfloop flow, removed 3 redundant places. [2024-06-28 01:28:50,272 INFO L231 Difference]: Finished difference. Result has 285 places, 579 transitions, 8051 flow [2024-06-28 01:28:50,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6539, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=288, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8051, PETRI_PLACES=285, PETRI_TRANSITIONS=579} [2024-06-28 01:28:50,273 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 230 predicate places. [2024-06-28 01:28:50,273 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 579 transitions, 8051 flow [2024-06-28 01:28:50,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:50,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:50,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:50,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-28 01:28:50,274 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:50,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1830793389, now seen corresponding path program 3 times [2024-06-28 01:28:50,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:50,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680829396] [2024-06-28 01:28:50,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:51,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:51,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680829396] [2024-06-28 01:28:51,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680829396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:51,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:51,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:28:51,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101295325] [2024-06-28 01:28:51,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:51,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:28:51,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:51,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:28:51,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:28:51,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:28:51,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 579 transitions, 8051 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:51,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:51,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:28:51,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:28:55,267 INFO L124 PetriNetUnfolderBase]: 10127/16602 cut-off events. [2024-06-28 01:28:55,267 INFO L125 PetriNetUnfolderBase]: For 723912/723938 co-relation queries the response was YES. [2024-06-28 01:28:55,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118173 conditions, 16602 events. 10127/16602 cut-off events. For 723912/723938 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 121913 event pairs, 2629 based on Foata normal form. 75/16292 useless extension candidates. Maximal degree in co-relation 118054. Up to 11084 conditions per place. [2024-06-28 01:28:55,627 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 307 selfloop transitions, 355 changer transitions 0/672 dead transitions. [2024-06-28 01:28:55,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 672 transitions, 10158 flow [2024-06-28 01:28:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:28:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:28:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 272 transitions. [2024-06-28 01:28:55,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5551020408163265 [2024-06-28 01:28:55,628 INFO L175 Difference]: Start difference. First operand has 285 places, 579 transitions, 8051 flow. Second operand 10 states and 272 transitions. [2024-06-28 01:28:55,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 672 transitions, 10158 flow [2024-06-28 01:28:56,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 672 transitions, 9843 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-28 01:28:56,849 INFO L231 Difference]: Finished difference. Result has 293 places, 600 transitions, 9052 flow [2024-06-28 01:28:56,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7772, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=334, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9052, PETRI_PLACES=293, PETRI_TRANSITIONS=600} [2024-06-28 01:28:56,850 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 238 predicate places. [2024-06-28 01:28:56,850 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 600 transitions, 9052 flow [2024-06-28 01:28:56,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:56,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:28:56,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:28:56,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-28 01:28:56,850 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:28:56,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:28:56,851 INFO L85 PathProgramCache]: Analyzing trace with hash -360996023, now seen corresponding path program 4 times [2024-06-28 01:28:56,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:28:56,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638843098] [2024-06-28 01:28:56,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:28:56,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:28:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:28:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:28:57,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:28:57,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638843098] [2024-06-28 01:28:57,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638843098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:28:57,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:28:57,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:28:57,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187122524] [2024-06-28 01:28:57,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:28:57,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:28:57,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:28:57,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:28:57,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:28:57,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:28:57,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 600 transitions, 9052 flow. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:28:57,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:28:57,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:28:57,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:29:02,824 INFO L124 PetriNetUnfolderBase]: 12166/20286 cut-off events. [2024-06-28 01:29:02,824 INFO L125 PetriNetUnfolderBase]: For 923002/923018 co-relation queries the response was YES. [2024-06-28 01:29:02,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152363 conditions, 20286 events. 12166/20286 cut-off events. For 923002/923018 co-relation queries the response was YES. Maximal size of possible extension queue 911. Compared 157117 event pairs, 2857 based on Foata normal form. 32/19828 useless extension candidates. Maximal degree in co-relation 152240. Up to 13423 conditions per place. [2024-06-28 01:29:03,245 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 587 selfloop transitions, 136 changer transitions 0/733 dead transitions. [2024-06-28 01:29:03,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 733 transitions, 12204 flow [2024-06-28 01:29:03,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:29:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:29:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 319 transitions. [2024-06-28 01:29:03,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425170068027211 [2024-06-28 01:29:03,246 INFO L175 Difference]: Start difference. First operand has 293 places, 600 transitions, 9052 flow. Second operand 12 states and 319 transitions. [2024-06-28 01:29:03,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 733 transitions, 12204 flow [2024-06-28 01:29:05,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 733 transitions, 11574 flow, removed 76 selfloop flow, removed 5 redundant places. [2024-06-28 01:29:05,773 INFO L231 Difference]: Finished difference. Result has 302 places, 626 transitions, 9475 flow [2024-06-28 01:29:05,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8497, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9475, PETRI_PLACES=302, PETRI_TRANSITIONS=626} [2024-06-28 01:29:05,774 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 247 predicate places. [2024-06-28 01:29:05,774 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 626 transitions, 9475 flow [2024-06-28 01:29:05,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:29:05,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:29:05,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:29:05,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-28 01:29:05,775 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:29:05,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:29:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1507611953, now seen corresponding path program 5 times [2024-06-28 01:29:05,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:29:05,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849827184] [2024-06-28 01:29:05,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:29:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:29:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:29:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:29:06,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:29:06,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849827184] [2024-06-28 01:29:06,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849827184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:29:06,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:29:06,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:29:06,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596867358] [2024-06-28 01:29:06,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:29:06,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:29:06,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:29:06,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:29:06,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:29:06,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:29:06,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 626 transitions, 9475 flow. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:29:06,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:29:06,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:29:06,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:29:12,300 INFO L124 PetriNetUnfolderBase]: 12084/20358 cut-off events. [2024-06-28 01:29:12,300 INFO L125 PetriNetUnfolderBase]: For 879235/879255 co-relation queries the response was YES. [2024-06-28 01:29:12,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147181 conditions, 20358 events. 12084/20358 cut-off events. For 879235/879255 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 159955 event pairs, 4333 based on Foata normal form. 60/19870 useless extension candidates. Maximal degree in co-relation 147055. Up to 16213 conditions per place. [2024-06-28 01:29:12,573 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 600 selfloop transitions, 94 changer transitions 0/704 dead transitions. [2024-06-28 01:29:12,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 704 transitions, 11333 flow [2024-06-28 01:29:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:29:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:29:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 285 transitions. [2024-06-28 01:29:12,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5287569573283859 [2024-06-28 01:29:12,575 INFO L175 Difference]: Start difference. First operand has 302 places, 626 transitions, 9475 flow. Second operand 11 states and 285 transitions. [2024-06-28 01:29:12,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 704 transitions, 11333 flow [2024-06-28 01:29:14,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 704 transitions, 11038 flow, removed 83 selfloop flow, removed 8 redundant places. [2024-06-28 01:29:14,791 INFO L231 Difference]: Finished difference. Result has 305 places, 626 transitions, 9400 flow [2024-06-28 01:29:14,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9196, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9400, PETRI_PLACES=305, PETRI_TRANSITIONS=626} [2024-06-28 01:29:14,793 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 250 predicate places. [2024-06-28 01:29:14,793 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 626 transitions, 9400 flow [2024-06-28 01:29:14,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:29:14,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:29:14,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:29:14,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-28 01:29:14,794 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:29:14,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:29:14,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1849779000, now seen corresponding path program 1 times [2024-06-28 01:29:14,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:29:14,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499118722] [2024-06-28 01:29:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:29:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:29:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:29:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:29:15,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:29:15,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499118722] [2024-06-28 01:29:15,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499118722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:29:15,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:29:15,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:29:15,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869190971] [2024-06-28 01:29:15,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:29:15,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:29:15,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:29:15,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:29:15,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:29:15,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-06-28 01:29:15,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 626 transitions, 9400 flow. Second operand has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:29:15,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:29:15,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-06-28 01:29:15,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:29:20,746 INFO L124 PetriNetUnfolderBase]: 11616/19777 cut-off events. [2024-06-28 01:29:20,746 INFO L125 PetriNetUnfolderBase]: For 791524/791764 co-relation queries the response was YES. [2024-06-28 01:29:20,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141679 conditions, 19777 events. 11616/19777 cut-off events. For 791524/791764 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 157242 event pairs, 4427 based on Foata normal form. 237/19402 useless extension candidates. Maximal degree in co-relation 141552. Up to 16503 conditions per place. [2024-06-28 01:29:21,028 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 604 selfloop transitions, 67 changer transitions 0/696 dead transitions. [2024-06-28 01:29:21,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 696 transitions, 11444 flow [2024-06-28 01:29:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:29:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:29:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2024-06-28 01:29:21,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192743764172335 [2024-06-28 01:29:21,030 INFO L175 Difference]: Start difference. First operand has 305 places, 626 transitions, 9400 flow. Second operand 9 states and 229 transitions. [2024-06-28 01:29:21,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 696 transitions, 11444 flow [2024-06-28 01:29:22,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 696 transitions, 11218 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-28 01:29:22,916 INFO L231 Difference]: Finished difference. Result has 307 places, 652 transitions, 9874 flow [2024-06-28 01:29:22,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9216, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9874, PETRI_PLACES=307, PETRI_TRANSITIONS=652} [2024-06-28 01:29:22,917 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 252 predicate places. [2024-06-28 01:29:22,917 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 652 transitions, 9874 flow [2024-06-28 01:29:22,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:29:22,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:29:22,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:29:22,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-28 01:29:22,918 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:29:22,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:29:22,918 INFO L85 PathProgramCache]: Analyzing trace with hash 44316969, now seen corresponding path program 6 times [2024-06-28 01:29:22,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:29:22,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805115296] [2024-06-28 01:29:22,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:29:22,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:29:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:29:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:29:24,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:29:24,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805115296] [2024-06-28 01:29:24,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805115296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:29:24,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:29:24,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:29:24,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504604706] [2024-06-28 01:29:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:29:24,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:29:24,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:29:24,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:29:24,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:29:24,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:29:24,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 652 transitions, 9874 flow. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:29:24,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:29:24,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:29:24,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:29:30,091 INFO L124 PetriNetUnfolderBase]: 13579/23020 cut-off events. [2024-06-28 01:29:30,092 INFO L125 PetriNetUnfolderBase]: For 962107/962129 co-relation queries the response was YES. [2024-06-28 01:29:30,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167089 conditions, 23020 events. 13579/23020 cut-off events. For 962107/962129 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 185706 event pairs, 4839 based on Foata normal form. 62/22443 useless extension candidates. Maximal degree in co-relation 166959. Up to 17863 conditions per place. [2024-06-28 01:29:30,411 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 624 selfloop transitions, 162 changer transitions 0/796 dead transitions. [2024-06-28 01:29:30,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 796 transitions, 13302 flow [2024-06-28 01:29:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:29:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:29:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 285 transitions. [2024-06-28 01:29:30,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5287569573283859 [2024-06-28 01:29:30,413 INFO L175 Difference]: Start difference. First operand has 307 places, 652 transitions, 9874 flow. Second operand 11 states and 285 transitions. [2024-06-28 01:29:30,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 796 transitions, 13302 flow [2024-06-28 01:29:32,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 796 transitions, 13066 flow, removed 65 selfloop flow, removed 5 redundant places. [2024-06-28 01:29:32,677 INFO L231 Difference]: Finished difference. Result has 316 places, 716 transitions, 11515 flow [2024-06-28 01:29:32,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9702, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11515, PETRI_PLACES=316, PETRI_TRANSITIONS=716} [2024-06-28 01:29:32,678 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 261 predicate places. [2024-06-28 01:29:32,678 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 716 transitions, 11515 flow [2024-06-28 01:29:32,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:29:32,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:29:32,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:29:32,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-28 01:29:32,678 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:29:32,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:29:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash -141302853, now seen corresponding path program 7 times [2024-06-28 01:29:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:29:32,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369585556] [2024-06-28 01:29:32,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:29:32,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:29:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:29:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:29:33,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:29:33,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369585556] [2024-06-28 01:29:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369585556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:29:33,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:29:33,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:29:33,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602154803] [2024-06-28 01:29:33,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:29:33,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:29:33,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:29:33,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:29:33,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:29:33,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-06-28 01:29:33,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 716 transitions, 11515 flow. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:29:33,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:29:33,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-06-28 01:29:33,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand