./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix003.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/mix003.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix003.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 14:22:54,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:22:54,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:22:54,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:22:54,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:22:54,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:22:54,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:22:54,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:22:54,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:22:54,199 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:22:54,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:22:54,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:22:54,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:22:54,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:22:54,202 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:22:54,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:22:54,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:22:54,202 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:22:54,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:22:54,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:22:54,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:22:54,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:22:54,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:22:54,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:22:54,204 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:22:54,204 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:22:54,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:22:54,204 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:22:54,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:22:54,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:22:54,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:22:54,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:22:54,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:22:54,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:22:54,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:22:54,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:22:54,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:22:54,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:22:54,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:22:54,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:22:54,207 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:22:54,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:22:54,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:22:54,208 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 14:22:54,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:22:54,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:22:54,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:22:54,445 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:22:54,445 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:22:54,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2024-06-14 14:22:55,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:22:55,678 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:22:55,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2024-06-14 14:22:55,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f545d2694/4eb4eb69a7c94f15a1f038a40bb167ba/FLAGc2dcf03e7 [2024-06-14 14:22:55,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f545d2694/4eb4eb69a7c94f15a1f038a40bb167ba [2024-06-14 14:22:55,699 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:22:55,702 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:22:55,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix003.oepc.yml/witness.yml [2024-06-14 14:22:55,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:22:55,848 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:22:55,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:22:55,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:22:55,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:22:55,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:22:55" (1/2) ... [2024-06-14 14:22:55,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3cd5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:55, skipping insertion in model container [2024-06-14 14:22:55,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:22:55" (1/2) ... [2024-06-14 14:22:55,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6f6368f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:55, skipping insertion in model container [2024-06-14 14:22:55,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:55" (2/2) ... [2024-06-14 14:22:55,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3cd5b0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:55, skipping insertion in model container [2024-06-14 14:22:55,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:55" (2/2) ... [2024-06-14 14:22:55,857 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:22:55,949 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:22:55,951 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 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 || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0) [2024-06-14 14:22:55,952 INFO L97 edCorrectnessWitness]: Location invariant before [L850-L850] (((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 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 || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0) [2024-06-14 14:22:55,953 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] (((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 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 || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0) [2024-06-14 14:22:55,953 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:22:55,953 INFO L106 edCorrectnessWitness]: ghost_update [L846-L846] multithreaded = 1; [2024-06-14 14:22:55,995 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:22:56,295 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:22:56,302 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:22:56,713 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:22:56,746 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:22:56,746 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:56 WrapperNode [2024-06-14 14:22:56,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:22:56,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:22:56,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:22:56,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:22:56,753 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 14.06 02:22:56" (1/1) ... [2024-06-14 14:22:56,796 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 14.06 02:22:56" (1/1) ... [2024-06-14 14:22:56,910 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2024-06-14 14:22:56,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:22:56,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:22:56,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:22:56,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:22:56,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:56" (1/1) ... [2024-06-14 14:22:56,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:56" (1/1) ... [2024-06-14 14:22:56,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:56" (1/1) ... [2024-06-14 14:22:57,006 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-14 14:22:57,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:56" (1/1) ... [2024-06-14 14:22:57,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:56" (1/1) ... [2024-06-14 14:22:57,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:56" (1/1) ... [2024-06-14 14:22:57,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:56" (1/1) ... [2024-06-14 14:22:57,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:56" (1/1) ... [2024-06-14 14:22:57,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:56" (1/1) ... [2024-06-14 14:22:57,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:22:57,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:22:57,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:22:57,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:22:57,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:56" (1/1) ... [2024-06-14 14:22:57,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:22:57,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:57,177 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-14 14:22:57,188 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-14 14:22:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:22:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:22:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 14:22:57,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 14:22:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 14:22:57,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 14:22:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 14:22:57,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 14:22:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:22:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:22:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:22:57,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:22:57,207 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:22:57,357 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:22:57,359 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:22:58,593 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:22:58,595 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:22:58,940 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:22:58,940 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 14:22:58,941 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:22:58 BoogieIcfgContainer [2024-06-14 14:22:58,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:22:58,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:22:58,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:22:58,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:22:58,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:22:55" (1/4) ... [2024-06-14 14:22:58,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe7a0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:22:58, skipping insertion in model container [2024-06-14 14:22:58,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:55" (2/4) ... [2024-06-14 14:22:58,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe7a0a3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:22:58, skipping insertion in model container [2024-06-14 14:22:58,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:56" (3/4) ... [2024-06-14 14:22:58,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe7a0a3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:22:58, skipping insertion in model container [2024-06-14 14:22:58,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:22:58" (4/4) ... [2024-06-14 14:22:58,949 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2024-06-14 14:22:58,962 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:22:58,963 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 14:22:58,963 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:22:59,076 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 14:22:59,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow [2024-06-14 14:22:59,201 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2024-06-14 14:22:59,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:59,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 14:22:59,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow [2024-06-14 14:22:59,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow [2024-06-14 14:22:59,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:59,229 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;@3913e803, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:59,229 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 14:22:59,237 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:59,238 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 14:22:59,238 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:59,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:59,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 14:22:59,239 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:22:59,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1094158895, now seen corresponding path program 1 times [2024-06-14 14:22:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:59,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317264650] [2024-06-14 14:22:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:59,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:07,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:07,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317264650] [2024-06-14 14:23:07,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317264650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:07,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:07,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:23:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581298271] [2024-06-14 14:23:07,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:07,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:23:07,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:07,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:23:07,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:23:07,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-14 14:23:07,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:07,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:07,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-14 14:23:07,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:08,172 INFO L124 PetriNetUnfolderBase]: 1116/1767 cut-off events. [2024-06-14 14:23:08,173 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-14 14:23:08,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3520 conditions, 1767 events. 1116/1767 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8825 event pairs, 765 based on Foata normal form. 1/1723 useless extension candidates. Maximal degree in co-relation 3505. Up to 1676 conditions per place. [2024-06-14 14:23:08,184 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 33 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-14 14:23:08,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 177 flow [2024-06-14 14:23:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:23:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:23:08,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-14 14:23:08,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6124031007751938 [2024-06-14 14:23:08,194 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 79 transitions. [2024-06-14 14:23:08,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 177 flow [2024-06-14 14:23:08,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 14:23:08,198 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow [2024-06-14 14:23:08,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-14 14:23:08,202 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2024-06-14 14:23:08,202 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow [2024-06-14 14:23:08,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:08,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:08,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:08,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:23:08,203 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:23:08,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash 780326320, now seen corresponding path program 1 times [2024-06-14 14:23:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:08,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378976376] [2024-06-14 14:23:08,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:14,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:14,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378976376] [2024-06-14 14:23:14,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378976376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:14,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:14,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:23:14,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317513426] [2024-06-14 14:23:14,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:14,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:23:14,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:14,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:23:14,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:23:14,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-14 14:23:14,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:14,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:14,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-14 14:23:14,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:15,207 INFO L124 PetriNetUnfolderBase]: 1110/1774 cut-off events. [2024-06-14 14:23:15,207 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2024-06-14 14:23:15,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3997 conditions, 1774 events. 1110/1774 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8876 event pairs, 641 based on Foata normal form. 3/1768 useless extension candidates. Maximal degree in co-relation 3982. Up to 1652 conditions per place. [2024-06-14 14:23:15,218 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 40 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2024-06-14 14:23:15,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 244 flow [2024-06-14 14:23:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:23:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:23:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-06-14 14:23:15,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5930232558139535 [2024-06-14 14:23:15,222 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 102 transitions. [2024-06-14 14:23:15,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 244 flow [2024-06-14 14:23:15,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:23:15,226 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow [2024-06-14 14:23:15,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-06-14 14:23:15,226 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2024-06-14 14:23:15,227 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow [2024-06-14 14:23:15,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:15,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:15,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:15,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:23:15,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:23:15,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:15,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1725644401, now seen corresponding path program 1 times [2024-06-14 14:23:15,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:15,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569443194] [2024-06-14 14:23:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:15,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:22,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-14 14:23:22,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:22,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569443194] [2024-06-14 14:23:22,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569443194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:22,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:22,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:23:22,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514343624] [2024-06-14 14:23:22,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:22,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:23:22,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:22,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:23:22,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:23:22,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-14 14:23:22,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:22,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:22,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-14 14:23:22,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:24,089 INFO L124 PetriNetUnfolderBase]: 1345/2123 cut-off events. [2024-06-14 14:23:24,089 INFO L125 PetriNetUnfolderBase]: For 1153/1153 co-relation queries the response was YES. [2024-06-14 14:23:24,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5304 conditions, 2123 events. 1345/2123 cut-off events. For 1153/1153 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10686 event pairs, 592 based on Foata normal form. 3/2114 useless extension candidates. Maximal degree in co-relation 5287. Up to 1965 conditions per place. [2024-06-14 14:23:24,100 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 55 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2024-06-14 14:23:24,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 378 flow [2024-06-14 14:23:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:23:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:23:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-06-14 14:23:24,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5542635658914729 [2024-06-14 14:23:24,103 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 6 states and 143 transitions. [2024-06-14 14:23:24,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 378 flow [2024-06-14 14:23:24,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 358 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-14 14:23:24,105 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 198 flow [2024-06-14 14:23:24,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-06-14 14:23:24,106 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2024-06-14 14:23:24,106 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 198 flow [2024-06-14 14:23:24,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:24,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:24,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:24,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:23:24,107 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:23:24,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1955367603, now seen corresponding path program 1 times [2024-06-14 14:23:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:24,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621084188] [2024-06-14 14:23:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:30,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:30,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621084188] [2024-06-14 14:23:30,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621084188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:30,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:30,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:23:30,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081834449] [2024-06-14 14:23:30,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:30,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:23:30,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:30,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:23:30,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:23:31,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-14 14:23:31,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:31,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:31,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-14 14:23:31,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:32,226 INFO L124 PetriNetUnfolderBase]: 1336/2104 cut-off events. [2024-06-14 14:23:32,227 INFO L125 PetriNetUnfolderBase]: For 2265/2265 co-relation queries the response was YES. [2024-06-14 14:23:32,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5875 conditions, 2104 events. 1336/2104 cut-off events. For 2265/2265 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10519 event pairs, 450 based on Foata normal form. 6/2096 useless extension candidates. Maximal degree in co-relation 5856. Up to 1920 conditions per place. [2024-06-14 14:23:32,237 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 59 selfloop transitions, 15 changer transitions 0/80 dead transitions. [2024-06-14 14:23:32,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 438 flow [2024-06-14 14:23:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-06-14 14:23:32,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2024-06-14 14:23:32,239 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 198 flow. Second operand 7 states and 161 transitions. [2024-06-14 14:23:32,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 438 flow [2024-06-14 14:23:32,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 410 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:23:32,242 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 219 flow [2024-06-14 14:23:32,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-14 14:23:32,243 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2024-06-14 14:23:32,243 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 219 flow [2024-06-14 14:23:32,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:32,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:32,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:32,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:23:32,244 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:23:32,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:32,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1646147003, now seen corresponding path program 1 times [2024-06-14 14:23:32,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:32,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920554236] [2024-06-14 14:23:32,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:40,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:40,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920554236] [2024-06-14 14:23:40,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920554236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:40,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:40,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:23:40,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286835488] [2024-06-14 14:23:40,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:40,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:23:40,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:40,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:23:40,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:23:40,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:23:40,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:40,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:40,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:23:40,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:41,816 INFO L124 PetriNetUnfolderBase]: 1627/2519 cut-off events. [2024-06-14 14:23:41,816 INFO L125 PetriNetUnfolderBase]: For 3937/3937 co-relation queries the response was YES. [2024-06-14 14:23:41,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7428 conditions, 2519 events. 1627/2519 cut-off events. For 3937/3937 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12328 event pairs, 689 based on Foata normal form. 2/2519 useless extension candidates. Maximal degree in co-relation 7408. Up to 2407 conditions per place. [2024-06-14 14:23:41,828 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 48 selfloop transitions, 8 changer transitions 0/61 dead transitions. [2024-06-14 14:23:41,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 375 flow [2024-06-14 14:23:41,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:23:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:23:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-06-14 14:23:41,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4511627906976744 [2024-06-14 14:23:41,829 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 219 flow. Second operand 5 states and 97 transitions. [2024-06-14 14:23:41,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 375 flow [2024-06-14 14:23:41,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 336 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 14:23:41,832 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 226 flow [2024-06-14 14:23:41,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-06-14 14:23:41,833 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2024-06-14 14:23:41,833 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 226 flow [2024-06-14 14:23:41,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:41,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:41,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:41,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:23:41,834 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:23:41,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:41,834 INFO L85 PathProgramCache]: Analyzing trace with hash -518880449, now seen corresponding path program 1 times [2024-06-14 14:23:41,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:41,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836440656] [2024-06-14 14:23:41,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:41,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:50,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:50,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836440656] [2024-06-14 14:23:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836440656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:50,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:50,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:23:50,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044696594] [2024-06-14 14:23:50,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:50,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:23:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:50,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:23:50,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:23:51,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:23:51,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:51,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:51,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:23:51,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:52,617 INFO L124 PetriNetUnfolderBase]: 1617/2512 cut-off events. [2024-06-14 14:23:52,617 INFO L125 PetriNetUnfolderBase]: For 5705/5705 co-relation queries the response was YES. [2024-06-14 14:23:52,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7870 conditions, 2512 events. 1617/2512 cut-off events. For 5705/5705 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12362 event pairs, 927 based on Foata normal form. 4/2500 useless extension candidates. Maximal degree in co-relation 7848. Up to 2375 conditions per place. [2024-06-14 14:23:52,630 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 52 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2024-06-14 14:23:52,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 425 flow [2024-06-14 14:23:52,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-14 14:23:52,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2024-06-14 14:23:52,632 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 226 flow. Second operand 7 states and 126 transitions. [2024-06-14 14:23:52,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 425 flow [2024-06-14 14:23:52,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 401 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 14:23:52,635 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 278 flow [2024-06-14 14:23:52,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-06-14 14:23:52,635 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2024-06-14 14:23:52,635 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 278 flow [2024-06-14 14:23:52,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:52,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:52,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:52,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:23:52,636 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:23:52,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:52,637 INFO L85 PathProgramCache]: Analyzing trace with hash -33026454, now seen corresponding path program 1 times [2024-06-14 14:23:52,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:52,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317248906] [2024-06-14 14:23:52,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:52,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:05,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317248906] [2024-06-14 14:24:05,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317248906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:05,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:05,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:24:05,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261193863] [2024-06-14 14:24:05,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:05,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:24:05,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:05,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:24:05,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:24:06,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:24:06,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:06,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:06,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:24:06,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:07,587 INFO L124 PetriNetUnfolderBase]: 1650/2552 cut-off events. [2024-06-14 14:24:07,587 INFO L125 PetriNetUnfolderBase]: For 7677/7683 co-relation queries the response was YES. [2024-06-14 14:24:07,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8631 conditions, 2552 events. 1650/2552 cut-off events. For 7677/7683 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12536 event pairs, 872 based on Foata normal form. 6/2555 useless extension candidates. Maximal degree in co-relation 8607. Up to 2393 conditions per place. [2024-06-14 14:24:07,599 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 63 selfloop transitions, 24 changer transitions 0/92 dead transitions. [2024-06-14 14:24:07,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 635 flow [2024-06-14 14:24:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:24:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:24:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-06-14 14:24:07,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4684385382059801 [2024-06-14 14:24:07,600 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 278 flow. Second operand 7 states and 141 transitions. [2024-06-14 14:24:07,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 635 flow [2024-06-14 14:24:07,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 601 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 14:24:07,604 INFO L231 Difference]: Finished difference. Result has 65 places, 69 transitions, 417 flow [2024-06-14 14:24:07,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=417, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2024-06-14 14:24:07,605 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2024-06-14 14:24:07,605 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 417 flow [2024-06-14 14:24:07,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:07,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:07,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:07,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:24:07,606 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:24:07,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1088854480, now seen corresponding path program 2 times [2024-06-14 14:24:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:07,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229794598] [2024-06-14 14:24:07,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:18,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:18,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229794598] [2024-06-14 14:24:18,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229794598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:18,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:18,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:24:18,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256515357] [2024-06-14 14:24:18,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:18,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:24:18,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:18,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:24:18,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:24:18,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:24:18,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 417 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:18,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:18,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:24:18,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:19,999 INFO L124 PetriNetUnfolderBase]: 1668/2579 cut-off events. [2024-06-14 14:24:20,000 INFO L125 PetriNetUnfolderBase]: For 10242/10248 co-relation queries the response was YES. [2024-06-14 14:24:20,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9440 conditions, 2579 events. 1668/2579 cut-off events. For 10242/10248 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12705 event pairs, 872 based on Foata normal form. 7/2583 useless extension candidates. Maximal degree in co-relation 9413. Up to 2413 conditions per place. [2024-06-14 14:24:20,015 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 60 selfloop transitions, 29 changer transitions 0/94 dead transitions. [2024-06-14 14:24:20,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 94 transitions, 743 flow [2024-06-14 14:24:20,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:24:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:24:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-14 14:24:20,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4689922480620155 [2024-06-14 14:24:20,021 INFO L175 Difference]: Start difference. First operand has 65 places, 69 transitions, 417 flow. Second operand 6 states and 121 transitions. [2024-06-14 14:24:20,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 94 transitions, 743 flow [2024-06-14 14:24:20,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 714 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-14 14:24:20,029 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 523 flow [2024-06-14 14:24:20,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=69, PETRI_TRANSITIONS=75} [2024-06-14 14:24:20,030 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2024-06-14 14:24:20,030 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 523 flow [2024-06-14 14:24:20,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:20,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:20,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:20,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:24:20,031 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:24:20,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:20,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1410055090, now seen corresponding path program 3 times [2024-06-14 14:24:20,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:20,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408273942] [2024-06-14 14:24:20,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:20,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:31,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:31,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408273942] [2024-06-14 14:24:31,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408273942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:31,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:31,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:24:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351993834] [2024-06-14 14:24:31,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:31,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:24:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:31,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:24:31,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:24:31,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:24:31,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 523 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:31,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:31,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:24:31,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:32,658 INFO L124 PetriNetUnfolderBase]: 1660/2575 cut-off events. [2024-06-14 14:24:32,658 INFO L125 PetriNetUnfolderBase]: For 11672/11672 co-relation queries the response was YES. [2024-06-14 14:24:32,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9597 conditions, 2575 events. 1660/2575 cut-off events. For 11672/11672 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12642 event pairs, 918 based on Foata normal form. 3/2564 useless extension candidates. Maximal degree in co-relation 9568. Up to 2445 conditions per place. [2024-06-14 14:24:32,670 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 68 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2024-06-14 14:24:32,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 89 transitions, 735 flow [2024-06-14 14:24:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:24:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:24:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-14 14:24:32,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4152823920265781 [2024-06-14 14:24:32,672 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 523 flow. Second operand 7 states and 125 transitions. [2024-06-14 14:24:32,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 89 transitions, 735 flow [2024-06-14 14:24:32,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 89 transitions, 639 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-14 14:24:32,684 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 470 flow [2024-06-14 14:24:32,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=470, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2024-06-14 14:24:32,685 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2024-06-14 14:24:32,685 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 470 flow [2024-06-14 14:24:32,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:32,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:32,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:32,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:24:32,685 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:24:32,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:32,686 INFO L85 PathProgramCache]: Analyzing trace with hash 50014560, now seen corresponding path program 1 times [2024-06-14 14:24:32,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:32,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47986988] [2024-06-14 14:24:32,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:32,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:46,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:46,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47986988] [2024-06-14 14:24:46,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47986988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:46,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:46,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:24:46,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106511442] [2024-06-14 14:24:46,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:46,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:24:46,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:46,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:24:46,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:24:46,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:24:46,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 470 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:46,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:46,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:24:46,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:47,810 INFO L124 PetriNetUnfolderBase]: 1709/2638 cut-off events. [2024-06-14 14:24:47,810 INFO L125 PetriNetUnfolderBase]: For 11719/11721 co-relation queries the response was YES. [2024-06-14 14:24:47,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9800 conditions, 2638 events. 1709/2638 cut-off events. For 11719/11721 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12934 event pairs, 834 based on Foata normal form. 4/2630 useless extension candidates. Maximal degree in co-relation 9771. Up to 2467 conditions per place. [2024-06-14 14:24:47,821 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 90 selfloop transitions, 30 changer transitions 0/125 dead transitions. [2024-06-14 14:24:47,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 125 transitions, 968 flow [2024-06-14 14:24:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:24:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:24:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-14 14:24:47,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-14 14:24:47,822 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 470 flow. Second operand 10 states and 190 transitions. [2024-06-14 14:24:47,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 125 transitions, 968 flow [2024-06-14 14:24:47,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 912 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 14:24:47,831 INFO L231 Difference]: Finished difference. Result has 77 places, 90 transitions, 612 flow [2024-06-14 14:24:47,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=612, PETRI_PLACES=77, PETRI_TRANSITIONS=90} [2024-06-14 14:24:47,833 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2024-06-14 14:24:47,835 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 90 transitions, 612 flow [2024-06-14 14:24:47,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:47,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:47,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:47,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 14:24:47,836 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:24:47,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1034000860, now seen corresponding path program 2 times [2024-06-14 14:24:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:47,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112463835] [2024-06-14 14:24:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:47,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:03,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-14 14:25:03,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:03,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112463835] [2024-06-14 14:25:03,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112463835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:03,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:03,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:25:03,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952738432] [2024-06-14 14:25:03,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:03,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:25:03,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:03,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:25:03,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:25:03,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:25:03,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 90 transitions, 612 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:03,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:03,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:25:03,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:05,270 INFO L124 PetriNetUnfolderBase]: 1753/2718 cut-off events. [2024-06-14 14:25:05,270 INFO L125 PetriNetUnfolderBase]: For 15001/15003 co-relation queries the response was YES. [2024-06-14 14:25:05,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10849 conditions, 2718 events. 1753/2718 cut-off events. For 15001/15003 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13431 event pairs, 794 based on Foata normal form. 5/2716 useless extension candidates. Maximal degree in co-relation 10818. Up to 2531 conditions per place. [2024-06-14 14:25:05,284 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 90 selfloop transitions, 36 changer transitions 0/131 dead transitions. [2024-06-14 14:25:05,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 131 transitions, 1107 flow [2024-06-14 14:25:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:25:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:25:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-14 14:25:05,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45058139534883723 [2024-06-14 14:25:05,286 INFO L175 Difference]: Start difference. First operand has 77 places, 90 transitions, 612 flow. Second operand 8 states and 155 transitions. [2024-06-14 14:25:05,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 131 transitions, 1107 flow [2024-06-14 14:25:05,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 131 transitions, 1010 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-14 14:25:05,298 INFO L231 Difference]: Finished difference. Result has 82 places, 107 transitions, 797 flow [2024-06-14 14:25:05,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=797, PETRI_PLACES=82, PETRI_TRANSITIONS=107} [2024-06-14 14:25:05,298 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places. [2024-06-14 14:25:05,299 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 107 transitions, 797 flow [2024-06-14 14:25:05,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:05,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:05,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:05,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 14:25:05,299 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:25:05,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:05,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1569897900, now seen corresponding path program 1 times [2024-06-14 14:25:05,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:05,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999776385] [2024-06-14 14:25:05,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:05,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:20,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:20,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999776385] [2024-06-14 14:25:20,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999776385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:20,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:20,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:25:20,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463733113] [2024-06-14 14:25:20,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:20,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:25:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:20,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:25:20,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:25:20,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:25:20,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 107 transitions, 797 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:20,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:20,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:25:20,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:21,866 INFO L124 PetriNetUnfolderBase]: 1795/2766 cut-off events. [2024-06-14 14:25:21,866 INFO L125 PetriNetUnfolderBase]: For 18012/18020 co-relation queries the response was YES. [2024-06-14 14:25:21,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11440 conditions, 2766 events. 1795/2766 cut-off events. For 18012/18020 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13606 event pairs, 806 based on Foata normal form. 7/2768 useless extension candidates. Maximal degree in co-relation 11406. Up to 2536 conditions per place. [2024-06-14 14:25:21,881 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 105 selfloop transitions, 39 changer transitions 0/149 dead transitions. [2024-06-14 14:25:21,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 149 transitions, 1337 flow [2024-06-14 14:25:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:25:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:25:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-14 14:25:21,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738372093023256 [2024-06-14 14:25:21,882 INFO L175 Difference]: Start difference. First operand has 82 places, 107 transitions, 797 flow. Second operand 8 states and 163 transitions. [2024-06-14 14:25:21,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 149 transitions, 1337 flow [2024-06-14 14:25:21,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 149 transitions, 1270 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-14 14:25:21,896 INFO L231 Difference]: Finished difference. Result has 89 places, 120 transitions, 952 flow [2024-06-14 14:25:21,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=952, PETRI_PLACES=89, PETRI_TRANSITIONS=120} [2024-06-14 14:25:21,897 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 45 predicate places. [2024-06-14 14:25:21,897 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 120 transitions, 952 flow [2024-06-14 14:25:21,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:21,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:21,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:21,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:25:21,898 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:25:21,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1033996210, now seen corresponding path program 3 times [2024-06-14 14:25:21,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:21,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084564135] [2024-06-14 14:25:21,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:21,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:37,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:37,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084564135] [2024-06-14 14:25:37,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084564135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:37,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:37,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:25:37,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11913202] [2024-06-14 14:25:37,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:37,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:25:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:25:37,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:25:37,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:25:37,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 120 transitions, 952 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:37,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:37,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:25:37,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:39,157 INFO L124 PetriNetUnfolderBase]: 1816/2821 cut-off events. [2024-06-14 14:25:39,157 INFO L125 PetriNetUnfolderBase]: For 21911/21914 co-relation queries the response was YES. [2024-06-14 14:25:39,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12590 conditions, 2821 events. 1816/2821 cut-off events. For 21911/21914 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14012 event pairs, 769 based on Foata normal form. 4/2822 useless extension candidates. Maximal degree in co-relation 12553. Up to 2524 conditions per place. [2024-06-14 14:25:39,169 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 86 selfloop transitions, 67 changer transitions 0/158 dead transitions. [2024-06-14 14:25:39,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 158 transitions, 1543 flow [2024-06-14 14:25:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:25:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:25:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-14 14:25:39,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680232558139535 [2024-06-14 14:25:39,171 INFO L175 Difference]: Start difference. First operand has 89 places, 120 transitions, 952 flow. Second operand 8 states and 161 transitions. [2024-06-14 14:25:39,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 158 transitions, 1543 flow [2024-06-14 14:25:39,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 158 transitions, 1501 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-14 14:25:39,186 INFO L231 Difference]: Finished difference. Result has 95 places, 131 transitions, 1202 flow [2024-06-14 14:25:39,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1202, PETRI_PLACES=95, PETRI_TRANSITIONS=131} [2024-06-14 14:25:39,186 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2024-06-14 14:25:39,186 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 131 transitions, 1202 flow [2024-06-14 14:25:39,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:39,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:39,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:39,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:25:39,187 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:25:39,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash -513677800, now seen corresponding path program 4 times [2024-06-14 14:25:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:39,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500692557] [2024-06-14 14:25:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:50,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-14 14:25:50,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:50,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500692557] [2024-06-14 14:25:50,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500692557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:50,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:50,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:25:50,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953220454] [2024-06-14 14:25:50,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:50,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:25:50,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:50,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:25:50,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:25:51,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:25:51,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 131 transitions, 1202 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:51,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:51,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:25:51,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:52,748 INFO L124 PetriNetUnfolderBase]: 1808/2793 cut-off events. [2024-06-14 14:25:52,749 INFO L125 PetriNetUnfolderBase]: For 26542/26544 co-relation queries the response was YES. [2024-06-14 14:25:52,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13268 conditions, 2793 events. 1808/2793 cut-off events. For 26542/26544 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13799 event pairs, 803 based on Foata normal form. 5/2787 useless extension candidates. Maximal degree in co-relation 13228. Up to 2590 conditions per place. [2024-06-14 14:25:52,763 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 106 selfloop transitions, 42 changer transitions 0/153 dead transitions. [2024-06-14 14:25:52,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 153 transitions, 1596 flow [2024-06-14 14:25:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:25:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:25:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-14 14:25:52,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45514950166112955 [2024-06-14 14:25:52,765 INFO L175 Difference]: Start difference. First operand has 95 places, 131 transitions, 1202 flow. Second operand 7 states and 137 transitions. [2024-06-14 14:25:52,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 153 transitions, 1596 flow [2024-06-14 14:25:52,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 153 transitions, 1508 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-06-14 14:25:52,787 INFO L231 Difference]: Finished difference. Result has 99 places, 131 transitions, 1224 flow [2024-06-14 14:25:52,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1224, PETRI_PLACES=99, PETRI_TRANSITIONS=131} [2024-06-14 14:25:52,788 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2024-06-14 14:25:52,788 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 131 transitions, 1224 flow [2024-06-14 14:25:52,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:52,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:52,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:52,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 14:25:52,788 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:25:52,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash -605248448, now seen corresponding path program 2 times [2024-06-14 14:25:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132029607] [2024-06-14 14:25:52,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:52,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:05,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:05,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132029607] [2024-06-14 14:26:05,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132029607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:05,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:05,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:26:05,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926007131] [2024-06-14 14:26:05,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:05,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:26:05,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:05,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:26:05,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:26:05,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:26:05,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 131 transitions, 1224 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:05,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:05,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:26:05,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:07,155 INFO L124 PetriNetUnfolderBase]: 1860/2872 cut-off events. [2024-06-14 14:26:07,155 INFO L125 PetriNetUnfolderBase]: For 30708/30713 co-relation queries the response was YES. [2024-06-14 14:26:07,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14022 conditions, 2872 events. 1860/2872 cut-off events. For 30708/30713 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14231 event pairs, 810 based on Foata normal form. 8/2876 useless extension candidates. Maximal degree in co-relation 13980. Up to 2597 conditions per place. [2024-06-14 14:26:07,170 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 116 selfloop transitions, 48 changer transitions 0/169 dead transitions. [2024-06-14 14:26:07,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 169 transitions, 1865 flow [2024-06-14 14:26:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:26:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:26:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2024-06-14 14:26:07,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4717607973421927 [2024-06-14 14:26:07,172 INFO L175 Difference]: Start difference. First operand has 99 places, 131 transitions, 1224 flow. Second operand 7 states and 142 transitions. [2024-06-14 14:26:07,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 169 transitions, 1865 flow [2024-06-14 14:26:07,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 169 transitions, 1757 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 14:26:07,194 INFO L231 Difference]: Finished difference. Result has 99 places, 142 transitions, 1372 flow [2024-06-14 14:26:07,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1372, PETRI_PLACES=99, PETRI_TRANSITIONS=142} [2024-06-14 14:26:07,195 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2024-06-14 14:26:07,195 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 142 transitions, 1372 flow [2024-06-14 14:26:07,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:07,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:07,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:07,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 14:26:07,195 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:26:07,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash -513673150, now seen corresponding path program 5 times [2024-06-14 14:26:07,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:07,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641867408] [2024-06-14 14:26:07,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:19,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:19,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641867408] [2024-06-14 14:26:19,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641867408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:19,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:19,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:26:19,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332714382] [2024-06-14 14:26:19,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:19,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:26:19,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:19,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:26:19,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:26:19,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:26:19,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 142 transitions, 1372 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:19,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:19,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:26:19,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:21,302 INFO L124 PetriNetUnfolderBase]: 1878/2918 cut-off events. [2024-06-14 14:26:21,302 INFO L125 PetriNetUnfolderBase]: For 28729/28732 co-relation queries the response was YES. [2024-06-14 14:26:21,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14359 conditions, 2918 events. 1878/2918 cut-off events. For 28729/28732 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14536 event pairs, 771 based on Foata normal form. 5/2920 useless extension candidates. Maximal degree in co-relation 14317. Up to 2611 conditions per place. [2024-06-14 14:26:21,315 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 97 selfloop transitions, 70 changer transitions 0/172 dead transitions. [2024-06-14 14:26:21,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 172 transitions, 1959 flow [2024-06-14 14:26:21,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:26:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:26:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-14 14:26:21,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-14 14:26:21,317 INFO L175 Difference]: Start difference. First operand has 99 places, 142 transitions, 1372 flow. Second operand 7 states and 140 transitions. [2024-06-14 14:26:21,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 172 transitions, 1959 flow [2024-06-14 14:26:21,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 172 transitions, 1853 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-14 14:26:21,336 INFO L231 Difference]: Finished difference. Result has 102 places, 148 transitions, 1509 flow [2024-06-14 14:26:21,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1509, PETRI_PLACES=102, PETRI_TRANSITIONS=148} [2024-06-14 14:26:21,336 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 58 predicate places. [2024-06-14 14:26:21,336 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 148 transitions, 1509 flow [2024-06-14 14:26:21,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:21,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:21,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:21,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:26:21,337 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:26:21,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:21,338 INFO L85 PathProgramCache]: Analyzing trace with hash 762035684, now seen corresponding path program 6 times [2024-06-14 14:26:21,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:21,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756754175] [2024-06-14 14:26:21,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:21,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:32,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756754175] [2024-06-14 14:26:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756754175] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:32,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:32,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:26:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178067841] [2024-06-14 14:26:32,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:32,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:26:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:32,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:26:32,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:26:32,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:26:32,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 148 transitions, 1509 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:32,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:32,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:26:32,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:34,240 INFO L124 PetriNetUnfolderBase]: 1870/2901 cut-off events. [2024-06-14 14:26:34,240 INFO L125 PetriNetUnfolderBase]: For 28675/28675 co-relation queries the response was YES. [2024-06-14 14:26:34,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14384 conditions, 2901 events. 1870/2901 cut-off events. For 28675/28675 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14434 event pairs, 878 based on Foata normal form. 3/2892 useless extension candidates. Maximal degree in co-relation 14341. Up to 2735 conditions per place. [2024-06-14 14:26:34,256 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 140 selfloop transitions, 21 changer transitions 0/166 dead transitions. [2024-06-14 14:26:34,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 166 transitions, 1919 flow [2024-06-14 14:26:34,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:26:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:26:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-14 14:26:34,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-14 14:26:34,257 INFO L175 Difference]: Start difference. First operand has 102 places, 148 transitions, 1509 flow. Second operand 7 states and 131 transitions. [2024-06-14 14:26:34,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 166 transitions, 1919 flow [2024-06-14 14:26:34,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 166 transitions, 1732 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-14 14:26:34,279 INFO L231 Difference]: Finished difference. Result has 104 places, 148 transitions, 1376 flow [2024-06-14 14:26:34,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1376, PETRI_PLACES=104, PETRI_TRANSITIONS=148} [2024-06-14 14:26:34,279 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places. [2024-06-14 14:26:34,279 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 148 transitions, 1376 flow [2024-06-14 14:26:34,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:34,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:34,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:34,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:26:34,280 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:26:34,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash -428116928, now seen corresponding path program 3 times [2024-06-14 14:26:34,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:34,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179012105] [2024-06-14 14:26:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:34,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:45,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:45,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179012105] [2024-06-14 14:26:45,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179012105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:45,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:45,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:26:45,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916908692] [2024-06-14 14:26:45,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:45,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:26:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:45,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:26:45,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:26:45,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:26:45,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 148 transitions, 1376 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:45,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:45,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:26:45,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:47,448 INFO L124 PetriNetUnfolderBase]: 1906/2954 cut-off events. [2024-06-14 14:26:47,449 INFO L125 PetriNetUnfolderBase]: For 28757/28757 co-relation queries the response was YES. [2024-06-14 14:26:47,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14438 conditions, 2954 events. 1906/2954 cut-off events. For 28757/28757 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14753 event pairs, 880 based on Foata normal form. 6/2948 useless extension candidates. Maximal degree in co-relation 14395. Up to 2730 conditions per place. [2024-06-14 14:26:47,465 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 145 selfloop transitions, 33 changer transitions 0/183 dead transitions. [2024-06-14 14:26:47,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 183 transitions, 2029 flow [2024-06-14 14:26:47,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:26:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:26:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-14 14:26:47,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45514950166112955 [2024-06-14 14:26:47,467 INFO L175 Difference]: Start difference. First operand has 104 places, 148 transitions, 1376 flow. Second operand 7 states and 137 transitions. [2024-06-14 14:26:47,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 183 transitions, 2029 flow [2024-06-14 14:26:47,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 183 transitions, 1934 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-14 14:26:47,488 INFO L231 Difference]: Finished difference. Result has 105 places, 156 transitions, 1471 flow [2024-06-14 14:26:47,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1471, PETRI_PLACES=105, PETRI_TRANSITIONS=156} [2024-06-14 14:26:47,489 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places. [2024-06-14 14:26:47,489 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 156 transitions, 1471 flow [2024-06-14 14:26:47,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:47,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:47,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:47,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 14:26:47,489 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:26:47,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:47,490 INFO L85 PathProgramCache]: Analyzing trace with hash -427879778, now seen corresponding path program 4 times [2024-06-14 14:26:47,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:47,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653727074] [2024-06-14 14:26:47,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:47,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:58,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-14 14:26:58,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:58,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653727074] [2024-06-14 14:26:58,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653727074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:58,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:58,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:26:58,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239193070] [2024-06-14 14:26:58,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:58,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:26:58,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:58,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:26:58,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:26:58,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:26:58,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 156 transitions, 1471 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:58,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:58,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:26:58,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:00,075 INFO L124 PetriNetUnfolderBase]: 1890/2932 cut-off events. [2024-06-14 14:27:00,075 INFO L125 PetriNetUnfolderBase]: For 30955/30955 co-relation queries the response was YES. [2024-06-14 14:27:00,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14504 conditions, 2932 events. 1890/2932 cut-off events. For 30955/30955 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14665 event pairs, 877 based on Foata normal form. 6/2926 useless extension candidates. Maximal degree in co-relation 14460. Up to 2756 conditions per place. [2024-06-14 14:27:00,092 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 152 selfloop transitions, 20 changer transitions 0/177 dead transitions. [2024-06-14 14:27:00,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 177 transitions, 1919 flow [2024-06-14 14:27:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:27:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:27:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-14 14:27:00,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43853820598006643 [2024-06-14 14:27:00,095 INFO L175 Difference]: Start difference. First operand has 105 places, 156 transitions, 1471 flow. Second operand 7 states and 132 transitions. [2024-06-14 14:27:00,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 177 transitions, 1919 flow [2024-06-14 14:27:00,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 177 transitions, 1734 flow, removed 56 selfloop flow, removed 5 redundant places. [2024-06-14 14:27:00,122 INFO L231 Difference]: Finished difference. Result has 107 places, 156 transitions, 1339 flow [2024-06-14 14:27:00,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1339, PETRI_PLACES=107, PETRI_TRANSITIONS=156} [2024-06-14 14:27:00,123 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 63 predicate places. [2024-06-14 14:27:00,123 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 156 transitions, 1339 flow [2024-06-14 14:27:00,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:00,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:00,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:00,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 14:27:00,124 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:27:00,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash -957401917, now seen corresponding path program 1 times [2024-06-14 14:27:00,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:00,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885650606] [2024-06-14 14:27:00,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:00,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:16,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885650606] [2024-06-14 14:27:16,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885650606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:16,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:16,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:27:16,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134700702] [2024-06-14 14:27:16,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:16,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:27:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:16,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:27:16,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:27:16,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:27:16,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 156 transitions, 1339 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-14 14:27:16,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:16,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:27:16,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:17,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([381] L782-->L785: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~y~0=v_~y~0_1, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0][39], [Black: 251#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd3~0 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))) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd0~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 1)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~z$r_buff0_thd3~0 256)) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 107#true, Black: 264#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 137#(and (= ~__unbuffered_cnt~0 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))) (<= 0 (div ~z$r_buff0_thd3~0 256)) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd3~0) ~z$r_buff0_thd0~0) (= ~x~0 1) (<= (+ ~z$r_buff0_thd3~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff0_thd3~0 256)))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~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: 79#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 7#L762true, 22#L785true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~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) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), 222#true, Black: 216#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), 270#true, 285#true, Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 193#true, 16#L851true, Black: 229#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~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) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 95#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~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)), 43#$Ultimate##0true, Black: 169#(and (= ~__unbuffered_cnt~0 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) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$r_buff0_thd1~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P1Thread1of1ForFork2InUse, Black: 240#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), P0Thread1of1ForFork0InUse, 143#true, P2Thread1of1ForFork1InUse, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 58#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (<= (+ ~z$r_buff1_thd0~0 ~z$r_buff0_thd3~0) 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (<= (+ ~z$r_buff1_thd3~0 ~z$r_buff1_thd0~0) 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__unbuffered_p1_EBX~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) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 176#true, Black: 179#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~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))]) [2024-06-14 14:27:17,466 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-14 14:27:17,466 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-14 14:27:17,466 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-14 14:27:17,467 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-14 14:27:17,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L800-->L802: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0][150], [Black: 251#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd3~0 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))) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd0~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 1)), 2#L782true, Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~z$r_buff0_thd3~0 256)) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 107#true, Black: 264#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 137#(and (= ~__unbuffered_cnt~0 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))) (<= 0 (div ~z$r_buff0_thd3~0 256)) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd3~0) ~z$r_buff0_thd0~0) (= ~x~0 1) (<= (+ ~z$r_buff0_thd3~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff0_thd3~0 256)))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~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: 79#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 7#L762true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~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) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), 222#true, Black: 216#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), 270#true, 285#true, Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 193#true, 16#L851true, Black: 229#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~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) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 95#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~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: 169#(and (= ~__unbuffered_cnt~0 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) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$r_buff0_thd1~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 40#L802true, P1Thread1of1ForFork2InUse, Black: 240#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), P0Thread1of1ForFork0InUse, 143#true, P2Thread1of1ForFork1InUse, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 58#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (<= (+ ~z$r_buff1_thd0~0 ~z$r_buff0_thd3~0) 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (<= (+ ~z$r_buff1_thd3~0 ~z$r_buff1_thd0~0) 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__unbuffered_p1_EBX~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) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 176#true, Black: 179#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~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))]) [2024-06-14 14:27:17,518 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-14 14:27:17,518 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-14 14:27:17,518 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-14 14:27:17,518 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-14 14:27:17,520 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([375] L762-->L769: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd1~0_26 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and (not (= (mod v_~z$w_buff1_used~0_41 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd1~0_30 (ite .cse0 0 v_~z$r_buff0_thd1~0_31)) (= v_~z$w_buff0_used~0_51 (ite .cse1 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_40 256) 0)) .cse2) (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse3)) 0 v_~z$r_buff1_thd1~0_26)) (= (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40) (= (ite .cse1 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_23)) v_~z~0_22)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][84], [Black: 251#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd3~0 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))) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd0~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 1)), 20#L769true, 2#L782true, Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~z$r_buff0_thd3~0 256)) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 107#true, Black: 264#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 137#(and (= ~__unbuffered_cnt~0 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))) (<= 0 (div ~z$r_buff0_thd3~0 256)) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd3~0) ~z$r_buff0_thd0~0) (= ~x~0 1) (<= (+ ~z$r_buff0_thd3~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff0_thd3~0 256)))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~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: 79#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~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) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 216#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), 222#true, 270#true, 285#true, Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 193#true, 16#L851true, Black: 229#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~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) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 95#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~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)), 43#$Ultimate##0true, Black: 169#(and (= ~__unbuffered_cnt~0 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) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$r_buff0_thd1~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P1Thread1of1ForFork2InUse, Black: 240#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), P0Thread1of1ForFork0InUse, 143#true, P2Thread1of1ForFork1InUse, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 58#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (<= (+ ~z$r_buff1_thd0~0 ~z$r_buff0_thd3~0) 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (<= (+ ~z$r_buff1_thd3~0 ~z$r_buff1_thd0~0) 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__unbuffered_p1_EBX~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) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 176#true, Black: 179#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~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))]) [2024-06-14 14:27:17,520 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2024-06-14 14:27:17,521 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-14 14:27:17,521 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-14 14:27:17,521 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-14 14:27:17,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([348] L851-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse53 (mod v_~z$r_buff0_thd2~0_13 256)) (.cse61 (mod v_~z$r_buff1_thd0~0_7 256)) (.cse60 (mod v_~z$r_buff1_thd3~0_19 256)) (.cse56 (mod v_~z$r_buff1_thd2~0_11 256)) (.cse57 (mod v_~z$read_delayed~0_6 256)) (.cse49 (mod v_~z$r_buff0_thd3~0_21 256)) (.cse45 (mod v_~z$r_buff0_thd0~0_7 256))) (let ((.cse4 (not (= .cse45 0))) (.cse0 (< v_~x~0_9 0)) (.cse1 (and (not (= v_~x~0_9 1)) (not (= v_~x~0_9 0)))) (.cse2 (< 1 v_~x~0_9)) (.cse5 (< v_~__unbuffered_cnt~0_12 0)) (.cse25 (not (= .cse49 0))) (.cse21 (not (= v_~z$read_delayed_var~0.offset_6 0))) (.cse36 (not (= v_~z$read_delayed_var~0.base_6 0))) (.cse10 (< 1 v_~z$w_buff1~0_13)) (.cse17 (and (not (= v_~z$w_buff1~0_13 1)) (not (= v_~z$w_buff1~0_13 0)))) (.cse37 (< v_~z$w_buff1~0_13 0)) (.cse18 (not (= .cse57 0))) (.cse22 (mod v_~z$flush_delayed~0_9 256)) (.cse6 (and (not (= v_~__unbuffered_p1_EAX~0_7 0)) (not (= v_~__unbuffered_p1_EAX~0_7 1)))) (.cse13 (< v_~__unbuffered_p1_EAX~0_7 0)) (.cse42 (< 1 v_~__unbuffered_p1_EAX~0_7)) (.cse43 (not (= .cse56 0))) (.cse27 (< 1 v_~__unbuffered_p2_EAX~0_7)) (.cse31 (and (not (= v_~__unbuffered_p2_EAX~0_7 1)) (not (= v_~__unbuffered_p2_EAX~0_7 0)))) (.cse39 (< v_~__unbuffered_p2_EAX~0_7 0)) (.cse11 (< 1 v_~z~0_18)) (.cse30 (< v_~z~0_18 0)) (.cse40 (and (not (= v_~z~0_18 1)) (not (= v_~z~0_18 0)))) (.cse16 (and (not (= v_~__unbuffered_p1_EBX~0_7 1)) (not (= v_~__unbuffered_p1_EBX~0_7 0)))) (.cse29 (< v_~__unbuffered_p1_EBX~0_7 0)) (.cse34 (< 1 v_~__unbuffered_p1_EBX~0_7)) (.cse12 (and (not (= v_~z$mem_tmp~0_8 0)) (not (= v_~z$mem_tmp~0_8 1)))) (.cse20 (< v_~z$mem_tmp~0_8 0)) (.cse24 (< 1 v_~z$mem_tmp~0_8)) (.cse19 (and (not (= v_~__unbuffered_p2_EBX~0_7 1)) (not (= v_~__unbuffered_p2_EBX~0_7 0)))) (.cse26 (< 1 v_~__unbuffered_p2_EBX~0_7)) (.cse28 (< v_~__unbuffered_p2_EBX~0_7 0)) (.cse41 (not (= .cse60 0))) (.cse15 (< v_~z$w_buff0~0_14 0)) (.cse35 (< 1 v_~z$w_buff0~0_14)) (.cse38 (and (not (= v_~z$w_buff0~0_14 1)) (not (= v_~z$w_buff0~0_14 0)))) (.cse14 (not (= .cse61 0))) (.cse7 (< v_~__unbuffered_p0_EAX~0_7 0)) (.cse9 (and (not (= v_~__unbuffered_p0_EAX~0_7 1)) (not (= v_~__unbuffered_p0_EAX~0_7 0)))) (.cse44 (< 1 v_~__unbuffered_p0_EAX~0_7)) (.cse33 (not (= .cse53 0))) (.cse8 (< 1 v_~y~0_9)) (.cse23 (< v_~y~0_9 0)) (.cse32 (and (not (= v_~y~0_9 1)) (not (= v_~y~0_9 0)))) (.cse3 (not (= |v_#ghost~multithreaded_7| 0)))) (or (and (or .cse0 .cse1 .cse2) .cse3) (and .cse4 .cse3) (and .cse5 .cse3) (and (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse4 .cse19 .cse20 .cse0 .cse21 .cse1 (not (= .cse22 0)) .cse23 .cse24 .cse2 .cse25 .cse26 .cse5 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) .cse3) (and .cse25 .cse3) (and (or .cse21 .cse36) .cse3) (and (or .cse10 .cse17 .cse37) .cse3) (and .cse18 .cse3) (and (let ((.cse65 (mod v_~main$tmp_guard1~0_6 256)) (.cse54 (mod v_~weak$$choice2~0_14 256)) (.cse55 (mod v_~weak$$choice0~0_7 256))) (let ((.cse46 (+ .cse57 v_~z$w_buff1~0_13)) (.cse58 (+ .cse60 v_~z$w_buff0~0_14)) (.cse62 (+ v_~z$w_buff0~0_14 .cse53)) (.cse75 (+ .cse57 v_~z$w_buff0~0_14)) (.cse70 (+ v_~z$w_buff1~0_13 1)) (.cse79 (+ .cse45 v_~z$w_buff1~0_13)) (.cse78 (+ .cse60 v_~z$w_buff1~0_13)) (.cse77 (+ v_~__unbuffered_p0_EAX~0_7 1)) (.cse64 (+ .cse45 1)) (.cse85 (+ .cse49 v_~z$w_buff0~0_14)) (.cse76 (+ .cse55 1)) (.cse88 (+ v_~z$w_buff1~0_13 .cse53)) (.cse72 (+ .cse57 1)) (.cse90 (+ v_~z$w_buff0~0_14 v_~z$w_buff1~0_13)) (.cse83 (+ .cse49 v_~z$w_buff1~0_13)) (.cse69 (+ .cse22 1)) (.cse52 (+ .cse49 1)) (.cse66 (+ v_~__unbuffered_p1_EAX~0_7 1)) (.cse74 (+ .cse61 1)) (.cse84 (+ v_~z$mem_tmp~0_8 1)) (.cse80 (+ v_~z~0_18 1)) (.cse48 (mod v_~z$r_buff0_thd1~0_14 256)) (.cse51 (+ v_~__unbuffered_p1_EBX~0_7 1)) (.cse50 (+ v_~__unbuffered_cnt~0_12 1)) (.cse89 (+ v_~__unbuffered_p2_EBX~0_7 1)) (.cse86 (+ .cse60 1)) (.cse92 (+ .cse45 v_~z$w_buff0~0_14)) (.cse91 (+ .cse56 v_~z$w_buff1~0_13)) (.cse47 (+ v_~x~0_9 1)) (.cse59 (+ .cse56 1)) (.cse93 (+ .cse61 v_~z$w_buff0~0_14)) (.cse81 (+ v_~__unbuffered_p2_EAX~0_7 1)) (.cse67 (+ .cse54 1)) (.cse82 (+ v_~y~0_9 1)) (.cse68 (mod v_~z$r_buff1_thd1~0_11 256)) (.cse63 (+ .cse56 v_~z$w_buff0~0_14)) (.cse73 (+ .cse53 1)) (.cse87 (+ .cse61 v_~z$w_buff1~0_13)) (.cse71 (+ .cse65 1))) (or (< v_~z$w_buff0~0_14 .cse45) (< 1 .cse46) (< .cse47 .cse48) (< (+ v_~__unbuffered_cnt~0_12 v_~x~0_9) 0) (< (+ v_~z~0_18 .cse49) 0) (< .cse50 v_~z$w_buff0~0_14) (< .cse51 .cse48) (< .cse52 .cse48) (< v_~z~0_18 .cse53) (< (+ .cse54 v_~__unbuffered_p1_EAX~0_7) 0) (< (+ .cse55 v_~__unbuffered_p1_EAX~0_7) 0) (< v_~__unbuffered_cnt~0_12 .cse53) (< (+ .cse49 v_~__unbuffered_p1_EBX~0_7) 0) (< .cse53 .cse56) (< .cse55 .cse57) (< .cse58 0) (< .cse59 v_~z$w_buff0~0_14) (< (+ .cse60 v_~x~0_9) 0) (< v_~z$w_buff0~0_14 .cse56) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse53) 0) (< v_~__unbuffered_p2_EAX~0_7 .cse61) (< (+ .cse60 v_~y~0_9) 0) (< (+ .cse57 v_~__unbuffered_p1_EBX~0_7) 0) (< (+ v_~z~0_18 .cse60) 0) (< v_~__unbuffered_p1_EAX~0_7 .cse49) (< (+ .cse45 v_~z$mem_tmp~0_8) 0) (< 1 .cse62) (< v_~z$w_buff0~0_14 .cse60) (< (+ .cse60 v_~__unbuffered_p1_EBX~0_7) 0) (< .cse61 .cse53) (< 1 (+ .cse48 .cse45)) (< (+ v_~y~0_9 v_~z$mem_tmp~0_8) 0) (< (+ v_~z~0_18 v_~y~0_9) 0) (< .cse63 0) (< (+ v_~__unbuffered_p1_EAX~0_7 v_~z$w_buff0~0_14) 0) (< v_~__unbuffered_cnt~0_12 .cse49) (< .cse64 .cse48) (< (+ .cse65 v_~z$w_buff1~0_13) 0) (< v_~z~0_18 .cse45) (< .cse66 .cse48) (< v_~z$w_buff0~0_14 v_~z$w_buff1~0_13) (< v_~z$mem_tmp~0_8 .cse57) (< .cse67 .cse68) (< .cse59 .cse48) (< v_~z$w_buff1~0_13 .cse61) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~__unbuffered_cnt~0_12) 0) (< 1 (+ .cse68 .cse53)) (< .cse56 .cse57) (< (+ .cse60 v_~z$mem_tmp~0_8) 0) (< v_~__unbuffered_p1_EAX~0_7 .cse57) (< v_~z$w_buff0~0_14 .cse48) (< .cse51 .cse68) (< .cse69 .cse68) (< (+ v_~__unbuffered_p2_EBX~0_7 v_~z$mem_tmp~0_8) 0) (< (+ v_~z$w_buff0~0_14 v_~x~0_9) 0) (< v_~y~0_9 .cse53) (< 1 (+ .cse48 .cse61)) (< (+ v_~__unbuffered_p1_EBX~0_7 .cse65) 0) (< .cse70 .cse48) (< .cse57 .cse61) (< .cse71 v_~z$w_buff0~0_14) (< .cse46 0) (< (+ .cse45 v_~y~0_9) 0) (< .cse53 .cse61) (< 0 (+ .cse56 .cse60)) (< .cse72 v_~z$w_buff0~0_14) (< .cse49 .cse45) (< (+ .cse54 v_~y~0_9) 0) (< .cse73 v_~z$w_buff0~0_14) (< (+ .cse56 v_~__unbuffered_p1_EBX~0_7) 0) (< .cse74 v_~z$w_buff1~0_13) (< v_~z$w_buff1~0_13 .cse45) (< .cse75 0) (< .cse65 .cse57) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse54) 0) (< .cse57 .cse45) (< .cse50 .cse48) (< .cse55 .cse53) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~x~0_9) 0) (< v_~__unbuffered_p1_EBX~0_7 .cse57) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse61) 0) (< .cse72 .cse48) (< v_~__unbuffered_p1_EBX~0_7 .cse60) (< (+ v_~z~0_18 .cse53) 0) (< v_~z~0_18 .cse60) (< v_~__unbuffered_p1_EAX~0_7 .cse56) (< (+ v_~__unbuffered_p2_EBX~0_7 v_~__unbuffered_p1_EAX~0_7) 0) (< (+ .cse22 v_~y~0_9) 0) (< (+ .cse65 v_~z$w_buff0~0_14) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse45) 0) (< (+ .cse55 v_~z$w_buff1~0_13) 0) (< (+ .cse56 v_~__unbuffered_cnt~0_12) 0) (< v_~__unbuffered_p2_EBX~0_7 .cse45) (< .cse53 .cse45) (< v_~x~0_9 .cse61) (< (+ .cse60 v_~__unbuffered_cnt~0_12) 0) (< .cse22 .cse56) (< .cse56 .cse45) (< .cse76 v_~z$w_buff0~0_14) (< v_~__unbuffered_cnt~0_12 .cse45) (< (+ .cse49 v_~__unbuffered_p1_EAX~0_7) 0) (< 0 (+ .cse60 .cse45)) (< .cse49 .cse60) (< .cse77 .cse68) (< (+ .cse49 v_~__unbuffered_cnt~0_12) 0) (< (+ .cse57 v_~__unbuffered_p1_EAX~0_7) 0) (< (+ .cse55 v_~x~0_9) 0) (< .cse74 v_~z$w_buff0~0_14) (< v_~z$mem_tmp~0_8 .cse61) (< (+ v_~z$w_buff1~0_13 v_~y~0_9) 0) (< 1 .cse58) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse54) 0) (< (+ .cse56 v_~__unbuffered_p1_EAX~0_7) 0) (< .cse49 .cse61) (< v_~__unbuffered_p0_EAX~0_7 .cse45) (< (+ v_~x~0_9 v_~z$mem_tmp~0_8) 0) (< 1 .cse78) (< (+ .cse22 v_~z$w_buff1~0_13) 0) (< 1 .cse79) (< .cse54 .cse56) (< (+ .cse54 v_~z$mem_tmp~0_8) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~z$w_buff1~0_13) 0) (< (+ .cse57 v_~__unbuffered_p0_EAX~0_7) 0) (< .cse52 v_~z$w_buff1~0_13) (< (+ .cse56 v_~__unbuffered_p0_EAX~0_7) 0) (< .cse69 v_~z$w_buff1~0_13) (< (+ .cse22 v_~__unbuffered_p1_EAX~0_7) 0) (< 1 (+ .cse49 .cse68)) (< v_~z$w_buff0~0_14 .cse61) (< (+ .cse45 v_~__unbuffered_cnt~0_12) 0) (< 1 (+ .cse57 .cse68)) (< (+ v_~z~0_18 .cse54) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~__unbuffered_p2_EBX~0_7) 0) (< (+ v_~__unbuffered_p1_EAX~0_7 .cse65) 0) (< .cse71 .cse48) (< .cse80 v_~z$w_buff1~0_13) (< .cse62 0) (< .cse45 .cse56) (< .cse65 .cse45) (< v_~z$w_buff1~0_13 .cse68) (< (+ .cse22 v_~__unbuffered_cnt~0_12) 0) (< (+ v_~__unbuffered_p1_EBX~0_7 .cse53) 0) (< (+ .cse61 v_~x~0_9) 0) (< .cse61 .cse45) (< (+ .cse57 v_~__unbuffered_p2_EBX~0_7) 0) (< .cse73 .cse48) (< 0 (+ .cse60 .cse49)) (< 2 (+ .cse48 v_~z$w_buff0~0_14)) (< (+ .cse54 v_~__unbuffered_p1_EBX~0_7) 0) (< .cse81 .cse68) (< .cse57 .cse53) (< (+ .cse22 v_~z$w_buff0~0_14) 0) (< (+ v_~__unbuffered_p1_EAX~0_7 v_~__unbuffered_cnt~0_12) 0) (< .cse49 .cse57) (< (+ v_~z$w_buff0~0_14 v_~y~0_9) 0) (< 0 (+ .cse57 .cse60)) (< v_~__unbuffered_p1_EBX~0_7 .cse61) (< (+ v_~z~0_18 v_~z$w_buff1~0_13) 0) (< v_~__unbuffered_p2_EBX~0_7 .cse60) (< v_~z$mem_tmp~0_8 .cse53) (< 1 (+ .cse60 .cse68)) (< .cse22 .cse45) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse55) 0) (< .cse22 .cse53) (< v_~__unbuffered_p2_EAX~0_7 .cse49) (< 0 (+ .cse56 .cse53)) (< v_~x~0_9 .cse60) (< v_~__unbuffered_p2_EBX~0_7 .cse61) (< (+ v_~__unbuffered_p1_EBX~0_7 v_~x~0_9) 0) (< 0 (+ .cse45 .cse49)) (< .cse56 .cse61) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~z$w_buff0~0_14) 0) (< 1 (+ .cse57 .cse48)) (< .cse65 .cse49) (< v_~__unbuffered_p1_EBX~0_7 .cse49) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse65) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse55) 0) (< .cse54 .cse57) (< v_~z~0_18 .cse56) (< (+ v_~__unbuffered_p1_EAX~0_7 v_~__unbuffered_p1_EBX~0_7) 0) (< (+ .cse55 v_~z$w_buff0~0_14) 0) (< v_~z$w_buff1~0_13 .cse53) (< .cse81 .cse48) (< (+ .cse55 v_~__unbuffered_p1_EBX~0_7) 0) (< v_~x~0_9 .cse53) (< (+ .cse57 v_~z$mem_tmp~0_8) 0) (< v_~z~0_18 .cse57) (< .cse77 .cse48) (< .cse77 v_~z$w_buff1~0_13) (< (+ .cse65 v_~x~0_9) 0) (< (+ .cse57 v_~x~0_9) 0) (< v_~x~0_9 .cse45) (< (+ v_~__unbuffered_cnt~0_12 .cse53) 0) (< (+ v_~z~0_18 v_~z$mem_tmp~0_8) 0) (< (+ v_~__unbuffered_cnt~0_12 v_~z$mem_tmp~0_8) 0) (< .cse82 v_~z$w_buff0~0_14) (< 1 .cse83) (< v_~__unbuffered_p2_EAX~0_7 .cse56) (< .cse55 .cse49) (< 1 .cse75) (< 1 (+ .cse61 .cse68)) (< .cse84 .cse48) (< (+ v_~z~0_18 v_~z$w_buff0~0_14) 0) (< v_~z$mem_tmp~0_8 .cse49) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~__unbuffered_cnt~0_12) 0) (< 2 (+ .cse48 v_~z$w_buff1~0_13)) (< (+ .cse61 v_~__unbuffered_cnt~0_12) 0) (< v_~z$w_buff1~0_13 .cse49) (< v_~__unbuffered_p1_EBX~0_7 .cse45) (< 1 .cse85) (< .cse81 v_~z$w_buff0~0_14) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse60) 0) (< .cse64 v_~z$w_buff0~0_14) (< (+ v_~z~0_18 v_~__unbuffered_p1_EAX~0_7) 0) (< (+ .cse61 v_~z$mem_tmp~0_8) 0) (< .cse56 .cse53) (< (+ v_~z$w_buff0~0_14 v_~z$mem_tmp~0_8) 0) (< .cse84 .cse68) (< .cse76 .cse48) (< .cse45 .cse57) (< (+ v_~__unbuffered_p1_EAX~0_7 v_~z$w_buff1~0_13) 0) (< .cse86 v_~z$w_buff1~0_13) (< 1 (+ .cse48 .cse49)) (< (+ .cse56 v_~__unbuffered_p2_EBX~0_7) 0) (< v_~__unbuffered_p2_EBX~0_7 .cse56) (< (+ .cse57 v_~__unbuffered_p2_EAX~0_7) 0) (< .cse61 .cse57) (< (+ v_~__unbuffered_p2_EBX~0_7 v_~z$w_buff1~0_13) 0) (< .cse56 .cse49) (< .cse70 v_~z$w_buff0~0_14) (< (+ .cse53 v_~x~0_9) 0) (< .cse61 .cse60) (< (+ .cse57 v_~__unbuffered_cnt~0_12) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse61) 0) (< v_~x~0_9 .cse49) (< 0 (+ .cse45 .cse61)) (< .cse47 .cse68) (< 2 (+ v_~z$w_buff1~0_13 .cse68)) (< .cse87 0) (< v_~__unbuffered_p0_EAX~0_7 .cse53) (< (+ v_~z~0_18 .cse65) 0) (< .cse22 .cse57) (< v_~y~0_9 .cse56) (< v_~x~0_9 .cse56) (< v_~__unbuffered_p2_EAX~0_7 .cse60) (< .cse80 .cse68) (< v_~y~0_9 .cse61) (< v_~__unbuffered_p2_EBX~0_7 .cse57) (< .cse79 0) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~z~0_18) 0) (< (+ .cse54 v_~z$w_buff1~0_13) 0) (< (+ v_~__unbuffered_p2_EBX~0_7 v_~__unbuffered_p1_EBX~0_7) 0) (< (+ v_~__unbuffered_p2_EBX~0_7 v_~__unbuffered_cnt~0_12) 0) (< v_~__unbuffered_p1_EBX~0_7 .cse56) (< (+ v_~__unbuffered_p1_EBX~0_7 v_~z$w_buff1~0_13) 0) (< .cse53 .cse49) (< 2 (+ .cse48 .cse68)) (< (+ v_~z$w_buff1~0_13 v_~z$mem_tmp~0_8) 0) (< .cse88 0) (< .cse67 .cse48) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~x~0_9) 0) (< v_~__unbuffered_p1_EAX~0_7 .cse61) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~z~0_18) 0) (< (+ .cse22 v_~x~0_9) 0) (< v_~__unbuffered_cnt~0_12 .cse60) (< v_~y~0_9 .cse45) (< (+ .cse55 v_~__unbuffered_cnt~0_12) 0) (< v_~z$w_buff0~0_14 .cse68) (< (+ v_~__unbuffered_p1_EBX~0_7 v_~z$mem_tmp~0_8) 0) (< .cse45 .cse60) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse45) 0) (< 0 (+ .cse57 .cse45)) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse53) 0) (< .cse47 v_~z$w_buff0~0_14) (< (+ v_~__unbuffered_cnt~0_12 v_~z$w_buff0~0_14) 0) (< 0 (+ .cse57 .cse56)) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse49) 0) (< (+ .cse56 v_~z~0_18) 0) (< .cse86 .cse48) (< (+ v_~__unbuffered_p1_EAX~0_7 v_~x~0_9) 0) (< .cse22 .cse49) (< v_~z$w_buff1~0_13 .cse60) (< .cse89 .cse68) (< (+ .cse57 v_~z~0_18) 0) (< .cse78 0) (< .cse74 .cse68) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse22) 0) (< .cse54 .cse60) (< .cse45 .cse61) (< .cse57 .cse49) (< .cse65 .cse61) (< (+ .cse65 v_~y~0_9) 0) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~__unbuffered_p1_EAX~0_7) 0) (< (+ .cse60 v_~__unbuffered_p1_EAX~0_7) 0) (< .cse76 v_~z$w_buff1~0_13) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~__unbuffered_p2_EBX~0_7) 0) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse55) 0) (< .cse61 .cse49) (< 0 (+ .cse56 .cse49)) (< v_~__unbuffered_p1_EBX~0_7 .cse53) (< .cse77 v_~z$w_buff0~0_14) (< (+ .cse56 v_~x~0_9) 0) (< .cse66 v_~z$w_buff0~0_14) (< .cse89 .cse48) (< .cse65 .cse56) (< .cse55 .cse61) (< .cse53 .cse57) (< .cse64 .cse68) (< 0 (+ .cse57 .cse61)) (< v_~__unbuffered_p1_EAX~0_7 .cse53) (< (+ .cse49 v_~y~0_9) 0) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse61) 0) (< .cse64 v_~z$w_buff1~0_13) (< v_~__unbuffered_p2_EAX~0_7 .cse53) (< v_~z$w_buff1~0_13 .cse57) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~__unbuffered_p1_EBX~0_7) 0) (< 0 (+ .cse56 .cse61)) (< (+ .cse56 v_~y~0_9) 0) (< v_~__unbuffered_p0_EAX~0_7 .cse56) (< v_~__unbuffered_p0_EAX~0_7 .cse57) (< .cse90 0) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse65) 0) (< .cse73 .cse68) (< .cse22 .cse61) (< .cse54 .cse49) (< (+ .cse61 v_~__unbuffered_p1_EBX~0_7) 0) (< 0 (+ .cse49 .cse53)) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse54) 0) (< v_~__unbuffered_p0_EAX~0_7 .cse49) (< v_~__unbuffered_p0_EAX~0_7 .cse61) (< .cse69 v_~z$w_buff0~0_14) (< (+ .cse54 v_~__unbuffered_cnt~0_12) 0) (< 1 .cse91) (< (+ v_~z~0_18 v_~x~0_9) 0) (< (+ v_~z~0_18 .cse22) 0) (< 1 (+ .cse56 .cse68)) (< .cse50 .cse68) (< .cse89 v_~z$w_buff1~0_13) (< v_~y~0_9 .cse57) (< .cse85 0) (< (+ v_~__unbuffered_p1_EAX~0_7 v_~y~0_9) 0) (< (+ .cse61 v_~y~0_9) 0) (< .cse76 .cse68) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~y~0_9) 0) (< 1 (+ .cse48 .cse53)) (< .cse72 .cse68) (< (+ v_~z$w_buff1~0_13 v_~x~0_9) 0) (< 1 .cse92) (< 1 .cse88) (< (+ .cse22 v_~z$mem_tmp~0_8) 0) (< .cse57 .cse56) (< .cse60 .cse57) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~z$mem_tmp~0_8) 0) (< .cse52 v_~z$w_buff0~0_14) (< 0 (+ .cse61 .cse53)) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse49) 0) (< 0 (+ .cse56 .cse45)) (< v_~__unbuffered_cnt~0_12 .cse56) (< v_~z$mem_tmp~0_8 .cse60) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~__unbuffered_p1_EAX~0_7) 0) (< (+ v_~__unbuffered_cnt~0_12 .cse65) 0) (< v_~z~0_18 .cse49) (< v_~z~0_18 .cse61) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~z$w_buff0~0_14) 0) (< .cse72 v_~z$w_buff1~0_13) (< v_~z$w_buff0~0_14 .cse49) (< 2 .cse90) (< 0 (+ .cse61 .cse49)) (< v_~z$w_buff1~0_13 .cse56) (< .cse66 v_~z$w_buff1~0_13) (< .cse84 v_~z$w_buff1~0_13) (< (+ v_~x~0_9 v_~y~0_9) 0) (< 1 (+ .cse48 .cse60)) (< (+ v_~__unbuffered_p1_EAX~0_7 v_~z$mem_tmp~0_8) 0) (< .cse55 .cse45) (< .cse51 v_~z$w_buff0~0_14) (< .cse83 0) (< (+ .cse45 v_~x~0_9) 0) (< 2 (+ v_~z$w_buff0~0_14 .cse68)) (< .cse60 .cse53) (< .cse53 .cse60) (< .cse69 .cse48) (< .cse80 .cse48) (< .cse45 .cse53) (< .cse86 v_~z$w_buff0~0_14) (< .cse52 .cse68) (< (+ .cse57 v_~y~0_9) 0) (< .cse66 .cse68) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse60) 0) (< v_~__unbuffered_p1_EAX~0_7 .cse45) (< .cse74 .cse48) (< (+ .cse53 v_~y~0_9) 0) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse65) 0) (< .cse82 .cse48) (< .cse60 .cse56) (< .cse65 .cse60) (< v_~z$mem_tmp~0_8 .cse45) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse53) 0) (< .cse55 .cse60) (< (+ v_~__unbuffered_p2_EBX~0_7 v_~z~0_18) 0) (< v_~__unbuffered_p0_EAX~0_7 .cse60) (< .cse84 v_~z$w_buff0~0_14) (< .cse54 .cse45) (< .cse61 .cse56) (< (+ .cse56 v_~__unbuffered_p2_EAX~0_7) 0) (< (+ .cse49 v_~z$mem_tmp~0_8) 0) (< .cse80 v_~z$w_buff0~0_14) (< .cse54 .cse22) (< 1 (+ .cse56 .cse48)) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse22) 0) (< (+ .cse22 v_~__unbuffered_p1_EBX~0_7) 0) (< (+ v_~z~0_18 .cse61) 0) (< .cse51 v_~z$w_buff1~0_13) (< (+ .cse65 v_~z$mem_tmp~0_8) 0) (< .cse50 v_~z$w_buff1~0_13) (< .cse54 .cse53) (< .cse89 v_~z$w_buff0~0_14) (< v_~z$mem_tmp~0_8 .cse56) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse45) 0) (< .cse55 .cse56) (< 1 (+ .cse45 .cse68)) (< v_~__unbuffered_p2_EBX~0_7 .cse49) (< .cse60 .cse49) (< .cse60 .cse61) (< .cse86 .cse68) (< .cse92 0) (< v_~__unbuffered_p2_EAX~0_7 .cse57) (< .cse59 v_~z$w_buff1~0_13) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~y~0_9) 0) (< v_~__unbuffered_cnt~0_12 .cse61) (< (+ .cse45 v_~__unbuffered_p1_EAX~0_7) 0) (< v_~z$w_buff0~0_14 .cse53) (< 0 (+ .cse60 .cse61)) (< (+ v_~__unbuffered_cnt~0_12 v_~z$w_buff1~0_13) 0) (< .cse71 .cse68) (< 0 (+ .cse57 .cse53)) (< .cse93 0) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse49) 0) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~__unbuffered_p2_EAX~0_7) 0) (< (+ v_~z~0_18 .cse45) 0) (< 0 (+ .cse45 .cse53)) (< .cse49 .cse53) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~z$w_buff1~0_13) 0) (< .cse91 0) (< .cse54 .cse61) (< (+ v_~__unbuffered_p2_EBX~0_7 v_~y~0_9) 0) (< (+ v_~__unbuffered_p2_EBX~0_7 v_~z$w_buff0~0_14) 0) (< (+ .cse61 v_~__unbuffered_p1_EAX~0_7) 0) (< (+ v_~__unbuffered_p1_EBX~0_7 v_~z$w_buff0~0_14) 0) (< .cse47 v_~z$w_buff1~0_13) (< .cse59 .cse68) (< .cse45 .cse49) (< v_~y~0_9 .cse60) (< .cse67 v_~z$w_buff1~0_13) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~z$mem_tmp~0_8) 0) (< 0 (+ .cse60 .cse53)) (< (+ v_~z~0_18 v_~__unbuffered_p1_EBX~0_7) 0) (< (+ .cse54 v_~z$w_buff0~0_14) 0) (< v_~__unbuffered_p2_EAX~0_7 .cse45) (< (+ .cse53 v_~z$mem_tmp~0_8) 0) (< .cse49 .cse56) (< (+ v_~__unbuffered_p1_EBX~0_7 v_~y~0_9) 0) (< v_~z$w_buff0~0_14 .cse57) (< (+ v_~z~0_18 v_~__unbuffered_cnt~0_12) 0) (< .cse56 .cse60) (< .cse82 v_~z$w_buff1~0_13) (< (+ v_~z~0_18 .cse55) 0) (< .cse57 .cse60) (< (+ v_~__unbuffered_p2_EBX~0_7 v_~x~0_9) 0) (< 1 .cse93) (< v_~__unbuffered_p2_EBX~0_7 .cse53) (< .cse81 v_~z$w_buff1~0_13) (< .cse67 v_~z$w_buff0~0_14) (< .cse82 .cse68) (< 1 .cse63) (< (+ .cse54 v_~x~0_9) 0) (< .cse65 .cse53) (< (+ .cse45 v_~__unbuffered_p1_EBX~0_7) 0) (< v_~__unbuffered_cnt~0_12 .cse57) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse22) 0) (< .cse73 v_~z$w_buff1~0_13) (< (+ .cse55 v_~z$mem_tmp~0_8) 0) (< v_~x~0_9 .cse57) (< 1 .cse87) (< (+ v_~__unbuffered_p1_EAX~0_7 .cse53) 0) (< .cse60 .cse45) (< 0 (+ .cse57 .cse49)) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse60) 0) (< (+ .cse49 v_~x~0_9) 0) (< .cse22 .cse60) (< v_~__unbuffered_p1_EAX~0_7 .cse60) (< (+ .cse55 v_~y~0_9) 0) (< .cse71 v_~z$w_buff1~0_13) (< (+ v_~__unbuffered_cnt~0_12 v_~y~0_9) 0) (< (+ .cse56 v_~z$mem_tmp~0_8) 0) (< v_~y~0_9 .cse49) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~__unbuffered_p1_EBX~0_7) 0) (< (+ v_~__unbuffered_p1_EBX~0_7 v_~__unbuffered_cnt~0_12) 0)))) .cse3) (and .cse3 (or .cse6 .cse13 .cse42)) (and .cse3 .cse43) (and (or .cse27 .cse31 .cse39) .cse3) (and (or .cse11 .cse30 .cse40) .cse3) (and (or .cse16 .cse29 .cse34) .cse3) (and .cse3 (or .cse12 .cse20 .cse24)) (and (or .cse19 .cse26 .cse28) .cse3) (and .cse3 .cse41) (and (or .cse15 .cse35 .cse38) .cse3) (and .cse14 .cse3) (and (or .cse7 .cse9 .cse44) .cse3) (and .cse33 .cse3) (and (or .cse8 .cse23 .cse32) .cse3)))) InVars {~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13, ~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_14, ~x~0=v_~x~0_9} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13, ~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_14, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[][131], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd3~0 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))) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 251#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd0~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 1)), 2#L782true, Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~z$r_buff0_thd3~0 256)) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 107#true, Black: 264#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 137#(and (= ~__unbuffered_cnt~0 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))) (<= 0 (div ~z$r_buff0_thd3~0 256)) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd3~0) ~z$r_buff0_thd0~0) (= ~x~0 1) (<= (+ ~z$r_buff0_thd3~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff0_thd3~0 256)))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~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: 79#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 7#L762true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~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) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 216#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), 222#true, 270#true, 285#true, Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 193#true, Black: 229#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), Black: 104#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~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) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 95#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~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)), 43#$Ultimate##0true, Black: 169#(and (= ~__unbuffered_cnt~0 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) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$r_buff0_thd1~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P1Thread1of1ForFork2InUse, Black: 240#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (<= (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) ~z$r_buff0_thd3~0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$w_buff0~0 1)), P0Thread1of1ForFork0InUse, 143#true, P2Thread1of1ForFork1InUse, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 35#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 58#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (<= (+ ~z$r_buff1_thd0~0 ~z$r_buff0_thd3~0) 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (<= (+ ~z$r_buff1_thd3~0 ~z$r_buff1_thd0~0) 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__unbuffered_p1_EBX~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) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), 176#true, Black: 179#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~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))]) [2024-06-14 14:27:17,530 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2024-06-14 14:27:17,530 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-14 14:27:17,530 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-14 14:27:17,530 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-14 14:27:18,649 INFO L124 PetriNetUnfolderBase]: 2268/3487 cut-off events. [2024-06-14 14:27:18,649 INFO L125 PetriNetUnfolderBase]: For 44269/44329 co-relation queries the response was YES. [2024-06-14 14:27:18,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16870 conditions, 3487 events. 2268/3487 cut-off events. For 44269/44329 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17800 event pairs, 1206 based on Foata normal form. 9/3453 useless extension candidates. Maximal degree in co-relation 16826. Up to 3277 conditions per place. [2024-06-14 14:27:18,669 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 118 selfloop transitions, 9 changer transitions 0/166 dead transitions. [2024-06-14 14:27:18,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 166 transitions, 1641 flow [2024-06-14 14:27:18,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:27:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:27:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-06-14 14:27:18,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325581395348837 [2024-06-14 14:27:18,670 INFO L175 Difference]: Start difference. First operand has 107 places, 156 transitions, 1339 flow. Second operand 5 states and 93 transitions. [2024-06-14 14:27:18,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 166 transitions, 1641 flow [2024-06-14 14:27:18,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 166 transitions, 1539 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 14:27:18,701 INFO L231 Difference]: Finished difference. Result has 105 places, 159 transitions, 1287 flow [2024-06-14 14:27:18,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1287, PETRI_PLACES=105, PETRI_TRANSITIONS=159} [2024-06-14 14:27:18,702 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places. [2024-06-14 14:27:18,702 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 159 transitions, 1287 flow [2024-06-14 14:27:18,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-14 14:27:18,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:18,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:18,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 14:27:18,702 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:27:18,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:18,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1586556500, now seen corresponding path program 1 times [2024-06-14 14:27:18,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:18,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905963266] [2024-06-14 14:27:18,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:18,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:28,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:28,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905963266] [2024-06-14 14:27:28,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905963266] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:28,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:28,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:27:28,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054744064] [2024-06-14 14:27:28,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:28,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:27:28,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:28,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:27:28,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:27:29,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:27:29,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 159 transitions, 1287 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:29,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:29,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:27:29,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:30,768 INFO L124 PetriNetUnfolderBase]: 2042/3143 cut-off events. [2024-06-14 14:27:30,768 INFO L125 PetriNetUnfolderBase]: For 41032/41057 co-relation queries the response was YES. [2024-06-14 14:27:30,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15759 conditions, 3143 events. 2042/3143 cut-off events. For 41032/41057 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15846 event pairs, 820 based on Foata normal form. 6/3115 useless extension candidates. Maximal degree in co-relation 15715. Up to 2855 conditions per place. [2024-06-14 14:27:30,789 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 138 selfloop transitions, 45 changer transitions 0/189 dead transitions. [2024-06-14 14:27:30,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 189 transitions, 1809 flow [2024-06-14 14:27:30,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:27:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:27:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-14 14:27:30,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45058139534883723 [2024-06-14 14:27:30,790 INFO L175 Difference]: Start difference. First operand has 105 places, 159 transitions, 1287 flow. Second operand 8 states and 155 transitions. [2024-06-14 14:27:30,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 189 transitions, 1809 flow [2024-06-14 14:27:30,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 189 transitions, 1781 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 14:27:30,817 INFO L231 Difference]: Finished difference. Result has 110 places, 162 transitions, 1400 flow [2024-06-14 14:27:30,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1400, PETRI_PLACES=110, PETRI_TRANSITIONS=162} [2024-06-14 14:27:30,817 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places. [2024-06-14 14:27:30,817 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 162 transitions, 1400 flow [2024-06-14 14:27:30,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:30,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:30,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:30,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 14:27:30,818 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:27:30,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -783177621, now seen corresponding path program 1 times [2024-06-14 14:27:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:30,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655728459] [2024-06-14 14:27:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:44,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-14 14:27:44,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:44,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655728459] [2024-06-14 14:27:44,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655728459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:44,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:44,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:27:44,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345862773] [2024-06-14 14:27:44,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:44,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:27:44,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:44,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:27:44,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:27:44,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:27:44,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 162 transitions, 1400 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:44,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:44,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:27:44,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:46,885 INFO L124 PetriNetUnfolderBase]: 2091/3207 cut-off events. [2024-06-14 14:27:46,886 INFO L125 PetriNetUnfolderBase]: For 46984/47010 co-relation queries the response was YES. [2024-06-14 14:27:46,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16898 conditions, 3207 events. 2091/3207 cut-off events. For 46984/47010 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 16136 event pairs, 806 based on Foata normal form. 8/3181 useless extension candidates. Maximal degree in co-relation 16853. Up to 2881 conditions per place. [2024-06-14 14:27:46,902 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 151 selfloop transitions, 58 changer transitions 0/215 dead transitions. [2024-06-14 14:27:46,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 215 transitions, 2210 flow [2024-06-14 14:27:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:27:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:27:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-14 14:27:46,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45813953488372094 [2024-06-14 14:27:46,906 INFO L175 Difference]: Start difference. First operand has 110 places, 162 transitions, 1400 flow. Second operand 10 states and 197 transitions. [2024-06-14 14:27:46,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 215 transitions, 2210 flow [2024-06-14 14:27:46,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 215 transitions, 2103 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 14:27:46,936 INFO L231 Difference]: Finished difference. Result has 116 places, 176 transitions, 1590 flow [2024-06-14 14:27:46,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1590, PETRI_PLACES=116, PETRI_TRANSITIONS=176} [2024-06-14 14:27:46,937 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 72 predicate places. [2024-06-14 14:27:46,937 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 176 transitions, 1590 flow [2024-06-14 14:27:46,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:46,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:46,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:46,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 14:27:46,937 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:27:46,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1540185045, now seen corresponding path program 2 times [2024-06-14 14:27:46,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:46,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471897691] [2024-06-14 14:27:46,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:46,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:01,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:01,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471897691] [2024-06-14 14:28:01,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471897691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:01,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:01,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:28:01,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401349790] [2024-06-14 14:28:01,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:01,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:28:01,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:01,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:28:01,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:28:01,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:28:01,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 176 transitions, 1590 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:01,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:01,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:28:01,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:03,824 INFO L124 PetriNetUnfolderBase]: 2150/3304 cut-off events. [2024-06-14 14:28:03,824 INFO L125 PetriNetUnfolderBase]: For 53639/53663 co-relation queries the response was YES. [2024-06-14 14:28:03,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18210 conditions, 3304 events. 2150/3304 cut-off events. For 53639/53663 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 16693 event pairs, 816 based on Foata normal form. 9/3284 useless extension candidates. Maximal degree in co-relation 18162. Up to 2994 conditions per place. [2024-06-14 14:28:03,844 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 163 selfloop transitions, 68 changer transitions 0/237 dead transitions. [2024-06-14 14:28:03,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 237 transitions, 2561 flow [2024-06-14 14:28:03,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:28:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:28:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-06-14 14:28:03,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4439746300211416 [2024-06-14 14:28:03,847 INFO L175 Difference]: Start difference. First operand has 116 places, 176 transitions, 1590 flow. Second operand 11 states and 210 transitions. [2024-06-14 14:28:03,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 237 transitions, 2561 flow [2024-06-14 14:28:03,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 237 transitions, 2358 flow, removed 76 selfloop flow, removed 5 redundant places. [2024-06-14 14:28:03,884 INFO L231 Difference]: Finished difference. Result has 123 places, 197 transitions, 1867 flow [2024-06-14 14:28:03,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1867, PETRI_PLACES=123, PETRI_TRANSITIONS=197} [2024-06-14 14:28:03,884 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 79 predicate places. [2024-06-14 14:28:03,884 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 197 transitions, 1867 flow [2024-06-14 14:28:03,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:03,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:03,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:03,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 14:28:03,885 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:28:03,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1802424353, now seen corresponding path program 3 times [2024-06-14 14:28:03,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:03,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966065361] [2024-06-14 14:28:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:19,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-14 14:28:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:19,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966065361] [2024-06-14 14:28:19,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966065361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:19,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:19,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:28:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641283490] [2024-06-14 14:28:19,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:19,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:28:19,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:19,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:28:19,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:28:19,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:28:19,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 197 transitions, 1867 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:19,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:19,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:28:19,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:21,787 INFO L124 PetriNetUnfolderBase]: 2152/3310 cut-off events. [2024-06-14 14:28:21,787 INFO L125 PetriNetUnfolderBase]: For 58128/58148 co-relation queries the response was YES. [2024-06-14 14:28:21,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18626 conditions, 3310 events. 2152/3310 cut-off events. For 58128/58148 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16777 event pairs, 821 based on Foata normal form. 5/3286 useless extension candidates. Maximal degree in co-relation 18575. Up to 3038 conditions per place. [2024-06-14 14:28:21,808 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 176 selfloop transitions, 53 changer transitions 0/235 dead transitions. [2024-06-14 14:28:21,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 235 transitions, 2513 flow [2024-06-14 14:28:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:28:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:28:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-06-14 14:28:21,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312896405919662 [2024-06-14 14:28:21,811 INFO L175 Difference]: Start difference. First operand has 123 places, 197 transitions, 1867 flow. Second operand 11 states and 204 transitions. [2024-06-14 14:28:21,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 235 transitions, 2513 flow [2024-06-14 14:28:21,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 235 transitions, 2416 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 14:28:21,854 INFO L231 Difference]: Finished difference. Result has 127 places, 200 transitions, 1936 flow [2024-06-14 14:28:21,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1936, PETRI_PLACES=127, PETRI_TRANSITIONS=200} [2024-06-14 14:28:21,854 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 83 predicate places. [2024-06-14 14:28:21,855 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 200 transitions, 1936 flow [2024-06-14 14:28:21,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:21,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:21,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:21,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 14:28:21,855 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:28:21,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1730770735, now seen corresponding path program 4 times [2024-06-14 14:28:21,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:21,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37418845] [2024-06-14 14:28:21,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:21,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:38,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:38,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37418845] [2024-06-14 14:28:38,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37418845] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:38,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:38,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:28:38,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817204005] [2024-06-14 14:28:38,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:38,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:28:38,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:38,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:28:38,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:28:38,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:28:38,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 200 transitions, 1936 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:38,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:38,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:28:38,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:40,452 INFO L124 PetriNetUnfolderBase]: 2249/3452 cut-off events. [2024-06-14 14:28:40,452 INFO L125 PetriNetUnfolderBase]: For 63367/63389 co-relation queries the response was YES. [2024-06-14 14:28:40,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19913 conditions, 3452 events. 2249/3452 cut-off events. For 63367/63389 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17458 event pairs, 783 based on Foata normal form. 11/3440 useless extension candidates. Maximal degree in co-relation 19860. Up to 3144 conditions per place. [2024-06-14 14:28:40,475 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 192 selfloop transitions, 69 changer transitions 0/267 dead transitions. [2024-06-14 14:28:40,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 267 transitions, 3046 flow [2024-06-14 14:28:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:28:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:28:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-14 14:28:40,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44883720930232557 [2024-06-14 14:28:40,478 INFO L175 Difference]: Start difference. First operand has 127 places, 200 transitions, 1936 flow. Second operand 10 states and 193 transitions. [2024-06-14 14:28:40,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 267 transitions, 3046 flow [2024-06-14 14:28:40,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 267 transitions, 2891 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-14 14:28:40,527 INFO L231 Difference]: Finished difference. Result has 129 places, 233 transitions, 2408 flow [2024-06-14 14:28:40,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1802, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2408, PETRI_PLACES=129, PETRI_TRANSITIONS=233} [2024-06-14 14:28:40,528 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 85 predicate places. [2024-06-14 14:28:40,528 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 233 transitions, 2408 flow [2024-06-14 14:28:40,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:40,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:40,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:40,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 14:28:40,529 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:28:40,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1992829623, now seen corresponding path program 5 times [2024-06-14 14:28:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:40,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604553694] [2024-06-14 14:28:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:40,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:56,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:56,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604553694] [2024-06-14 14:28:56,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604553694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:56,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:56,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:28:56,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493547750] [2024-06-14 14:28:56,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:56,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:28:56,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:56,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:28:56,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:28:56,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:28:56,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 233 transitions, 2408 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:56,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:56,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:28:56,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:58,769 INFO L124 PetriNetUnfolderBase]: 2238/3437 cut-off events. [2024-06-14 14:28:58,769 INFO L125 PetriNetUnfolderBase]: For 68729/68755 co-relation queries the response was YES. [2024-06-14 14:28:58,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20213 conditions, 3437 events. 2238/3437 cut-off events. For 68729/68755 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17386 event pairs, 789 based on Foata normal form. 16/3430 useless extension candidates. Maximal degree in co-relation 20158. Up to 3143 conditions per place. [2024-06-14 14:28:58,791 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 192 selfloop transitions, 59 changer transitions 0/257 dead transitions. [2024-06-14 14:28:58,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 257 transitions, 3014 flow [2024-06-14 14:28:58,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:28:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:28:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-14 14:28:58,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45058139534883723 [2024-06-14 14:28:58,794 INFO L175 Difference]: Start difference. First operand has 129 places, 233 transitions, 2408 flow. Second operand 8 states and 155 transitions. [2024-06-14 14:28:58,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 257 transitions, 3014 flow [2024-06-14 14:28:58,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 257 transitions, 2890 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-14 14:28:58,857 INFO L231 Difference]: Finished difference. Result has 131 places, 233 transitions, 2428 flow [2024-06-14 14:28:58,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2428, PETRI_PLACES=131, PETRI_TRANSITIONS=233} [2024-06-14 14:28:58,858 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 87 predicate places. [2024-06-14 14:28:58,858 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 233 transitions, 2428 flow [2024-06-14 14:28:58,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:58,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:58,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:58,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 14:28:58,858 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:28:58,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:58,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1684342888, now seen corresponding path program 2 times [2024-06-14 14:28:58,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:58,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146903043] [2024-06-14 14:28:58,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:58,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:15,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:15,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146903043] [2024-06-14 14:29:15,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146903043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:15,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:15,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:29:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187556361] [2024-06-14 14:29:15,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:15,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:29:15,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:15,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:29:15,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:29:15,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:29:15,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 233 transitions, 2428 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:15,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:15,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:29:15,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:17,672 INFO L124 PetriNetUnfolderBase]: 2380/3664 cut-off events. [2024-06-14 14:29:17,672 INFO L125 PetriNetUnfolderBase]: For 78488/78511 co-relation queries the response was YES. [2024-06-14 14:29:17,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21845 conditions, 3664 events. 2380/3664 cut-off events. For 78488/78511 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 18946 event pairs, 833 based on Foata normal form. 8/3643 useless extension candidates. Maximal degree in co-relation 21788. Up to 3224 conditions per place. [2024-06-14 14:29:17,693 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 221 selfloop transitions, 72 changer transitions 0/299 dead transitions. [2024-06-14 14:29:17,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 299 transitions, 3540 flow [2024-06-14 14:29:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:29:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:29:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-06-14 14:29:17,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4587737843551797 [2024-06-14 14:29:17,694 INFO L175 Difference]: Start difference. First operand has 131 places, 233 transitions, 2428 flow. Second operand 11 states and 217 transitions. [2024-06-14 14:29:17,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 299 transitions, 3540 flow [2024-06-14 14:29:17,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 299 transitions, 3432 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 14:29:17,756 INFO L231 Difference]: Finished difference. Result has 138 places, 253 transitions, 2720 flow [2024-06-14 14:29:17,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2320, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2720, PETRI_PLACES=138, PETRI_TRANSITIONS=253} [2024-06-14 14:29:17,756 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 94 predicate places. [2024-06-14 14:29:17,757 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 253 transitions, 2720 flow [2024-06-14 14:29:17,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:17,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:17,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:17,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 14:29:17,757 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:29:17,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:17,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1684348468, now seen corresponding path program 3 times [2024-06-14 14:29:17,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:17,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246718262] [2024-06-14 14:29:17,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:17,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:33,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:33,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246718262] [2024-06-14 14:29:33,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246718262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:33,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:33,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:29:33,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074818213] [2024-06-14 14:29:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:33,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:29:33,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:33,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:29:33,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:29:33,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:29:33,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 253 transitions, 2720 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:33,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:33,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:29:33,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:35,922 INFO L124 PetriNetUnfolderBase]: 2370/3653 cut-off events. [2024-06-14 14:29:35,922 INFO L125 PetriNetUnfolderBase]: For 85673/85696 co-relation queries the response was YES. [2024-06-14 14:29:35,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22578 conditions, 3653 events. 2370/3653 cut-off events. For 85673/85696 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18871 event pairs, 828 based on Foata normal form. 8/3632 useless extension candidates. Maximal degree in co-relation 22518. Up to 3216 conditions per place. [2024-06-14 14:29:35,950 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 223 selfloop transitions, 69 changer transitions 0/298 dead transitions. [2024-06-14 14:29:35,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 298 transitions, 3568 flow [2024-06-14 14:29:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:29:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:29:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 218 transitions. [2024-06-14 14:29:35,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608879492600423 [2024-06-14 14:29:35,953 INFO L175 Difference]: Start difference. First operand has 138 places, 253 transitions, 2720 flow. Second operand 11 states and 218 transitions. [2024-06-14 14:29:35,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 298 transitions, 3568 flow [2024-06-14 14:29:36,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 298 transitions, 3454 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-14 14:29:36,056 INFO L231 Difference]: Finished difference. Result has 143 places, 253 transitions, 2752 flow [2024-06-14 14:29:36,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2606, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2752, PETRI_PLACES=143, PETRI_TRANSITIONS=253} [2024-06-14 14:29:36,057 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 99 predicate places. [2024-06-14 14:29:36,057 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 253 transitions, 2752 flow [2024-06-14 14:29:36,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:36,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:36,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:36,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 14:29:36,058 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:29:36,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:36,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1684348623, now seen corresponding path program 6 times [2024-06-14 14:29:36,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:36,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629912369] [2024-06-14 14:29:36,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:36,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:51,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:51,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629912369] [2024-06-14 14:29:51,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629912369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:51,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:51,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:29:51,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546688465] [2024-06-14 14:29:51,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:51,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:29:51,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:51,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:29:51,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:29:51,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:29:51,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 253 transitions, 2752 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:51,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:51,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:29:51,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:53,736 INFO L124 PetriNetUnfolderBase]: 2377/3663 cut-off events. [2024-06-14 14:29:53,736 INFO L125 PetriNetUnfolderBase]: For 89380/89407 co-relation queries the response was YES. [2024-06-14 14:29:53,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22934 conditions, 3663 events. 2377/3663 cut-off events. For 89380/89407 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18840 event pairs, 796 based on Foata normal form. 14/3653 useless extension candidates. Maximal degree in co-relation 22872. Up to 3283 conditions per place. [2024-06-14 14:29:53,768 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 198 selfloop transitions, 80 changer transitions 0/284 dead transitions. [2024-06-14 14:29:53,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 284 transitions, 3484 flow [2024-06-14 14:29:53,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:29:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:29:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-14 14:29:53,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45219638242894056 [2024-06-14 14:29:53,771 INFO L175 Difference]: Start difference. First operand has 143 places, 253 transitions, 2752 flow. Second operand 9 states and 175 transitions. [2024-06-14 14:29:53,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 284 transitions, 3484 flow [2024-06-14 14:29:53,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 284 transitions, 3355 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 14:29:53,865 INFO L231 Difference]: Finished difference. Result has 144 places, 256 transitions, 2839 flow [2024-06-14 14:29:53,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2623, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2839, PETRI_PLACES=144, PETRI_TRANSITIONS=256} [2024-06-14 14:29:53,866 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 100 predicate places. [2024-06-14 14:29:53,866 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 256 transitions, 2839 flow [2024-06-14 14:29:53,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:53,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:53,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:53,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 14:29:53,867 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:29:53,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:53,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1586646865, now seen corresponding path program 7 times [2024-06-14 14:29:53,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:53,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807680578] [2024-06-14 14:29:53,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:53,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:07,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:07,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807680578] [2024-06-14 14:30:07,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807680578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:07,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:07,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:30:07,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204934103] [2024-06-14 14:30:07,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:07,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:30:07,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:07,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:30:07,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:30:07,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:30:07,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 256 transitions, 2839 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:07,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:07,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:30:07,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:09,412 INFO L124 PetriNetUnfolderBase]: 2410/3697 cut-off events. [2024-06-14 14:30:09,412 INFO L125 PetriNetUnfolderBase]: For 100493/100523 co-relation queries the response was YES. [2024-06-14 14:30:09,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23957 conditions, 3697 events. 2410/3697 cut-off events. For 100493/100523 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 19027 event pairs, 826 based on Foata normal form. 11/3674 useless extension candidates. Maximal degree in co-relation 23894. Up to 3263 conditions per place. [2024-06-14 14:30:09,440 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 171 selfloop transitions, 120 changer transitions 0/297 dead transitions. [2024-06-14 14:30:09,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 297 transitions, 3771 flow [2024-06-14 14:30:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:30:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:30:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-14 14:30:09,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573643410852713 [2024-06-14 14:30:09,444 INFO L175 Difference]: Start difference. First operand has 144 places, 256 transitions, 2839 flow. Second operand 9 states and 177 transitions. [2024-06-14 14:30:09,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 297 transitions, 3771 flow [2024-06-14 14:30:09,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 297 transitions, 3579 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 14:30:09,538 INFO L231 Difference]: Finished difference. Result has 146 places, 262 transitions, 3018 flow [2024-06-14 14:30:09,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2647, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3018, PETRI_PLACES=146, PETRI_TRANSITIONS=262} [2024-06-14 14:30:09,538 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 102 predicate places. [2024-06-14 14:30:09,538 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 262 transitions, 3018 flow [2024-06-14 14:30:09,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:09,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:09,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:09,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 14:30:09,539 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:30:09,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash -586173701, now seen corresponding path program 8 times [2024-06-14 14:30:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:09,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90380149] [2024-06-14 14:30:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:09,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:23,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:23,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90380149] [2024-06-14 14:30:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90380149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:23,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:23,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:30:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872411591] [2024-06-14 14:30:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:23,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:30:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:23,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:30:23,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:30:24,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:30:24,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 262 transitions, 3018 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:24,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:24,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:30:24,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:26,159 INFO L124 PetriNetUnfolderBase]: 2388/3676 cut-off events. [2024-06-14 14:30:26,159 INFO L125 PetriNetUnfolderBase]: For 105028/105050 co-relation queries the response was YES. [2024-06-14 14:30:26,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24103 conditions, 3676 events. 2388/3676 cut-off events. For 105028/105050 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 18951 event pairs, 845 based on Foata normal form. 6/3653 useless extension candidates. Maximal degree in co-relation 24039. Up to 3345 conditions per place. [2024-06-14 14:30:26,188 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 213 selfloop transitions, 69 changer transitions 0/288 dead transitions. [2024-06-14 14:30:26,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 288 transitions, 3702 flow [2024-06-14 14:30:26,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:30:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:30:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 14:30:26,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4476744186046512 [2024-06-14 14:30:26,191 INFO L175 Difference]: Start difference. First operand has 146 places, 262 transitions, 3018 flow. Second operand 8 states and 154 transitions. [2024-06-14 14:30:26,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 288 transitions, 3702 flow [2024-06-14 14:30:26,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 288 transitions, 3455 flow, removed 45 selfloop flow, removed 7 redundant places. [2024-06-14 14:30:26,282 INFO L231 Difference]: Finished difference. Result has 147 places, 262 transitions, 2946 flow [2024-06-14 14:30:26,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2771, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2946, PETRI_PLACES=147, PETRI_TRANSITIONS=262} [2024-06-14 14:30:26,283 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 103 predicate places. [2024-06-14 14:30:26,283 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 262 transitions, 2946 flow [2024-06-14 14:30:26,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:26,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:26,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:26,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 14:30:26,283 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:30:26,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:26,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1682295534, now seen corresponding path program 4 times [2024-06-14 14:30:26,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:26,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592214004] [2024-06-14 14:30:26,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:26,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:38,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:38,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592214004] [2024-06-14 14:30:38,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592214004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:38,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:38,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:30:38,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416444896] [2024-06-14 14:30:38,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:38,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:30:38,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:38,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:30:38,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:30:38,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:30:38,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 262 transitions, 2946 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:38,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:38,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:30:38,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:40,545 INFO L124 PetriNetUnfolderBase]: 2499/3842 cut-off events. [2024-06-14 14:30:40,545 INFO L125 PetriNetUnfolderBase]: For 96324/96357 co-relation queries the response was YES. [2024-06-14 14:30:40,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24587 conditions, 3842 events. 2499/3842 cut-off events. For 96324/96357 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 19927 event pairs, 777 based on Foata normal form. 14/3827 useless extension candidates. Maximal degree in co-relation 24523. Up to 3094 conditions per place. [2024-06-14 14:30:40,574 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 189 selfloop transitions, 118 changer transitions 0/313 dead transitions. [2024-06-14 14:30:40,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 313 transitions, 4170 flow [2024-06-14 14:30:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:30:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:30:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-14 14:30:40,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48546511627906974 [2024-06-14 14:30:40,577 INFO L175 Difference]: Start difference. First operand has 147 places, 262 transitions, 2946 flow. Second operand 8 states and 167 transitions. [2024-06-14 14:30:40,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 313 transitions, 4170 flow [2024-06-14 14:30:40,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 313 transitions, 3949 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 14:30:40,665 INFO L231 Difference]: Finished difference. Result has 147 places, 277 transitions, 3237 flow [2024-06-14 14:30:40,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2741, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3237, PETRI_PLACES=147, PETRI_TRANSITIONS=277} [2024-06-14 14:30:40,666 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 103 predicate places. [2024-06-14 14:30:40,666 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 277 transitions, 3237 flow [2024-06-14 14:30:40,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:40,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:40,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:40,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 14:30:40,666 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:30:40,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1682295689, now seen corresponding path program 9 times [2024-06-14 14:30:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:40,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751085558] [2024-06-14 14:30:40,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:40,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:54,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:54,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751085558] [2024-06-14 14:30:54,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751085558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:54,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:54,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:30:54,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555817847] [2024-06-14 14:30:54,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:54,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:30:54,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:54,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:30:54,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:30:54,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:30:54,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 277 transitions, 3237 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:54,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:54,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:30:54,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:56,666 INFO L124 PetriNetUnfolderBase]: 2499/3850 cut-off events. [2024-06-14 14:30:56,666 INFO L125 PetriNetUnfolderBase]: For 89776/89807 co-relation queries the response was YES. [2024-06-14 14:30:56,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24828 conditions, 3850 events. 2499/3850 cut-off events. For 89776/89807 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 20035 event pairs, 810 based on Foata normal form. 12/3838 useless extension candidates. Maximal degree in co-relation 24764. Up to 3444 conditions per place. [2024-06-14 14:30:56,697 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 220 selfloop transitions, 80 changer transitions 0/306 dead transitions. [2024-06-14 14:30:56,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 306 transitions, 4035 flow [2024-06-14 14:30:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:30:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:30:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-14 14:30:56,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45058139534883723 [2024-06-14 14:30:56,700 INFO L175 Difference]: Start difference. First operand has 147 places, 277 transitions, 3237 flow. Second operand 8 states and 155 transitions. [2024-06-14 14:30:56,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 306 transitions, 4035 flow [2024-06-14 14:30:56,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 306 transitions, 3883 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-14 14:30:56,809 INFO L231 Difference]: Finished difference. Result has 151 places, 280 transitions, 3315 flow [2024-06-14 14:30:56,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3087, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3315, PETRI_PLACES=151, PETRI_TRANSITIONS=280} [2024-06-14 14:30:56,809 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 107 predicate places. [2024-06-14 14:30:56,809 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 280 transitions, 3315 flow [2024-06-14 14:30:56,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:56,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:56,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:56,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 14:30:56,810 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:30:56,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:56,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1682289954, now seen corresponding path program 5 times [2024-06-14 14:30:56,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:56,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811019002] [2024-06-14 14:30:56,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:56,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:09,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:09,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811019002] [2024-06-14 14:31:09,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811019002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:09,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:09,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:31:09,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966583480] [2024-06-14 14:31:09,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:09,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:31:09,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:09,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:31:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:31:09,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:31:09,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 280 transitions, 3315 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:09,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:09,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:31:09,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:11,254 INFO L124 PetriNetUnfolderBase]: 2494/3833 cut-off events. [2024-06-14 14:31:11,254 INFO L125 PetriNetUnfolderBase]: For 89341/89380 co-relation queries the response was YES. [2024-06-14 14:31:11,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24735 conditions, 3833 events. 2494/3833 cut-off events. For 89341/89380 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 19908 event pairs, 771 based on Foata normal form. 14/3818 useless extension candidates. Maximal degree in co-relation 24670. Up to 3097 conditions per place. [2024-06-14 14:31:11,330 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 183 selfloop transitions, 124 changer transitions 0/313 dead transitions. [2024-06-14 14:31:11,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 313 transitions, 4197 flow [2024-06-14 14:31:11,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:31:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:31:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-14 14:31:11,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738372093023256 [2024-06-14 14:31:11,333 INFO L175 Difference]: Start difference. First operand has 151 places, 280 transitions, 3315 flow. Second operand 8 states and 163 transitions. [2024-06-14 14:31:11,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 313 transitions, 4197 flow [2024-06-14 14:31:11,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 313 transitions, 3965 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-06-14 14:31:11,422 INFO L231 Difference]: Finished difference. Result has 153 places, 280 transitions, 3348 flow [2024-06-14 14:31:11,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3083, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3348, PETRI_PLACES=153, PETRI_TRANSITIONS=280} [2024-06-14 14:31:11,423 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 109 predicate places. [2024-06-14 14:31:11,423 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 280 transitions, 3348 flow [2024-06-14 14:31:11,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:11,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:11,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:11,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 14:31:11,423 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:31:11,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2007960992, now seen corresponding path program 6 times [2024-06-14 14:31:11,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:11,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775561036] [2024-06-14 14:31:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:11,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:21,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:21,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775561036] [2024-06-14 14:31:21,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775561036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:21,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:21,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:31:21,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722424684] [2024-06-14 14:31:21,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:21,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:31:21,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:21,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:31:21,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:31:21,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:31:21,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 280 transitions, 3348 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:21,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:21,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:31:21,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:23,651 INFO L124 PetriNetUnfolderBase]: 2521/3882 cut-off events. [2024-06-14 14:31:23,651 INFO L125 PetriNetUnfolderBase]: For 98357/98391 co-relation queries the response was YES. [2024-06-14 14:31:23,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25551 conditions, 3882 events. 2521/3882 cut-off events. For 98357/98391 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 20250 event pairs, 983 based on Foata normal form. 4/3854 useless extension candidates. Maximal degree in co-relation 25485. Up to 3601 conditions per place. [2024-06-14 14:31:23,680 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 279 selfloop transitions, 24 changer transitions 0/309 dead transitions. [2024-06-14 14:31:23,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 309 transitions, 4154 flow [2024-06-14 14:31:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:31:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:31:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-14 14:31:23,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4160206718346253 [2024-06-14 14:31:23,682 INFO L175 Difference]: Start difference. First operand has 153 places, 280 transitions, 3348 flow. Second operand 9 states and 161 transitions. [2024-06-14 14:31:23,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 309 transitions, 4154 flow [2024-06-14 14:31:23,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 309 transitions, 3870 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 14:31:23,781 INFO L231 Difference]: Finished difference. Result has 154 places, 283 transitions, 3188 flow [2024-06-14 14:31:23,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3070, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3188, PETRI_PLACES=154, PETRI_TRANSITIONS=283} [2024-06-14 14:31:23,782 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 110 predicate places. [2024-06-14 14:31:23,782 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 283 transitions, 3188 flow [2024-06-14 14:31:23,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:23,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:23,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:23,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 14:31:23,782 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:31:23,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:23,782 INFO L85 PathProgramCache]: Analyzing trace with hash -680719921, now seen corresponding path program 10 times [2024-06-14 14:31:23,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:23,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365365811] [2024-06-14 14:31:23,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:23,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:37,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:37,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365365811] [2024-06-14 14:31:37,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365365811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:37,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:37,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:31:37,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072810556] [2024-06-14 14:31:37,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:37,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:31:37,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:37,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:31:37,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:31:37,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:31:37,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 283 transitions, 3188 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:37,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:37,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:31:37,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:39,593 INFO L124 PetriNetUnfolderBase]: 2516/3875 cut-off events. [2024-06-14 14:31:39,594 INFO L125 PetriNetUnfolderBase]: For 95684/95718 co-relation queries the response was YES. [2024-06-14 14:31:39,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25000 conditions, 3875 events. 2516/3875 cut-off events. For 95684/95718 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 20238 event pairs, 977 based on Foata normal form. 2/3845 useless extension candidates. Maximal degree in co-relation 24934. Up to 3615 conditions per place. [2024-06-14 14:31:39,622 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 276 selfloop transitions, 26 changer transitions 0/308 dead transitions. [2024-06-14 14:31:39,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 308 transitions, 3960 flow [2024-06-14 14:31:39,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:31:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:31:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-14 14:31:39,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43023255813953487 [2024-06-14 14:31:39,625 INFO L175 Difference]: Start difference. First operand has 154 places, 283 transitions, 3188 flow. Second operand 8 states and 148 transitions. [2024-06-14 14:31:39,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 308 transitions, 3960 flow [2024-06-14 14:31:39,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 308 transitions, 3876 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-14 14:31:39,728 INFO L231 Difference]: Finished difference. Result has 155 places, 286 transitions, 3226 flow [2024-06-14 14:31:39,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3104, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3226, PETRI_PLACES=155, PETRI_TRANSITIONS=286} [2024-06-14 14:31:39,728 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 111 predicate places. [2024-06-14 14:31:39,728 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 286 transitions, 3226 flow [2024-06-14 14:31:39,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:39,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:39,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:39,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 14:31:39,729 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:31:39,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:39,729 INFO L85 PathProgramCache]: Analyzing trace with hash 431710996, now seen corresponding path program 7 times [2024-06-14 14:31:39,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:39,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985000075] [2024-06-14 14:31:39,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:39,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:52,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:52,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985000075] [2024-06-14 14:31:52,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985000075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:52,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:52,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:31:52,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043010319] [2024-06-14 14:31:52,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:52,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:31:52,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:52,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:31:52,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:31:53,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:31:53,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 286 transitions, 3226 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:53,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:53,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:31:53,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:55,198 INFO L124 PetriNetUnfolderBase]: 2552/3926 cut-off events. [2024-06-14 14:31:55,199 INFO L125 PetriNetUnfolderBase]: For 104644/104676 co-relation queries the response was YES. [2024-06-14 14:31:55,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25889 conditions, 3926 events. 2552/3926 cut-off events. For 104644/104676 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 20507 event pairs, 977 based on Foata normal form. 6/3900 useless extension candidates. Maximal degree in co-relation 25822. Up to 3502 conditions per place. [2024-06-14 14:31:55,228 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 261 selfloop transitions, 56 changer transitions 0/323 dead transitions. [2024-06-14 14:31:55,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 323 transitions, 4243 flow [2024-06-14 14:31:55,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:31:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:31:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-14 14:31:55,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2024-06-14 14:31:55,231 INFO L175 Difference]: Start difference. First operand has 155 places, 286 transitions, 3226 flow. Second operand 8 states and 156 transitions. [2024-06-14 14:31:55,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 323 transitions, 4243 flow [2024-06-14 14:31:55,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 323 transitions, 4149 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-14 14:31:55,326 INFO L231 Difference]: Finished difference. Result has 157 places, 292 transitions, 3369 flow [2024-06-14 14:31:55,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3132, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3369, PETRI_PLACES=157, PETRI_TRANSITIONS=292} [2024-06-14 14:31:55,327 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 113 predicate places. [2024-06-14 14:31:55,327 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 292 transitions, 3369 flow [2024-06-14 14:31:55,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:55,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:55,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:55,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 14:31:55,328 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:31:55,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:55,328 INFO L85 PathProgramCache]: Analyzing trace with hash 431716576, now seen corresponding path program 8 times [2024-06-14 14:31:55,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:55,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354367696] [2024-06-14 14:31:55,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:55,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:08,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:08,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354367696] [2024-06-14 14:32:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354367696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:08,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:08,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:32:08,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913165860] [2024-06-14 14:32:08,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:08,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:32:08,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:32:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:32:09,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:32:09,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 292 transitions, 3369 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:09,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:09,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:32:09,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:10,976 INFO L124 PetriNetUnfolderBase]: 2536/3905 cut-off events. [2024-06-14 14:32:10,977 INFO L125 PetriNetUnfolderBase]: For 110061/110093 co-relation queries the response was YES. [2024-06-14 14:32:10,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25980 conditions, 3905 events. 2536/3905 cut-off events. For 110061/110093 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20402 event pairs, 972 based on Foata normal form. 6/3879 useless extension candidates. Maximal degree in co-relation 25912. Up to 3489 conditions per place. [2024-06-14 14:32:11,013 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 264 selfloop transitions, 53 changer transitions 0/323 dead transitions. [2024-06-14 14:32:11,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 323 transitions, 4187 flow [2024-06-14 14:32:11,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:32:11,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:32:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-14 14:32:11,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45058139534883723 [2024-06-14 14:32:11,016 INFO L175 Difference]: Start difference. First operand has 157 places, 292 transitions, 3369 flow. Second operand 8 states and 155 transitions. [2024-06-14 14:32:11,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 323 transitions, 4187 flow [2024-06-14 14:32:11,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 323 transitions, 3919 flow, removed 67 selfloop flow, removed 6 redundant places. [2024-06-14 14:32:11,170 INFO L231 Difference]: Finished difference. Result has 159 places, 292 transitions, 3220 flow [2024-06-14 14:32:11,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3101, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3220, PETRI_PLACES=159, PETRI_TRANSITIONS=292} [2024-06-14 14:32:11,171 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 115 predicate places. [2024-06-14 14:32:11,171 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 292 transitions, 3220 flow [2024-06-14 14:32:11,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:11,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:11,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:11,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 14:32:11,172 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:32:11,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash 439345273, now seen corresponding path program 1 times [2024-06-14 14:32:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:11,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617850357] [2024-06-14 14:32:11,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:11,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:28,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:28,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617850357] [2024-06-14 14:32:28,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617850357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:28,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:28,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:32:28,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829041468] [2024-06-14 14:32:28,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:28,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:32:28,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:28,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:32:28,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:32:28,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-14 14:32:28,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 292 transitions, 3220 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:28,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:28,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-14 14:32:28,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:30,914 INFO L124 PetriNetUnfolderBase]: 3020/4534 cut-off events. [2024-06-14 14:32:30,914 INFO L125 PetriNetUnfolderBase]: For 130573/130603 co-relation queries the response was YES. [2024-06-14 14:32:30,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29571 conditions, 4534 events. 3020/4534 cut-off events. For 130573/130603 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 22720 event pairs, 1202 based on Foata normal form. 4/4503 useless extension candidates. Maximal degree in co-relation 29502. Up to 4338 conditions per place. [2024-06-14 14:32:31,005 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 293 selfloop transitions, 16 changer transitions 0/314 dead transitions. [2024-06-14 14:32:31,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 314 transitions, 3978 flow [2024-06-14 14:32:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:32:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:32:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-14 14:32:31,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219269102990033 [2024-06-14 14:32:31,009 INFO L175 Difference]: Start difference. First operand has 159 places, 292 transitions, 3220 flow. Second operand 7 states and 127 transitions. [2024-06-14 14:32:31,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 314 transitions, 3978 flow [2024-06-14 14:32:31,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 314 transitions, 3830 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 14:32:31,131 INFO L231 Difference]: Finished difference. Result has 159 places, 294 transitions, 3157 flow [2024-06-14 14:32:31,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3074, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3157, PETRI_PLACES=159, PETRI_TRANSITIONS=294} [2024-06-14 14:32:31,131 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 115 predicate places. [2024-06-14 14:32:31,131 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 294 transitions, 3157 flow [2024-06-14 14:32:31,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:31,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:31,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:31,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 14:32:31,132 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:32:31,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:31,133 INFO L85 PathProgramCache]: Analyzing trace with hash 400506612, now seen corresponding path program 1 times [2024-06-14 14:32:31,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:31,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009771779] [2024-06-14 14:32:31,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:31,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009771779] [2024-06-14 14:32:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009771779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:50,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:50,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:32:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485098045] [2024-06-14 14:32:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:50,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:32:50,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:50,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:32:50,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:32:50,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:32:50,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 294 transitions, 3157 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:50,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:50,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:32:50,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:52,249 INFO L124 PetriNetUnfolderBase]: 2808/4276 cut-off events. [2024-06-14 14:32:52,249 INFO L125 PetriNetUnfolderBase]: For 127767/127997 co-relation queries the response was YES. [2024-06-14 14:32:52,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27057 conditions, 4276 events. 2808/4276 cut-off events. For 127767/127997 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 22115 event pairs, 1233 based on Foata normal form. 58/4240 useless extension candidates. Maximal degree in co-relation 26987. Up to 3982 conditions per place. [2024-06-14 14:32:52,282 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 234 selfloop transitions, 12 changer transitions 0/307 dead transitions. [2024-06-14 14:32:52,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 307 transitions, 3711 flow [2024-06-14 14:32:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:32:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:32:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-14 14:32:52,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42248062015503873 [2024-06-14 14:32:52,283 INFO L175 Difference]: Start difference. First operand has 159 places, 294 transitions, 3157 flow. Second operand 6 states and 109 transitions. [2024-06-14 14:32:52,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 307 transitions, 3711 flow [2024-06-14 14:32:52,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 307 transitions, 3646 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-14 14:32:52,388 INFO L231 Difference]: Finished difference. Result has 160 places, 297 transitions, 3154 flow [2024-06-14 14:32:52,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3092, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3154, PETRI_PLACES=160, PETRI_TRANSITIONS=297} [2024-06-14 14:32:52,389 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 116 predicate places. [2024-06-14 14:32:52,389 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 297 transitions, 3154 flow [2024-06-14 14:32:52,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:52,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:52,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:52,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 14:32:52,390 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:32:52,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash 732573249, now seen corresponding path program 1 times [2024-06-14 14:32:52,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:52,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621143243] [2024-06-14 14:32:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:52,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:09,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:09,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621143243] [2024-06-14 14:33:09,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621143243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:09,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:09,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:33:09,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368868753] [2024-06-14 14:33:09,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:09,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:33:09,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:09,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:33:09,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:33:09,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:33:09,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 297 transitions, 3154 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:09,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:09,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:33:09,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:11,695 INFO L124 PetriNetUnfolderBase]: 2598/4005 cut-off events. [2024-06-14 14:33:11,695 INFO L125 PetriNetUnfolderBase]: For 117388/117417 co-relation queries the response was YES. [2024-06-14 14:33:11,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26504 conditions, 4005 events. 2598/4005 cut-off events. For 117388/117417 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21041 event pairs, 828 based on Foata normal form. 10/3986 useless extension candidates. Maximal degree in co-relation 26433. Up to 3502 conditions per place. [2024-06-14 14:33:11,726 INFO L140 encePairwiseOnDemand]: 28/43 looper letters, 267 selfloop transitions, 90 changer transitions 0/363 dead transitions. [2024-06-14 14:33:11,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 363 transitions, 4392 flow [2024-06-14 14:33:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:33:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:33:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions. [2024-06-14 14:33:11,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45155038759689925 [2024-06-14 14:33:11,729 INFO L175 Difference]: Start difference. First operand has 160 places, 297 transitions, 3154 flow. Second operand 12 states and 233 transitions. [2024-06-14 14:33:11,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 363 transitions, 4392 flow [2024-06-14 14:33:11,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 363 transitions, 4352 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-14 14:33:11,841 INFO L231 Difference]: Finished difference. Result has 170 places, 315 transitions, 3564 flow [2024-06-14 14:33:11,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3114, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3564, PETRI_PLACES=170, PETRI_TRANSITIONS=315} [2024-06-14 14:33:11,841 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 126 predicate places. [2024-06-14 14:33:11,841 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 315 transitions, 3564 flow [2024-06-14 14:33:11,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:11,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:11,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:11,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 14:33:11,842 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:33:11,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash 45172225, now seen corresponding path program 1 times [2024-06-14 14:33:11,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:11,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602131599] [2024-06-14 14:33:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:26,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:26,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602131599] [2024-06-14 14:33:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602131599] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:26,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:26,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:33:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714244637] [2024-06-14 14:33:26,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:26,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:33:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:26,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:33:26,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:33:27,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:33:27,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 315 transitions, 3564 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:27,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:27,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:33:27,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:29,457 INFO L124 PetriNetUnfolderBase]: 2685/4120 cut-off events. [2024-06-14 14:33:29,458 INFO L125 PetriNetUnfolderBase]: For 135565/135595 co-relation queries the response was YES. [2024-06-14 14:33:29,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28807 conditions, 4120 events. 2685/4120 cut-off events. For 135565/135595 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 21797 event pairs, 680 based on Foata normal form. 14/4099 useless extension candidates. Maximal degree in co-relation 28733. Up to 3471 conditions per place. [2024-06-14 14:33:29,488 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 240 selfloop transitions, 124 changer transitions 0/370 dead transitions. [2024-06-14 14:33:29,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 370 transitions, 4840 flow [2024-06-14 14:33:29,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:33:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:33:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2024-06-14 14:33:29,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 14:33:29,491 INFO L175 Difference]: Start difference. First operand has 170 places, 315 transitions, 3564 flow. Second operand 11 states and 215 transitions. [2024-06-14 14:33:29,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 370 transitions, 4840 flow [2024-06-14 14:33:29,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 370 transitions, 4720 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-14 14:33:29,612 INFO L231 Difference]: Finished difference. Result has 177 places, 324 transitions, 3912 flow [2024-06-14 14:33:29,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3444, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3912, PETRI_PLACES=177, PETRI_TRANSITIONS=324} [2024-06-14 14:33:29,613 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 133 predicate places. [2024-06-14 14:33:29,613 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 324 transitions, 3912 flow [2024-06-14 14:33:29,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:29,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:29,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:29,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 14:33:29,613 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:33:29,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:29,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1491310655, now seen corresponding path program 2 times [2024-06-14 14:33:29,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:29,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787317866] [2024-06-14 14:33:29,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:29,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:47,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787317866] [2024-06-14 14:33:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787317866] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:47,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:33:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404062229] [2024-06-14 14:33:47,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:47,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:33:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:47,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:33:47,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:33:47,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:33:47,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 324 transitions, 3912 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:47,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:47,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:33:47,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:49,618 INFO L124 PetriNetUnfolderBase]: 2795/4318 cut-off events. [2024-06-14 14:33:49,619 INFO L125 PetriNetUnfolderBase]: For 146550/146566 co-relation queries the response was YES. [2024-06-14 14:33:49,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30741 conditions, 4318 events. 2795/4318 cut-off events. For 146550/146566 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 23122 event pairs, 796 based on Foata normal form. 10/4304 useless extension candidates. Maximal degree in co-relation 30663. Up to 3647 conditions per place. [2024-06-14 14:33:49,657 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 244 selfloop transitions, 141 changer transitions 0/391 dead transitions. [2024-06-14 14:33:49,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 391 transitions, 5300 flow [2024-06-14 14:33:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:33:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:33:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 229 transitions. [2024-06-14 14:33:49,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4437984496124031 [2024-06-14 14:33:49,658 INFO L175 Difference]: Start difference. First operand has 177 places, 324 transitions, 3912 flow. Second operand 12 states and 229 transitions. [2024-06-14 14:33:49,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 391 transitions, 5300 flow [2024-06-14 14:33:49,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 391 transitions, 5063 flow, removed 51 selfloop flow, removed 7 redundant places. [2024-06-14 14:33:49,802 INFO L231 Difference]: Finished difference. Result has 184 places, 346 transitions, 4361 flow [2024-06-14 14:33:49,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3675, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4361, PETRI_PLACES=184, PETRI_TRANSITIONS=346} [2024-06-14 14:33:49,803 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 140 predicate places. [2024-06-14 14:33:49,803 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 346 transitions, 4361 flow [2024-06-14 14:33:49,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:49,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:49,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:49,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 14:33:49,803 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:33:49,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:49,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1027896607, now seen corresponding path program 2 times [2024-06-14 14:33:49,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:49,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781937584] [2024-06-14 14:33:49,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:49,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:07,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:07,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781937584] [2024-06-14 14:34:07,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781937584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:07,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:07,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:34:07,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868997579] [2024-06-14 14:34:07,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:07,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:34:07,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:07,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:34:07,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:34:07,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:34:07,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 346 transitions, 4361 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:07,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:07,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:34:07,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:09,736 INFO L124 PetriNetUnfolderBase]: 2904/4488 cut-off events. [2024-06-14 14:34:09,736 INFO L125 PetriNetUnfolderBase]: For 158907/158927 co-relation queries the response was YES. [2024-06-14 14:34:09,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32742 conditions, 4488 events. 2904/4488 cut-off events. For 158907/158927 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 24353 event pairs, 855 based on Foata normal form. 12/4475 useless extension candidates. Maximal degree in co-relation 32661. Up to 3837 conditions per place. [2024-06-14 14:34:09,772 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 265 selfloop transitions, 132 changer transitions 0/403 dead transitions. [2024-06-14 14:34:09,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 403 transitions, 5645 flow [2024-06-14 14:34:09,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:34:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:34:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 214 transitions. [2024-06-14 14:34:09,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.452431289640592 [2024-06-14 14:34:09,775 INFO L175 Difference]: Start difference. First operand has 184 places, 346 transitions, 4361 flow. Second operand 11 states and 214 transitions. [2024-06-14 14:34:09,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 403 transitions, 5645 flow [2024-06-14 14:34:09,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 403 transitions, 5438 flow, removed 68 selfloop flow, removed 6 redundant places. [2024-06-14 14:34:09,978 INFO L231 Difference]: Finished difference. Result has 190 places, 360 transitions, 4672 flow [2024-06-14 14:34:09,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4166, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4672, PETRI_PLACES=190, PETRI_TRANSITIONS=360} [2024-06-14 14:34:09,978 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 146 predicate places. [2024-06-14 14:34:09,979 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 360 transitions, 4672 flow [2024-06-14 14:34:09,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:09,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:09,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:09,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 14:34:09,979 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:34:09,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1481121451, now seen corresponding path program 3 times [2024-06-14 14:34:09,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:09,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524802077] [2024-06-14 14:34:09,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:09,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:25,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:25,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524802077] [2024-06-14 14:34:25,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524802077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:25,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:25,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:25,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302927399] [2024-06-14 14:34:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:25,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:25,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:25,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:25,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:34:25,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 360 transitions, 4672 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:25,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:25,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:34:25,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:27,876 INFO L124 PetriNetUnfolderBase]: 2932/4542 cut-off events. [2024-06-14 14:34:27,876 INFO L125 PetriNetUnfolderBase]: For 159054/159070 co-relation queries the response was YES. [2024-06-14 14:34:27,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33258 conditions, 4542 events. 2932/4542 cut-off events. For 159054/159070 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 24843 event pairs, 866 based on Foata normal form. 10/4526 useless extension candidates. Maximal degree in co-relation 33176. Up to 4017 conditions per place. [2024-06-14 14:34:27,912 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 275 selfloop transitions, 124 changer transitions 0/405 dead transitions. [2024-06-14 14:34:27,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 405 transitions, 5750 flow [2024-06-14 14:34:27,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:34:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:34:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2024-06-14 14:34:27,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44608879492600423 [2024-06-14 14:34:27,915 INFO L175 Difference]: Start difference. First operand has 190 places, 360 transitions, 4672 flow. Second operand 11 states and 211 transitions. [2024-06-14 14:34:27,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 405 transitions, 5750 flow [2024-06-14 14:34:28,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 405 transitions, 5556 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-14 14:34:28,105 INFO L231 Difference]: Finished difference. Result has 194 places, 364 transitions, 4829 flow [2024-06-14 14:34:28,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4478, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4829, PETRI_PLACES=194, PETRI_TRANSITIONS=364} [2024-06-14 14:34:28,106 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 150 predicate places. [2024-06-14 14:34:28,106 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 364 transitions, 4829 flow [2024-06-14 14:34:28,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:28,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:28,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:28,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 14:34:28,106 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:34:28,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash 732927455, now seen corresponding path program 4 times [2024-06-14 14:34:28,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:28,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095899531] [2024-06-14 14:34:28,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:28,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:43,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:43,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095899531] [2024-06-14 14:34:43,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095899531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:43,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:43,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:43,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942039427] [2024-06-14 14:34:43,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:43,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:43,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:43,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:43,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:44,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:34:44,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 364 transitions, 4829 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:44,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:44,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:34:44,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:46,573 INFO L124 PetriNetUnfolderBase]: 2972/4608 cut-off events. [2024-06-14 14:34:46,574 INFO L125 PetriNetUnfolderBase]: For 167537/167551 co-relation queries the response was YES. [2024-06-14 14:34:46,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34277 conditions, 4608 events. 2972/4608 cut-off events. For 167537/167551 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 25293 event pairs, 898 based on Foata normal form. 10/4595 useless extension candidates. Maximal degree in co-relation 34193. Up to 4158 conditions per place. [2024-06-14 14:34:46,610 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 317 selfloop transitions, 89 changer transitions 0/412 dead transitions. [2024-06-14 14:34:46,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 412 transitions, 5963 flow [2024-06-14 14:34:46,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:34:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:34:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2024-06-14 14:34:46,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436046511627907 [2024-06-14 14:34:46,613 INFO L175 Difference]: Start difference. First operand has 194 places, 364 transitions, 4829 flow. Second operand 12 states and 225 transitions. [2024-06-14 14:34:46,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 412 transitions, 5963 flow [2024-06-14 14:34:46,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 412 transitions, 5640 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-06-14 14:34:46,805 INFO L231 Difference]: Finished difference. Result has 197 places, 370 transitions, 4852 flow [2024-06-14 14:34:46,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4536, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4852, PETRI_PLACES=197, PETRI_TRANSITIONS=370} [2024-06-14 14:34:46,806 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 153 predicate places. [2024-06-14 14:34:46,806 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 370 transitions, 4852 flow [2024-06-14 14:34:46,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:46,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:46,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:46,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 14:34:46,806 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:34:46,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:46,806 INFO L85 PathProgramCache]: Analyzing trace with hash 356306711, now seen corresponding path program 5 times [2024-06-14 14:34:46,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:46,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699239355] [2024-06-14 14:34:46,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:46,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:02,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699239355] [2024-06-14 14:35:02,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699239355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:02,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:02,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:35:02,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958350087] [2024-06-14 14:35:02,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:02,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:35:02,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:02,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:35:02,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:35:03,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:35:03,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 370 transitions, 4852 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:03,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:03,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:35:03,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:05,703 INFO L124 PetriNetUnfolderBase]: 2975/4615 cut-off events. [2024-06-14 14:35:05,703 INFO L125 PetriNetUnfolderBase]: For 174388/174404 co-relation queries the response was YES. [2024-06-14 14:35:05,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34271 conditions, 4615 events. 2975/4615 cut-off events. For 174388/174404 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25384 event pairs, 917 based on Foata normal form. 8/4600 useless extension candidates. Maximal degree in co-relation 34186. Up to 4222 conditions per place. [2024-06-14 14:35:05,743 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 346 selfloop transitions, 60 changer transitions 0/412 dead transitions. [2024-06-14 14:35:05,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 412 transitions, 5888 flow [2024-06-14 14:35:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:35:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:35:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 221 transitions. [2024-06-14 14:35:05,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42829457364341084 [2024-06-14 14:35:05,746 INFO L175 Difference]: Start difference. First operand has 197 places, 370 transitions, 4852 flow. Second operand 12 states and 221 transitions. [2024-06-14 14:35:05,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 412 transitions, 5888 flow [2024-06-14 14:35:05,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 412 transitions, 5668 flow, removed 26 selfloop flow, removed 10 redundant places. [2024-06-14 14:35:05,952 INFO L231 Difference]: Finished difference. Result has 199 places, 372 transitions, 4817 flow [2024-06-14 14:35:05,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4632, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4817, PETRI_PLACES=199, PETRI_TRANSITIONS=372} [2024-06-14 14:35:05,953 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 155 predicate places. [2024-06-14 14:35:05,953 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 372 transitions, 4817 flow [2024-06-14 14:35:05,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:05,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:05,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:05,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 14:35:05,953 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:35:05,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1651032213, now seen corresponding path program 6 times [2024-06-14 14:35:05,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:05,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709381357] [2024-06-14 14:35:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:05,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:26,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:26,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709381357] [2024-06-14 14:35:26,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709381357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:26,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:26,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:35:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030855035] [2024-06-14 14:35:26,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:26,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:35:26,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:26,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:35:26,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:35:26,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:35:26,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 372 transitions, 4817 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:26,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:26,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:35:26,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:29,244 INFO L124 PetriNetUnfolderBase]: 3170/4926 cut-off events. [2024-06-14 14:35:29,244 INFO L125 PetriNetUnfolderBase]: For 184608/184620 co-relation queries the response was YES. [2024-06-14 14:35:29,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36197 conditions, 4926 events. 3170/4926 cut-off events. For 184608/184620 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 27410 event pairs, 880 based on Foata normal form. 12/4923 useless extension candidates. Maximal degree in co-relation 36111. Up to 4182 conditions per place. [2024-06-14 14:35:29,287 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 305 selfloop transitions, 128 changer transitions 0/439 dead transitions. [2024-06-14 14:35:29,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 439 transitions, 6355 flow [2024-06-14 14:35:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-14 14:35:29,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2024-06-14 14:35:29,290 INFO L175 Difference]: Start difference. First operand has 199 places, 372 transitions, 4817 flow. Second operand 10 states and 195 transitions. [2024-06-14 14:35:29,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 439 transitions, 6355 flow [2024-06-14 14:35:29,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 439 transitions, 6174 flow, removed 34 selfloop flow, removed 10 redundant places. [2024-06-14 14:35:29,522 INFO L231 Difference]: Finished difference. Result has 200 places, 400 transitions, 5382 flow [2024-06-14 14:35:29,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4636, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5382, PETRI_PLACES=200, PETRI_TRANSITIONS=400} [2024-06-14 14:35:29,522 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 156 predicate places. [2024-06-14 14:35:29,522 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 400 transitions, 5382 flow [2024-06-14 14:35:29,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:29,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:29,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:29,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 14:35:29,523 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:35:29,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash 66182775, now seen corresponding path program 3 times [2024-06-14 14:35:29,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:29,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115896120] [2024-06-14 14:35:29,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:29,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:46,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115896120] [2024-06-14 14:35:46,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115896120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:46,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:46,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:35:46,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390878482] [2024-06-14 14:35:46,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:46,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:35:46,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:46,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:35:46,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:35:46,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:35:46,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 400 transitions, 5382 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:46,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:46,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:35:46,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:49,509 INFO L124 PetriNetUnfolderBase]: 3312/5159 cut-off events. [2024-06-14 14:35:49,509 INFO L125 PetriNetUnfolderBase]: For 204974/204986 co-relation queries the response was YES. [2024-06-14 14:35:49,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38884 conditions, 5159 events. 3312/5159 cut-off events. For 204974/204986 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 29080 event pairs, 878 based on Foata normal form. 12/5156 useless extension candidates. Maximal degree in co-relation 38796. Up to 4409 conditions per place. [2024-06-14 14:35:49,553 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 330 selfloop transitions, 129 changer transitions 0/465 dead transitions. [2024-06-14 14:35:49,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 465 transitions, 7043 flow [2024-06-14 14:35:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-14 14:35:49,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4604651162790698 [2024-06-14 14:35:49,556 INFO L175 Difference]: Start difference. First operand has 200 places, 400 transitions, 5382 flow. Second operand 10 states and 198 transitions. [2024-06-14 14:35:49,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 465 transitions, 7043 flow [2024-06-14 14:35:49,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 465 transitions, 6939 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-14 14:35:49,852 INFO L231 Difference]: Finished difference. Result has 207 places, 422 transitions, 6051 flow [2024-06-14 14:35:49,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5278, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6051, PETRI_PLACES=207, PETRI_TRANSITIONS=422} [2024-06-14 14:35:49,853 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 163 predicate places. [2024-06-14 14:35:49,853 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 422 transitions, 6051 flow [2024-06-14 14:35:49,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:49,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:49,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:49,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 14:35:49,853 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:35:49,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash 66182651, now seen corresponding path program 7 times [2024-06-14 14:35:49,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:49,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114790535] [2024-06-14 14:35:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:06,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:06,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114790535] [2024-06-14 14:36:06,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114790535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:06,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:06,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:36:06,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108198286] [2024-06-14 14:36:06,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:06,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:36:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:06,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:36:06,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:36:06,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:36:06,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 422 transitions, 6051 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:06,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:06,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:36:06,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:09,261 INFO L124 PetriNetUnfolderBase]: 3362/5234 cut-off events. [2024-06-14 14:36:09,261 INFO L125 PetriNetUnfolderBase]: For 221398/221408 co-relation queries the response was YES. [2024-06-14 14:36:09,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40959 conditions, 5234 events. 3362/5234 cut-off events. For 221398/221408 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 29642 event pairs, 934 based on Foata normal form. 12/5231 useless extension candidates. Maximal degree in co-relation 40867. Up to 4758 conditions per place. [2024-06-14 14:36:09,311 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 383 selfloop transitions, 79 changer transitions 0/468 dead transitions. [2024-06-14 14:36:09,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 468 transitions, 7312 flow [2024-06-14 14:36:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:36:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:36:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2024-06-14 14:36:09,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4397463002114165 [2024-06-14 14:36:09,314 INFO L175 Difference]: Start difference. First operand has 207 places, 422 transitions, 6051 flow. Second operand 11 states and 208 transitions. [2024-06-14 14:36:09,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 468 transitions, 7312 flow [2024-06-14 14:36:09,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 468 transitions, 7147 flow, removed 53 selfloop flow, removed 5 redundant places. [2024-06-14 14:36:09,575 INFO L231 Difference]: Finished difference. Result has 213 places, 430 transitions, 6260 flow [2024-06-14 14:36:09,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5886, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6260, PETRI_PLACES=213, PETRI_TRANSITIONS=430} [2024-06-14 14:36:09,576 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 169 predicate places. [2024-06-14 14:36:09,576 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 430 transitions, 6260 flow [2024-06-14 14:36:09,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:09,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:09,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:09,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 14:36:09,576 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:36:09,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1648175253, now seen corresponding path program 8 times [2024-06-14 14:36:09,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:09,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744151514] [2024-06-14 14:36:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:09,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:27,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:27,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744151514] [2024-06-14 14:36:27,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744151514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:27,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:27,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:36:27,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265883345] [2024-06-14 14:36:27,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:27,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:36:27,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:27,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:36:27,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:36:27,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:36:27,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 430 transitions, 6260 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:27,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:27,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:36:27,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:30,446 INFO L124 PetriNetUnfolderBase]: 3344/5201 cut-off events. [2024-06-14 14:36:30,446 INFO L125 PetriNetUnfolderBase]: For 225371/225383 co-relation queries the response was YES. [2024-06-14 14:36:30,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40820 conditions, 5201 events. 3344/5201 cut-off events. For 225371/225383 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 29313 event pairs, 944 based on Foata normal form. 14/5200 useless extension candidates. Maximal degree in co-relation 40726. Up to 4728 conditions per place. [2024-06-14 14:36:30,495 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 385 selfloop transitions, 69 changer transitions 0/460 dead transitions. [2024-06-14 14:36:30,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 460 transitions, 7307 flow [2024-06-14 14:36:30,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:36:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:36:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-14 14:36:30,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 14:36:30,498 INFO L175 Difference]: Start difference. First operand has 213 places, 430 transitions, 6260 flow. Second operand 9 states and 172 transitions. [2024-06-14 14:36:30,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 460 transitions, 7307 flow [2024-06-14 14:36:30,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 460 transitions, 7035 flow, removed 77 selfloop flow, removed 8 redundant places. [2024-06-14 14:36:30,892 INFO L231 Difference]: Finished difference. Result has 214 places, 430 transitions, 6146 flow [2024-06-14 14:36:30,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5988, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6146, PETRI_PLACES=214, PETRI_TRANSITIONS=430} [2024-06-14 14:36:30,893 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 170 predicate places. [2024-06-14 14:36:30,893 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 430 transitions, 6146 flow [2024-06-14 14:36:30,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:30,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:30,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:30,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 14:36:30,893 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:36:30,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash -394328619, now seen corresponding path program 4 times [2024-06-14 14:36:30,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:30,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900270246] [2024-06-14 14:36:30,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:30,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:48,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:48,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900270246] [2024-06-14 14:36:48,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900270246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:48,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:48,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:36:48,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669348687] [2024-06-14 14:36:48,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:48,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:36:48,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:48,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:36:48,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:36:49,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-14 14:36:49,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 430 transitions, 6146 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:49,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:49,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-14 14:36:49,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:51,727 INFO L124 PetriNetUnfolderBase]: 3396/5289 cut-off events. [2024-06-14 14:36:51,728 INFO L125 PetriNetUnfolderBase]: For 233298/233310 co-relation queries the response was YES. [2024-06-14 14:36:51,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41307 conditions, 5289 events. 3396/5289 cut-off events. For 233298/233310 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 29970 event pairs, 900 based on Foata normal form. 14/5288 useless extension candidates. Maximal degree in co-relation 41212. Up to 4746 conditions per place. [2024-06-14 14:36:51,785 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 394 selfloop transitions, 71 changer transitions 0/471 dead transitions. [2024-06-14 14:36:51,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 471 transitions, 7405 flow [2024-06-14 14:36:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:36:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:36:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-14 14:36:51,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45219638242894056 [2024-06-14 14:36:51,788 INFO L175 Difference]: Start difference. First operand has 214 places, 430 transitions, 6146 flow. Second operand 9 states and 175 transitions. [2024-06-14 14:36:51,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 471 transitions, 7405 flow [2024-06-14 14:36:52,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 471 transitions, 7257 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 14:36:52,137 INFO L231 Difference]: Finished difference. Result has 216 places, 439 transitions, 6332 flow [2024-06-14 14:36:52,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5998, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6332, PETRI_PLACES=216, PETRI_TRANSITIONS=439} [2024-06-14 14:36:52,138 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 172 predicate places. [2024-06-14 14:36:52,138 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 439 transitions, 6332 flow [2024-06-14 14:36:52,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:52,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:52,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:52,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 14:36:52,138 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:36:52,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:52,138 INFO L85 PathProgramCache]: Analyzing trace with hash -394333269, now seen corresponding path program 5 times [2024-06-14 14:36:52,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:52,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427564179] [2024-06-14 14:36:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:52,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15