./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix032.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/mix032.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/mix032.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix032.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-bcb38a6-m [2024-06-03 21:46:17,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 21:46:17,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 21:46:17,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 21:46:17,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 21:46:17,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 21:46:17,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 21:46:17,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 21:46:17,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 21:46:17,503 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 21:46:17,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 21:46:17,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 21:46:17,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 21:46:17,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 21:46:17,505 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 21:46:17,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 21:46:17,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 21:46:17,506 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 21:46:17,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 21:46:17,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 21:46:17,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 21:46:17,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 21:46:17,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 21:46:17,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 21:46:17,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 21:46:17,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 21:46:17,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 21:46:17,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 21:46:17,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 21:46:17,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 21:46:17,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 21:46:17,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 21:46:17,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:46:17,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 21:46:17,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 21:46:17,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 21:46:17,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 21:46:17,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 21:46:17,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 21:46:17,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 21:46:17,510 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 21:46:17,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 21:46:17,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 21:46:17,511 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-03 21:46:17,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 21:46:17,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 21:46:17,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 21:46:17,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 21:46:17,712 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 21:46:17,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.oepc.i [2024-06-03 21:46:18,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 21:46:18,969 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 21:46:18,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.oepc.i [2024-06-03 21:46:18,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccd96a1de/7ac1f21ed180405b9c02f55e03210757/FLAG041593ce2 [2024-06-03 21:46:19,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccd96a1de/7ac1f21ed180405b9c02f55e03210757 [2024-06-03 21:46:19,004 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 21:46:19,005 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 21:46:19,006 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/mix032.oepc.yml/witness.yml [2024-06-03 21:46:19,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 21:46:19,189 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 21:46:19,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 21:46:19,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 21:46:19,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 21:46:19,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:46:19" (1/2) ... [2024-06-03 21:46:19,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3869fab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:19, skipping insertion in model container [2024-06-03 21:46:19,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:46:19" (1/2) ... [2024-06-03 21:46:19,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3b5ce502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:19, skipping insertion in model container [2024-06-03 21:46:19,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:46:19" (2/2) ... [2024-06-03 21:46:19,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3869fab3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:19, skipping insertion in model container [2024-06-03 21:46:19,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:46:19" (2/2) ... [2024-06-03 21:46:19,198 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 21:46:19,299 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 21:46:19,300 INFO L97 edCorrectnessWitness]: Location invariant before [L861-L861] (((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )b$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice2 >= 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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 0LL) && (long long )__unbuffered_cnt + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )b$flush_delayed >= 0LL) && (long long )a + (long long )b$mem_tmp >= 0LL) && (long long )a + (long long )b$r_buff0_thd0 >= 0LL) && (long long )a + (long long )b$r_buff0_thd2 >= 0LL) && (long long )a + (long long )b$r_buff0_thd3 >= 0LL) && (long long )a + (long long )b$r_buff1_thd0 >= 0LL) && (long long )a + (long long )b$r_buff1_thd2 >= 0LL) && (long long )a + (long long )b$r_buff1_thd3 >= 0LL) && (long long )a + (long long )b$read_delayed >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )b$flush_delayed >= 0LL) && (long long )b + (long long )b$mem_tmp >= 0LL) && (long long )b + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b + (long long )b$read_delayed >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff1 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )b$flush_delayed + (long long )b$mem_tmp >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$flush_delayed + (long long )x >= 0LL) && (long long )b$flush_delayed + (long long )y >= 0LL) && (long long )b$flush_delayed + (long long )z >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff1 >= 0LL) && (long long )b$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )b$mem_tmp + (long long )x >= 0LL) && (long long )b$mem_tmp + (long long )y >= 0LL) && (long long )b$mem_tmp + (long long )z >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )x >= 0LL) && (long long )b$r_buff0_thd0 + (long long )y >= 0LL) && (long long )b$r_buff0_thd0 + (long long )z >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )x >= 0LL) && (long long )b$r_buff0_thd2 + (long long )y >= 0LL) && (long long )b$r_buff0_thd2 + (long long )z >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )x >= 0LL) && (long long )b$r_buff0_thd3 + (long long )y >= 0LL) && (long long )b$r_buff0_thd3 + (long long )z >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )x >= 0LL) && (long long )b$r_buff1_thd0 + (long long )y >= 0LL) && (long long )b$r_buff1_thd0 + (long long )z >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )x >= 0LL) && (long long )b$r_buff1_thd2 + (long long )y >= 0LL) && (long long )b$r_buff1_thd2 + (long long )z >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )x >= 0LL) && (long long )b$r_buff1_thd3 + (long long )y >= 0LL) && (long long )b$r_buff1_thd3 + (long long )z >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$read_delayed + (long long )x >= 0LL) && (long long )b$read_delayed + (long long )y >= 0LL) && (long long )b$read_delayed + (long long )z >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff1 + (long long )x >= 0LL) && (long long )b$w_buff1 + (long long )y >= 0LL) && (long long )b$w_buff1 + (long long )z >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff1 + (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 )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 )y + (long long )z >= 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 )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) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$w_buff0) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$read_delayed >= 0LL) && (long long )a - (long long )b$r_buff0_thd0 >= 0LL) && (long long )a - (long long )b$r_buff0_thd2 >= 0LL) && (long long )a - (long long )b$r_buff0_thd3 >= 0LL) && (long long )a - (long long )b$r_buff1_thd0 >= 0LL) && (long long )a - (long long )b$r_buff1_thd2 >= 0LL) && (long long )a - (long long )b$r_buff1_thd3 >= 0LL) && (long long )a - (long long )b$read_delayed >= 0LL) && (long long )b - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b - (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 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 <= a) && 0 <= b) && 0 <= b$mem_tmp) && 0 <= b$w_buff0) && 0 <= b$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && b$mem_tmp <= 1) && b$w_buff0 <= 1) && b$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$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)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! 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 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0) [2024-06-03 21:46:19,301 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] (((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )b$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice2 >= 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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 0LL) && (long long )__unbuffered_cnt + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )b$flush_delayed >= 0LL) && (long long )a + (long long )b$mem_tmp >= 0LL) && (long long )a + (long long )b$r_buff0_thd0 >= 0LL) && (long long )a + (long long )b$r_buff0_thd2 >= 0LL) && (long long )a + (long long )b$r_buff0_thd3 >= 0LL) && (long long )a + (long long )b$r_buff1_thd0 >= 0LL) && (long long )a + (long long )b$r_buff1_thd2 >= 0LL) && (long long )a + (long long )b$r_buff1_thd3 >= 0LL) && (long long )a + (long long )b$read_delayed >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )b$flush_delayed >= 0LL) && (long long )b + (long long )b$mem_tmp >= 0LL) && (long long )b + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b + (long long )b$read_delayed >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff1 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )b$flush_delayed + (long long )b$mem_tmp >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$flush_delayed + (long long )x >= 0LL) && (long long )b$flush_delayed + (long long )y >= 0LL) && (long long )b$flush_delayed + (long long )z >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff1 >= 0LL) && (long long )b$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )b$mem_tmp + (long long )x >= 0LL) && (long long )b$mem_tmp + (long long )y >= 0LL) && (long long )b$mem_tmp + (long long )z >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )x >= 0LL) && (long long )b$r_buff0_thd0 + (long long )y >= 0LL) && (long long )b$r_buff0_thd0 + (long long )z >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )x >= 0LL) && (long long )b$r_buff0_thd2 + (long long )y >= 0LL) && (long long )b$r_buff0_thd2 + (long long )z >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )x >= 0LL) && (long long )b$r_buff0_thd3 + (long long )y >= 0LL) && (long long )b$r_buff0_thd3 + (long long )z >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )x >= 0LL) && (long long )b$r_buff1_thd0 + (long long )y >= 0LL) && (long long )b$r_buff1_thd0 + (long long )z >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )x >= 0LL) && (long long )b$r_buff1_thd2 + (long long )y >= 0LL) && (long long )b$r_buff1_thd2 + (long long )z >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )x >= 0LL) && (long long )b$r_buff1_thd3 + (long long )y >= 0LL) && (long long )b$r_buff1_thd3 + (long long )z >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$read_delayed + (long long )x >= 0LL) && (long long )b$read_delayed + (long long )y >= 0LL) && (long long )b$read_delayed + (long long )z >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff1 + (long long )x >= 0LL) && (long long )b$w_buff1 + (long long )y >= 0LL) && (long long )b$w_buff1 + (long long )z >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff1 + (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 )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 )y + (long long )z >= 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 )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) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$w_buff0) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$read_delayed >= 0LL) && (long long )a - (long long )b$r_buff0_thd0 >= 0LL) && (long long )a - (long long )b$r_buff0_thd2 >= 0LL) && (long long )a - (long long )b$r_buff0_thd3 >= 0LL) && (long long )a - (long long )b$r_buff1_thd0 >= 0LL) && (long long )a - (long long )b$r_buff1_thd2 >= 0LL) && (long long )a - (long long )b$r_buff1_thd3 >= 0LL) && (long long )a - (long long )b$read_delayed >= 0LL) && (long long )b - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b - (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 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 <= a) && 0 <= b) && 0 <= b$mem_tmp) && 0 <= b$w_buff0) && 0 <= b$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && b$mem_tmp <= 1) && b$w_buff0 <= 1) && b$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$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)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! 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 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0) [2024-06-03 21:46:19,301 INFO L97 edCorrectnessWitness]: Location invariant before [L860-L860] (((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )b$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice2 >= 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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 0LL) && (long long )__unbuffered_cnt + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )b$flush_delayed >= 0LL) && (long long )a + (long long )b$mem_tmp >= 0LL) && (long long )a + (long long )b$r_buff0_thd0 >= 0LL) && (long long )a + (long long )b$r_buff0_thd2 >= 0LL) && (long long )a + (long long )b$r_buff0_thd3 >= 0LL) && (long long )a + (long long )b$r_buff1_thd0 >= 0LL) && (long long )a + (long long )b$r_buff1_thd2 >= 0LL) && (long long )a + (long long )b$r_buff1_thd3 >= 0LL) && (long long )a + (long long )b$read_delayed >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )b$flush_delayed >= 0LL) && (long long )b + (long long )b$mem_tmp >= 0LL) && (long long )b + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b + (long long )b$read_delayed >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff1 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )b$flush_delayed + (long long )b$mem_tmp >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$flush_delayed + (long long )x >= 0LL) && (long long )b$flush_delayed + (long long )y >= 0LL) && (long long )b$flush_delayed + (long long )z >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff1 >= 0LL) && (long long )b$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )b$mem_tmp + (long long )x >= 0LL) && (long long )b$mem_tmp + (long long )y >= 0LL) && (long long )b$mem_tmp + (long long )z >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )x >= 0LL) && (long long )b$r_buff0_thd0 + (long long )y >= 0LL) && (long long )b$r_buff0_thd0 + (long long )z >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )x >= 0LL) && (long long )b$r_buff0_thd2 + (long long )y >= 0LL) && (long long )b$r_buff0_thd2 + (long long )z >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )x >= 0LL) && (long long )b$r_buff0_thd3 + (long long )y >= 0LL) && (long long )b$r_buff0_thd3 + (long long )z >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )x >= 0LL) && (long long )b$r_buff1_thd0 + (long long )y >= 0LL) && (long long )b$r_buff1_thd0 + (long long )z >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )x >= 0LL) && (long long )b$r_buff1_thd2 + (long long )y >= 0LL) && (long long )b$r_buff1_thd2 + (long long )z >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )x >= 0LL) && (long long )b$r_buff1_thd3 + (long long )y >= 0LL) && (long long )b$r_buff1_thd3 + (long long )z >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$read_delayed + (long long )x >= 0LL) && (long long )b$read_delayed + (long long )y >= 0LL) && (long long )b$read_delayed + (long long )z >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff1 + (long long )x >= 0LL) && (long long )b$w_buff1 + (long long )y >= 0LL) && (long long )b$w_buff1 + (long long )z >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff1 + (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 )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 )y + (long long )z >= 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 )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) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$w_buff0) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$read_delayed >= 0LL) && (long long )a - (long long )b$r_buff0_thd0 >= 0LL) && (long long )a - (long long )b$r_buff0_thd2 >= 0LL) && (long long )a - (long long )b$r_buff0_thd3 >= 0LL) && (long long )a - (long long )b$r_buff1_thd0 >= 0LL) && (long long )a - (long long )b$r_buff1_thd2 >= 0LL) && (long long )a - (long long )b$r_buff1_thd3 >= 0LL) && (long long )a - (long long )b$read_delayed >= 0LL) && (long long )b - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b - (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 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 <= a) && 0 <= b) && 0 <= b$mem_tmp) && 0 <= b$w_buff0) && 0 <= b$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && b$mem_tmp <= 1) && b$w_buff0 <= 1) && b$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$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)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! 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 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0) [2024-06-03 21:46:19,302 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 21:46:19,302 INFO L106 edCorrectnessWitness]: ghost_update [L856-L856] multithreaded = 1; [2024-06-03 21:46:19,339 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 21:46:19,653 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:46:19,663 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 21:46:20,025 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:46:20,061 INFO L206 MainTranslator]: Completed translation [2024-06-03 21:46:20,061 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:20 WrapperNode [2024-06-03 21:46:20,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 21:46:20,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 21:46:20,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 21:46:20,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 21:46:20,068 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 03.06 09:46:20" (1/1) ... [2024-06-03 21:46:20,107 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 03.06 09:46:20" (1/1) ... [2024-06-03 21:46:20,220 INFO L138 Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130 [2024-06-03 21:46:20,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 21:46:20,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 21:46:20,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 21:46:20,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 21:46:20,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:20" (1/1) ... [2024-06-03 21:46:20,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:20" (1/1) ... [2024-06-03 21:46:20,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:20" (1/1) ... [2024-06-03 21:46:20,322 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-03 21:46:20,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:20" (1/1) ... [2024-06-03 21:46:20,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:20" (1/1) ... [2024-06-03 21:46:20,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:20" (1/1) ... [2024-06-03 21:46:20,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:20" (1/1) ... [2024-06-03 21:46:20,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:20" (1/1) ... [2024-06-03 21:46:20,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:20" (1/1) ... [2024-06-03 21:46:20,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 21:46:20,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 21:46:20,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 21:46:20,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 21:46:20,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:20" (1/1) ... [2024-06-03 21:46:20,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:46:20,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:46:20,464 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-03 21:46:20,484 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-03 21:46:20,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 21:46:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 21:46:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 21:46:20,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 21:46:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 21:46:20,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 21:46:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 21:46:20,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 21:46:20,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 21:46:20,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 21:46:20,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 21:46:20,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 21:46:20,498 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 21:46:20,671 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 21:46:20,673 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 21:46:22,103 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 21:46:22,105 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 21:46:22,461 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 21:46:22,461 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 21:46:22,461 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:46:22 BoogieIcfgContainer [2024-06-03 21:46:22,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 21:46:22,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 21:46:22,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 21:46:22,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 21:46:22,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:46:19" (1/4) ... [2024-06-03 21:46:22,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e88c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:46:22, skipping insertion in model container [2024-06-03 21:46:22,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:46:19" (2/4) ... [2024-06-03 21:46:22,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e88c1f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:46:22, skipping insertion in model container [2024-06-03 21:46:22,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:20" (3/4) ... [2024-06-03 21:46:22,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e88c1f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:46:22, skipping insertion in model container [2024-06-03 21:46:22,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:46:22" (4/4) ... [2024-06-03 21:46:22,470 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.oepc.i [2024-06-03 21:46:22,483 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 21:46:22,483 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 21:46:22,483 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 21:46:22,635 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 21:46:22,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 102 flow [2024-06-03 21:46:22,721 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2024-06-03 21:46:22,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:46:22,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 21:46:22,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 45 transitions, 102 flow [2024-06-03 21:46:22,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 81 flow [2024-06-03 21:46:22,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 21:46:22,744 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;@4e20c706, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 21:46:22,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 21:46:22,752 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 21:46:22,753 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 21:46:22,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:46:22,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:22,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 21:46:22,754 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-03 21:46:22,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash -906167667, now seen corresponding path program 1 times [2024-06-03 21:46:22,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:22,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282012947] [2024-06-03 21:46:22,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:22,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:46:31,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:31,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282012947] [2024-06-03 21:46:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282012947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:31,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:31,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 21:46:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376488636] [2024-06-03 21:46:31,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:31,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 21:46:31,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:31,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 21:46:31,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 21:46:31,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-03 21:46:31,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 81 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-03 21:46:31,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:31,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-03 21:46:31,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:46:32,742 INFO L124 PetriNetUnfolderBase]: 1566/2427 cut-off events. [2024-06-03 21:46:32,742 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-03 21:46:32,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4840 conditions, 2427 events. 1566/2427 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12245 event pairs, 1097 based on Foata normal form. 1/2350 useless extension candidates. Maximal degree in co-relation 4825. Up to 2326 conditions per place. [2024-06-03 21:46:32,759 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 35 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-06-03 21:46:32,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 185 flow [2024-06-03 21:46:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 21:46:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 21:46:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-06-03 21:46:32,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-03 21:46:32,769 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 81 flow. Second operand 3 states and 81 transitions. [2024-06-03 21:46:32,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 185 flow [2024-06-03 21:46:32,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 21:46:32,773 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 108 flow [2024-06-03 21:46:32,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-03 21:46:32,777 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-06-03 21:46:32,777 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 108 flow [2024-06-03 21:46:32,777 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-03 21:46:32,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:32,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:46:32,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 21:46:32,778 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-03 21:46:32,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:32,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1051273132, now seen corresponding path program 1 times [2024-06-03 21:46:32,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:32,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066049843] [2024-06-03 21:46:32,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:32,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:46:39,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:39,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066049843] [2024-06-03 21:46:39,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066049843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:39,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:39,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 21:46:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745664139] [2024-06-03 21:46:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:39,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 21:46:39,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:39,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 21:46:39,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 21:46:39,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-03 21:46:39,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 108 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-03 21:46:39,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:39,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-03 21:46:39,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:46:41,389 INFO L124 PetriNetUnfolderBase]: 1560/2434 cut-off events. [2024-06-03 21:46:41,389 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2024-06-03 21:46:41,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5452 conditions, 2434 events. 1560/2434 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12365 event pairs, 930 based on Foata normal form. 3/2398 useless extension candidates. Maximal degree in co-relation 5437. Up to 2302 conditions per place. [2024-06-03 21:46:41,401 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 42 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-03 21:46:41,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 252 flow [2024-06-03 21:46:41,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 21:46:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 21:46:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-06-03 21:46:41,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-06-03 21:46:41,405 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 108 flow. Second operand 4 states and 104 transitions. [2024-06-03 21:46:41,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 252 flow [2024-06-03 21:46:41,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 21:46:41,409 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 144 flow [2024-06-03 21:46:41,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-06-03 21:46:41,410 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2024-06-03 21:46:41,410 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 144 flow [2024-06-03 21:46:41,410 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-03 21:46:41,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:41,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:46:41,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 21:46:41,413 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-03 21:46:41,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash 956207307, now seen corresponding path program 1 times [2024-06-03 21:46:41,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:41,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197275123] [2024-06-03 21:46:41,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:48,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-03 21:46:48,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:48,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197275123] [2024-06-03 21:46:48,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197275123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:48,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:48,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:46:48,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876443836] [2024-06-03 21:46:48,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:48,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:46:48,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:48,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:46:48,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:46:48,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:46:48,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 144 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-03 21:46:48,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:48,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:46:48,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:46:50,185 INFO L124 PetriNetUnfolderBase]: 1893/2923 cut-off events. [2024-06-03 21:46:50,185 INFO L125 PetriNetUnfolderBase]: For 1525/1525 co-relation queries the response was YES. [2024-06-03 21:46:50,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7212 conditions, 2923 events. 1893/2923 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14739 event pairs, 878 based on Foata normal form. 3/2878 useless extension candidates. Maximal degree in co-relation 7195. Up to 2753 conditions per place. [2024-06-03 21:46:50,197 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 57 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2024-06-03 21:46:50,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 386 flow [2024-06-03 21:46:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:46:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:46:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-06-03 21:46:50,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2024-06-03 21:46:50,200 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 144 flow. Second operand 6 states and 145 transitions. [2024-06-03 21:46:50,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 386 flow [2024-06-03 21:46:50,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 366 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-03 21:46:50,203 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 202 flow [2024-06-03 21:46:50,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-06-03 21:46:50,203 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2024-06-03 21:46:50,203 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 202 flow [2024-06-03 21:46:50,204 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-03 21:46:50,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:50,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:46:50,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 21:46:50,204 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-03 21:46:50,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:50,205 INFO L85 PathProgramCache]: Analyzing trace with hash -422343181, now seen corresponding path program 1 times [2024-06-03 21:46:50,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:50,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593082192] [2024-06-03 21:46:50,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:50,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:46:58,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593082192] [2024-06-03 21:46:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593082192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:58,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:58,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:46:58,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137061356] [2024-06-03 21:46:58,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:58,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:46:58,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:58,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:46:58,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:46:58,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:46:58,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 202 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-03 21:46:58,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:58,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:46:58,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:00,448 INFO L124 PetriNetUnfolderBase]: 1884/2904 cut-off events. [2024-06-03 21:47:00,448 INFO L125 PetriNetUnfolderBase]: For 3016/3016 co-relation queries the response was YES. [2024-06-03 21:47:00,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7977 conditions, 2904 events. 1884/2904 cut-off events. For 3016/3016 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14545 event pairs, 690 based on Foata normal form. 6/2860 useless extension candidates. Maximal degree in co-relation 7958. Up to 2708 conditions per place. [2024-06-03 21:47:00,460 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 61 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2024-06-03 21:47:00,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 446 flow [2024-06-03 21:47:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:47:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:47:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-06-03 21:47:00,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174603174603175 [2024-06-03 21:47:00,462 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 202 flow. Second operand 7 states and 163 transitions. [2024-06-03 21:47:00,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 446 flow [2024-06-03 21:47:00,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 418 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 21:47:00,467 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 223 flow [2024-06-03 21:47:00,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2024-06-03 21:47:00,469 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2024-06-03 21:47:00,469 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 223 flow [2024-06-03 21:47:00,469 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-03 21:47:00,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:00,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:00,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 21:47:00,470 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-03 21:47:00,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:00,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1201136532, now seen corresponding path program 1 times [2024-06-03 21:47:00,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:00,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989597153] [2024-06-03 21:47:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:00,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:47:16,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:16,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989597153] [2024-06-03 21:47:16,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989597153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:16,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:16,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:47:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960872231] [2024-06-03 21:47:16,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:16,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:47:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:16,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:47:16,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:47:16,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:47:16,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:16,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:16,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:47:16,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:18,496 INFO L124 PetriNetUnfolderBase]: 1879/2897 cut-off events. [2024-06-03 21:47:18,496 INFO L125 PetriNetUnfolderBase]: For 4612/4612 co-relation queries the response was YES. [2024-06-03 21:47:18,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8454 conditions, 2897 events. 1879/2897 cut-off events. For 4612/4612 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14506 event pairs, 812 based on Foata normal form. 2/2849 useless extension candidates. Maximal degree in co-relation 8434. Up to 2767 conditions per place. [2024-06-03 21:47:18,509 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 49 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2024-06-03 21:47:18,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 381 flow [2024-06-03 21:47:18,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:47:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:47:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-06-03 21:47:18,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4577777777777778 [2024-06-03 21:47:18,510 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 223 flow. Second operand 5 states and 103 transitions. [2024-06-03 21:47:18,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 381 flow [2024-06-03 21:47:18,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 342 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 21:47:18,513 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 230 flow [2024-06-03 21:47:18,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2024-06-03 21:47:18,514 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2024-06-03 21:47:18,514 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 230 flow [2024-06-03 21:47:18,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:18,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:18,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:18,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 21:47:18,515 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-03 21:47:18,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:18,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1419474820, now seen corresponding path program 1 times [2024-06-03 21:47:18,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:18,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888938151] [2024-06-03 21:47:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:18,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:47:36,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:36,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888938151] [2024-06-03 21:47:36,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888938151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:36,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:36,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:47:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019421211] [2024-06-03 21:47:36,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:36,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:47:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:36,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:47:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:47:36,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:47:36,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 230 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-03 21:47:36,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:36,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:47:36,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:38,150 INFO L124 PetriNetUnfolderBase]: 2215/3408 cut-off events. [2024-06-03 21:47:38,150 INFO L125 PetriNetUnfolderBase]: For 7255/7255 co-relation queries the response was YES. [2024-06-03 21:47:38,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10470 conditions, 3408 events. 2215/3408 cut-off events. For 7255/7255 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 17088 event pairs, 972 based on Foata normal form. 2/3400 useless extension candidates. Maximal degree in co-relation 10448. Up to 3242 conditions per place. [2024-06-03 21:47:38,174 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 54 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2024-06-03 21:47:38,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 70 transitions, 418 flow [2024-06-03 21:47:38,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:47:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:47:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-03 21:47:38,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2024-06-03 21:47:38,176 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 230 flow. Second operand 6 states and 116 transitions. [2024-06-03 21:47:38,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 70 transitions, 418 flow [2024-06-03 21:47:38,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 396 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 21:47:38,182 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 264 flow [2024-06-03 21:47:38,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-06-03 21:47:38,184 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2024-06-03 21:47:38,184 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 264 flow [2024-06-03 21:47:38,185 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-03 21:47:38,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:38,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:38,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 21:47:38,185 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-03 21:47:38,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:38,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2063699997, now seen corresponding path program 1 times [2024-06-03 21:47:38,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:38,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226503038] [2024-06-03 21:47:38,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:38,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:47:52,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:52,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226503038] [2024-06-03 21:47:52,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226503038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:52,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:47:52,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412481240] [2024-06-03 21:47:52,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:52,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:47:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:47:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:47:52,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:47:52,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:52,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:52,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:47:52,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:53,922 INFO L124 PetriNetUnfolderBase]: 2094/3286 cut-off events. [2024-06-03 21:47:53,922 INFO L125 PetriNetUnfolderBase]: For 9839/9839 co-relation queries the response was YES. [2024-06-03 21:47:53,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10817 conditions, 3286 events. 2094/3286 cut-off events. For 9839/9839 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16940 event pairs, 871 based on Foata normal form. 2/3277 useless extension candidates. Maximal degree in co-relation 10794. Up to 3040 conditions per place. [2024-06-03 21:47:53,935 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 61 selfloop transitions, 17 changer transitions 0/85 dead transitions. [2024-06-03 21:47:53,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 85 transitions, 548 flow [2024-06-03 21:47:53,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:47:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:47:53,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2024-06-03 21:47:53,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-03 21:47:53,937 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 264 flow. Second operand 7 states and 145 transitions. [2024-06-03 21:47:53,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 85 transitions, 548 flow [2024-06-03 21:47:53,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 516 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-03 21:47:53,940 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 324 flow [2024-06-03 21:47:53,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=324, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2024-06-03 21:47:53,941 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2024-06-03 21:47:53,941 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 324 flow [2024-06-03 21:47:53,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:53,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:53,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:53,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 21:47:53,942 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-03 21:47:53,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:53,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2021879373, now seen corresponding path program 2 times [2024-06-03 21:47:53,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:53,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316418425] [2024-06-03 21:47:53,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:53,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:48:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:48:07,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:48:07,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316418425] [2024-06-03 21:48:07,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316418425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:48:07,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:48:07,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:48:07,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717634133] [2024-06-03 21:48:07,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:48:07,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:48:07,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:48:07,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:48:07,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:48:07,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:48:07,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:07,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:48:07,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:48:07,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:48:09,555 INFO L124 PetriNetUnfolderBase]: 2089/3279 cut-off events. [2024-06-03 21:48:09,574 INFO L125 PetriNetUnfolderBase]: For 12804/12804 co-relation queries the response was YES. [2024-06-03 21:48:09,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11515 conditions, 3279 events. 2089/3279 cut-off events. For 12804/12804 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16916 event pairs, 871 based on Foata normal form. 2/3270 useless extension candidates. Maximal degree in co-relation 11491. Up to 3059 conditions per place. [2024-06-03 21:48:09,585 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 58 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2024-06-03 21:48:09,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 76 transitions, 500 flow [2024-06-03 21:48:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:48:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:48:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-03 21:48:09,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44814814814814813 [2024-06-03 21:48:09,601 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 324 flow. Second operand 6 states and 121 transitions. [2024-06-03 21:48:09,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 76 transitions, 500 flow [2024-06-03 21:48:09,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 460 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-03 21:48:09,607 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 314 flow [2024-06-03 21:48:09,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-06-03 21:48:09,610 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2024-06-03 21:48:09,610 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 314 flow [2024-06-03 21:48:09,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:09,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:48:09,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:48:09,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 21:48:09,611 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-03 21:48:09,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:48:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2021871437, now seen corresponding path program 1 times [2024-06-03 21:48:09,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:48:09,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817948810] [2024-06-03 21:48:09,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:48:09,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:48:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:48:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:48:29,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:48:29,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817948810] [2024-06-03 21:48:29,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817948810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:48:29,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:48:29,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:48:29,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879889628] [2024-06-03 21:48:29,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:48:29,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:48:29,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:48:29,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:48:29,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:48:29,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:48:29,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 314 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-03 21:48:29,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:48:29,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:48:29,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:48:31,546 INFO L124 PetriNetUnfolderBase]: 2211/3383 cut-off events. [2024-06-03 21:48:31,549 INFO L125 PetriNetUnfolderBase]: For 14788/14788 co-relation queries the response was YES. [2024-06-03 21:48:31,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12027 conditions, 3383 events. 2211/3383 cut-off events. For 14788/14788 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16814 event pairs, 909 based on Foata normal form. 4/3374 useless extension candidates. Maximal degree in co-relation 12001. Up to 3219 conditions per place. [2024-06-03 21:48:31,591 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 65 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2024-06-03 21:48:31,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 548 flow [2024-06-03 21:48:31,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:48:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:48:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-03 21:48:31,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253968253968254 [2024-06-03 21:48:31,593 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 314 flow. Second operand 7 states and 134 transitions. [2024-06-03 21:48:31,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 548 flow [2024-06-03 21:48:31,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 84 transitions, 514 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 21:48:31,599 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 348 flow [2024-06-03 21:48:31,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=348, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2024-06-03 21:48:31,600 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2024-06-03 21:48:31,600 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 348 flow [2024-06-03 21:48:31,600 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-03 21:48:31,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:48:31,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:48:31,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 21:48:31,601 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-03 21:48:31,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:48:31,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1861742103, now seen corresponding path program 1 times [2024-06-03 21:48:31,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:48:31,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789038827] [2024-06-03 21:48:31,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:48:31,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:48:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:48:45,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:48:45,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:48:45,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789038827] [2024-06-03 21:48:45,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789038827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:48:45,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:48:45,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:48:45,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927462130] [2024-06-03 21:48:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:48:45,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:48:45,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:48:45,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:48:45,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:48:46,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:48:46,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 348 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:46,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:48:46,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:48:46,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:48:48,005 INFO L124 PetriNetUnfolderBase]: 2090/3266 cut-off events. [2024-06-03 21:48:48,006 INFO L125 PetriNetUnfolderBase]: For 18151/18151 co-relation queries the response was YES. [2024-06-03 21:48:48,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12350 conditions, 3266 events. 2090/3266 cut-off events. For 18151/18151 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16749 event pairs, 826 based on Foata normal form. 2/3254 useless extension candidates. Maximal degree in co-relation 12324. Up to 3040 conditions per place. [2024-06-03 21:48:48,033 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 71 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2024-06-03 21:48:48,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 610 flow [2024-06-03 21:48:48,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:48:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:48:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2024-06-03 21:48:48,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-03 21:48:48,035 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 348 flow. Second operand 7 states and 145 transitions. [2024-06-03 21:48:48,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 92 transitions, 610 flow [2024-06-03 21:48:48,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 92 transitions, 566 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-03 21:48:48,041 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 374 flow [2024-06-03 21:48:48,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=374, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2024-06-03 21:48:48,042 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2024-06-03 21:48:48,042 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 374 flow [2024-06-03 21:48:48,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:48,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:48:48,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:48:48,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 21:48:48,043 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-03 21:48:48,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:48:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash -449807885, now seen corresponding path program 1 times [2024-06-03 21:48:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:48:48,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595032717] [2024-06-03 21:48:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:48:48,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:48:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:49:03,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:03,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595032717] [2024-06-03 21:49:03,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595032717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:03,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:03,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:49:03,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729249072] [2024-06-03 21:49:03,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:03,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:49:03,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:49:03,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:49:03,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:49:03,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 374 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-03 21:49:03,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:03,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:49:03,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:05,121 INFO L124 PetriNetUnfolderBase]: 2233/3413 cut-off events. [2024-06-03 21:49:05,122 INFO L125 PetriNetUnfolderBase]: For 21974/21974 co-relation queries the response was YES. [2024-06-03 21:49:05,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13520 conditions, 3413 events. 2233/3413 cut-off events. For 21974/21974 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16972 event pairs, 885 based on Foata normal form. 2/3400 useless extension candidates. Maximal degree in co-relation 13493. Up to 3211 conditions per place. [2024-06-03 21:49:05,139 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 72 selfloop transitions, 24 changer transitions 0/101 dead transitions. [2024-06-03 21:49:05,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 101 transitions, 732 flow [2024-06-03 21:49:05,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:49:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:49:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-03 21:49:05,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2024-06-03 21:49:05,141 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 374 flow. Second operand 8 states and 158 transitions. [2024-06-03 21:49:05,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 101 transitions, 732 flow [2024-06-03 21:49:05,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 101 transitions, 686 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 21:49:05,149 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 446 flow [2024-06-03 21:49:05,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=446, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2024-06-03 21:49:05,150 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2024-06-03 21:49:05,150 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 446 flow [2024-06-03 21:49:05,150 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-03 21:49:05,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:05,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:05,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 21:49:05,151 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-03 21:49:05,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1861622133, now seen corresponding path program 2 times [2024-06-03 21:49:05,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:05,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211042314] [2024-06-03 21:49:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:05,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:49:20,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:20,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211042314] [2024-06-03 21:49:20,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211042314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:20,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:20,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:49:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467516108] [2024-06-03 21:49:20,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:20,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:49:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:20,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:49:20,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:49:20,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:49:20,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 446 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:20,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:20,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:49:20,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:22,465 INFO L124 PetriNetUnfolderBase]: 2119/3334 cut-off events. [2024-06-03 21:49:22,466 INFO L125 PetriNetUnfolderBase]: For 25866/25866 co-relation queries the response was YES. [2024-06-03 21:49:22,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13834 conditions, 3334 events. 2119/3334 cut-off events. For 25866/25866 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17224 event pairs, 820 based on Foata normal form. 2/3321 useless extension candidates. Maximal degree in co-relation 13806. Up to 3025 conditions per place. [2024-06-03 21:49:22,480 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 71 selfloop transitions, 27 changer transitions 0/107 dead transitions. [2024-06-03 21:49:22,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 107 transitions, 828 flow [2024-06-03 21:49:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:49:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:49:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-03 21:49:22,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-03 21:49:22,482 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 446 flow. Second operand 8 states and 165 transitions. [2024-06-03 21:49:22,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 107 transitions, 828 flow [2024-06-03 21:49:22,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 107 transitions, 790 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-03 21:49:22,493 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 548 flow [2024-06-03 21:49:22,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=548, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2024-06-03 21:49:22,494 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places. [2024-06-03 21:49:22,494 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 548 flow [2024-06-03 21:49:22,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:22,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:22,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:22,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 21:49:22,495 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-03 21:49:22,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1684253277, now seen corresponding path program 2 times [2024-06-03 21:49:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:22,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466014146] [2024-06-03 21:49:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:22,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:36,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-03 21:49:36,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:36,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466014146] [2024-06-03 21:49:36,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466014146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:36,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:36,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:49:36,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205242500] [2024-06-03 21:49:36,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:36,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:49:36,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:36,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:49:36,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:49:36,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:49:36,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 548 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-03 21:49:36,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:36,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:49:36,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:38,440 INFO L124 PetriNetUnfolderBase]: 2255/3475 cut-off events. [2024-06-03 21:49:38,441 INFO L125 PetriNetUnfolderBase]: For 31097/31097 co-relation queries the response was YES. [2024-06-03 21:49:38,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15200 conditions, 3475 events. 2255/3475 cut-off events. For 31097/31097 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17487 event pairs, 885 based on Foata normal form. 2/3462 useless extension candidates. Maximal degree in co-relation 15170. Up to 3292 conditions per place. [2024-06-03 21:49:38,456 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 82 selfloop transitions, 14 changer transitions 0/101 dead transitions. [2024-06-03 21:49:38,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 101 transitions, 822 flow [2024-06-03 21:49:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:49:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:49:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-03 21:49:38,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-03 21:49:38,458 INFO L175 Difference]: Start difference. First operand has 76 places, 79 transitions, 548 flow. Second operand 7 states and 133 transitions. [2024-06-03 21:49:38,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 101 transitions, 822 flow [2024-06-03 21:49:38,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 101 transitions, 774 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-03 21:49:38,472 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 576 flow [2024-06-03 21:49:38,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2024-06-03 21:49:38,472 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2024-06-03 21:49:38,472 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 576 flow [2024-06-03 21:49:38,473 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-03 21:49:38,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:38,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:38,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 21:49:38,473 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-03 21:49:38,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:38,473 INFO L85 PathProgramCache]: Analyzing trace with hash -445166441, now seen corresponding path program 3 times [2024-06-03 21:49:38,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:38,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123726589] [2024-06-03 21:49:38,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:38,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:49:54,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:54,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123726589] [2024-06-03 21:49:54,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123726589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:54,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:54,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:49:54,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824383648] [2024-06-03 21:49:54,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:54,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:49:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:54,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:49:54,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:49:54,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:49:54,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 576 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:54,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:54,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:49:54,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:56,238 INFO L124 PetriNetUnfolderBase]: 2125/3343 cut-off events. [2024-06-03 21:49:56,238 INFO L125 PetriNetUnfolderBase]: For 34651/34651 co-relation queries the response was YES. [2024-06-03 21:49:56,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14945 conditions, 3343 events. 2125/3343 cut-off events. For 34651/34651 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17282 event pairs, 820 based on Foata normal form. 2/3330 useless extension candidates. Maximal degree in co-relation 14913. Up to 3088 conditions per place. [2024-06-03 21:49:56,252 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 77 selfloop transitions, 14 changer transitions 0/101 dead transitions. [2024-06-03 21:49:56,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 101 transitions, 806 flow [2024-06-03 21:49:56,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:49:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:49:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-06-03 21:49:56,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44126984126984126 [2024-06-03 21:49:56,254 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 576 flow. Second operand 7 states and 139 transitions. [2024-06-03 21:49:56,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 101 transitions, 806 flow [2024-06-03 21:49:56,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 740 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-03 21:49:56,272 INFO L231 Difference]: Finished difference. Result has 81 places, 82 transitions, 546 flow [2024-06-03 21:49:56,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=81, PETRI_TRANSITIONS=82} [2024-06-03 21:49:56,272 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2024-06-03 21:49:56,272 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 546 flow [2024-06-03 21:49:56,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:56,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:56,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:56,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 21:49:56,273 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-03 21:49:56,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash 773881465, now seen corresponding path program 3 times [2024-06-03 21:49:56,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:56,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405984762] [2024-06-03 21:49:56,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:50:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:50:11,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:50:11,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405984762] [2024-06-03 21:50:11,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405984762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:50:11,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:50:11,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:50:11,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356739327] [2024-06-03 21:50:11,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:50:11,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:50:11,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:50:11,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:50:11,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:50:12,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:50:12,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 546 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-03 21:50:12,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:50:12,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:50:12,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:50:13,981 INFO L124 PetriNetUnfolderBase]: 2245/3461 cut-off events. [2024-06-03 21:50:13,982 INFO L125 PetriNetUnfolderBase]: For 38416/38416 co-relation queries the response was YES. [2024-06-03 21:50:13,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15679 conditions, 3461 events. 2245/3461 cut-off events. For 38416/38416 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17385 event pairs, 885 based on Foata normal form. 2/3448 useless extension candidates. Maximal degree in co-relation 15646. Up to 3260 conditions per place. [2024-06-03 21:50:13,998 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 77 selfloop transitions, 19 changer transitions 0/101 dead transitions. [2024-06-03 21:50:13,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 101 transitions, 786 flow [2024-06-03 21:50:13,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:50:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:50:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-03 21:50:14,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 21:50:14,014 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 546 flow. Second operand 7 states and 135 transitions. [2024-06-03 21:50:14,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 101 transitions, 786 flow [2024-06-03 21:50:14,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 101 transitions, 724 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 21:50:14,034 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 530 flow [2024-06-03 21:50:14,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=530, PETRI_PLACES=82, PETRI_TRANSITIONS=82} [2024-06-03 21:50:14,035 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 36 predicate places. [2024-06-03 21:50:14,035 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 530 flow [2024-06-03 21:50:14,036 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-03 21:50:14,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:50:14,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:50:14,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 21:50:14,036 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:50:14,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:50:14,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1509384458, now seen corresponding path program 1 times [2024-06-03 21:50:14,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:50:14,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253453831] [2024-06-03 21:50:14,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:50:14,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:50:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:50:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:50:35,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:50:35,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253453831] [2024-06-03 21:50:35,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253453831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:50:35,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:50:35,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:50:35,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263305897] [2024-06-03 21:50:35,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:50:35,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:50:35,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:50:35,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:50:35,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:50:35,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:50:35,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:35,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:50:35,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:50:35,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:50:37,172 INFO L124 PetriNetUnfolderBase]: 2285/3635 cut-off events. [2024-06-03 21:50:37,172 INFO L125 PetriNetUnfolderBase]: For 48108/48108 co-relation queries the response was YES. [2024-06-03 21:50:37,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16765 conditions, 3635 events. 2285/3635 cut-off events. For 48108/48108 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19000 event pairs, 997 based on Foata normal form. 1/3634 useless extension candidates. Maximal degree in co-relation 16731. Up to 3360 conditions per place. [2024-06-03 21:50:37,194 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 69 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2024-06-03 21:50:37,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 93 transitions, 726 flow [2024-06-03 21:50:37,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:50:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:50:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-06-03 21:50:37,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-06-03 21:50:37,196 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 530 flow. Second operand 5 states and 99 transitions. [2024-06-03 21:50:37,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 93 transitions, 726 flow [2024-06-03 21:50:37,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 93 transitions, 666 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 21:50:37,215 INFO L231 Difference]: Finished difference. Result has 81 places, 85 transitions, 520 flow [2024-06-03 21:50:37,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=520, PETRI_PLACES=81, PETRI_TRANSITIONS=85} [2024-06-03 21:50:37,215 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2024-06-03 21:50:37,215 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 520 flow [2024-06-03 21:50:37,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:37,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:50:37,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:50:37,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 21:50:37,216 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-03 21:50:37,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:50:37,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1062956100, now seen corresponding path program 1 times [2024-06-03 21:50:37,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:50:37,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336724977] [2024-06-03 21:50:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:50:37,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:50:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:50:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:50:53,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:50:53,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336724977] [2024-06-03 21:50:53,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336724977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:50:53,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:50:53,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:50:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354854504] [2024-06-03 21:50:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:50:53,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:50:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:50:53,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:50:53,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:50:53,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:50:53,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 85 transitions, 520 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:53,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:50:53,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:50:53,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:50:55,569 INFO L124 PetriNetUnfolderBase]: 2191/3447 cut-off events. [2024-06-03 21:50:55,569 INFO L125 PetriNetUnfolderBase]: For 47494/47494 co-relation queries the response was YES. [2024-06-03 21:50:55,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16491 conditions, 3447 events. 2191/3447 cut-off events. For 47494/47494 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17739 event pairs, 814 based on Foata normal form. 2/3447 useless extension candidates. Maximal degree in co-relation 16456. Up to 3153 conditions per place. [2024-06-03 21:50:55,586 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 101 selfloop transitions, 25 changer transitions 0/136 dead transitions. [2024-06-03 21:50:55,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 136 transitions, 1068 flow [2024-06-03 21:50:55,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:50:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:50:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-03 21:50:55,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4288888888888889 [2024-06-03 21:50:55,587 INFO L175 Difference]: Start difference. First operand has 81 places, 85 transitions, 520 flow. Second operand 10 states and 193 transitions. [2024-06-03 21:50:55,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 136 transitions, 1068 flow [2024-06-03 21:50:55,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 136 transitions, 1038 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-03 21:50:55,609 INFO L231 Difference]: Finished difference. Result has 93 places, 105 transitions, 755 flow [2024-06-03 21:50:55,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=755, PETRI_PLACES=93, PETRI_TRANSITIONS=105} [2024-06-03 21:50:55,610 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 47 predicate places. [2024-06-03 21:50:55,610 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 105 transitions, 755 flow [2024-06-03 21:50:55,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:55,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:50:55,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:50:55,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 21:50:55,611 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-03 21:50:55,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:50:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash 672202437, now seen corresponding path program 1 times [2024-06-03 21:50:55,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:50:55,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739366242] [2024-06-03 21:50:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:50:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:50:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:51:10,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:10,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739366242] [2024-06-03 21:51:10,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739366242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:10,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:10,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:51:10,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358373364] [2024-06-03 21:51:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:10,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:51:10,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:51:10,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:51:11,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:51:11,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 105 transitions, 755 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-03 21:51:11,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:11,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:51:11,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:13,155 INFO L124 PetriNetUnfolderBase]: 2327/3582 cut-off events. [2024-06-03 21:51:13,155 INFO L125 PetriNetUnfolderBase]: For 54195/54203 co-relation queries the response was YES. [2024-06-03 21:51:13,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17999 conditions, 3582 events. 2327/3582 cut-off events. For 54195/54203 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17872 event pairs, 842 based on Foata normal form. 6/3586 useless extension candidates. Maximal degree in co-relation 17958. Up to 3348 conditions per place. [2024-06-03 21:51:13,171 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 104 selfloop transitions, 27 changer transitions 0/136 dead transitions. [2024-06-03 21:51:13,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 136 transitions, 1133 flow [2024-06-03 21:51:13,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:51:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:51:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-03 21:51:13,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-03 21:51:13,173 INFO L175 Difference]: Start difference. First operand has 93 places, 105 transitions, 755 flow. Second operand 8 states and 156 transitions. [2024-06-03 21:51:13,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 136 transitions, 1133 flow [2024-06-03 21:51:13,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 136 transitions, 1084 flow, removed 21 selfloop flow, removed 2 redundant places. [2024-06-03 21:51:13,199 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 815 flow [2024-06-03 21:51:13,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=815, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2024-06-03 21:51:13,200 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 53 predicate places. [2024-06-03 21:51:13,200 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 815 flow [2024-06-03 21:51:13,201 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-03 21:51:13,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:13,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:51:13,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 21:51:13,201 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-03 21:51:13,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:13,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1062865890, now seen corresponding path program 2 times [2024-06-03 21:51:13,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:13,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078594897] [2024-06-03 21:51:13,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:51:29,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078594897] [2024-06-03 21:51:29,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078594897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:29,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:29,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:51:29,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002410054] [2024-06-03 21:51:29,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:29,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:51:29,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:29,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:51:29,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:51:29,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:51:29,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 815 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:29,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:29,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:51:29,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:31,784 INFO L124 PetriNetUnfolderBase]: 2215/3473 cut-off events. [2024-06-03 21:51:31,784 INFO L125 PetriNetUnfolderBase]: For 60670/60676 co-relation queries the response was YES. [2024-06-03 21:51:31,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18180 conditions, 3473 events. 2215/3473 cut-off events. For 60670/60676 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17838 event pairs, 792 based on Foata normal form. 8/3479 useless extension candidates. Maximal degree in co-relation 18137. Up to 3158 conditions per place. [2024-06-03 21:51:31,801 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 98 selfloop transitions, 30 changer transitions 0/139 dead transitions. [2024-06-03 21:51:31,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 139 transitions, 1193 flow [2024-06-03 21:51:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:51:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:51:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-03 21:51:31,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527777777777778 [2024-06-03 21:51:31,812 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 815 flow. Second operand 8 states and 163 transitions. [2024-06-03 21:51:31,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 139 transitions, 1193 flow [2024-06-03 21:51:31,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 139 transitions, 1092 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-03 21:51:31,845 INFO L231 Difference]: Finished difference. Result has 101 places, 111 transitions, 838 flow [2024-06-03 21:51:31,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=838, PETRI_PLACES=101, PETRI_TRANSITIONS=111} [2024-06-03 21:51:31,846 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 55 predicate places. [2024-06-03 21:51:31,846 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 111 transitions, 838 flow [2024-06-03 21:51:31,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:31,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:31,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:51:31,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 21:51:31,847 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:51:31,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:31,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1875709782, now seen corresponding path program 3 times [2024-06-03 21:51:31,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:31,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775551113] [2024-06-03 21:51:31,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:31,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:51:47,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:47,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775551113] [2024-06-03 21:51:47,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775551113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:47,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:47,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:51:47,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669877174] [2024-06-03 21:51:47,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:47,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:51:47,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:47,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:51:47,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:51:47,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:51:47,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 111 transitions, 838 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:47,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:47,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:51:47,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:49,896 INFO L124 PetriNetUnfolderBase]: 2226/3491 cut-off events. [2024-06-03 21:51:49,896 INFO L125 PetriNetUnfolderBase]: For 67951/67956 co-relation queries the response was YES. [2024-06-03 21:51:49,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18951 conditions, 3491 events. 2226/3491 cut-off events. For 67951/67956 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17914 event pairs, 798 based on Foata normal form. 6/3495 useless extension candidates. Maximal degree in co-relation 18907. Up to 3133 conditions per place. [2024-06-03 21:51:49,915 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 93 selfloop transitions, 39 changer transitions 0/143 dead transitions. [2024-06-03 21:51:49,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 143 transitions, 1230 flow [2024-06-03 21:51:49,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:51:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:51:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-06-03 21:51:49,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4469135802469136 [2024-06-03 21:51:49,917 INFO L175 Difference]: Start difference. First operand has 101 places, 111 transitions, 838 flow. Second operand 9 states and 181 transitions. [2024-06-03 21:51:49,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 143 transitions, 1230 flow [2024-06-03 21:51:49,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 143 transitions, 1140 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-03 21:51:49,943 INFO L231 Difference]: Finished difference. Result has 104 places, 114 transitions, 892 flow [2024-06-03 21:51:49,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=892, PETRI_PLACES=104, PETRI_TRANSITIONS=114} [2024-06-03 21:51:49,943 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 58 predicate places. [2024-06-03 21:51:49,943 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 114 transitions, 892 flow [2024-06-03 21:51:49,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:49,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:49,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:51:49,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 21:51:49,944 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-03 21:51:49,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash 672346587, now seen corresponding path program 2 times [2024-06-03 21:51:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:49,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464215144] [2024-06-03 21:51:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:05,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:52:05,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:05,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464215144] [2024-06-03 21:52:05,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464215144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:05,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:05,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:52:05,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568838095] [2024-06-03 21:52:05,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:05,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:52:05,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:05,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:52:05,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:52:05,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:52:05,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 114 transitions, 892 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-03 21:52:05,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:05,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:52:05,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:07,528 INFO L124 PetriNetUnfolderBase]: 2371/3651 cut-off events. [2024-06-03 21:52:07,528 INFO L125 PetriNetUnfolderBase]: For 76548/76553 co-relation queries the response was YES. [2024-06-03 21:52:07,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20515 conditions, 3651 events. 2371/3651 cut-off events. For 76548/76553 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 18278 event pairs, 848 based on Foata normal form. 6/3655 useless extension candidates. Maximal degree in co-relation 20470. Up to 3285 conditions per place. [2024-06-03 21:52:07,546 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 99 selfloop transitions, 52 changer transitions 0/156 dead transitions. [2024-06-03 21:52:07,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 156 transitions, 1584 flow [2024-06-03 21:52:07,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:52:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:52:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-06-03 21:52:07,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4469135802469136 [2024-06-03 21:52:07,548 INFO L175 Difference]: Start difference. First operand has 104 places, 114 transitions, 892 flow. Second operand 9 states and 181 transitions. [2024-06-03 21:52:07,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 156 transitions, 1584 flow [2024-06-03 21:52:07,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 156 transitions, 1464 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-03 21:52:07,580 INFO L231 Difference]: Finished difference. Result has 106 places, 123 transitions, 1040 flow [2024-06-03 21:52:07,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1040, PETRI_PLACES=106, PETRI_TRANSITIONS=123} [2024-06-03 21:52:07,581 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 60 predicate places. [2024-06-03 21:52:07,581 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 123 transitions, 1040 flow [2024-06-03 21:52:07,581 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-03 21:52:07,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:07,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:52:07,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 21:52:07,582 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-03 21:52:07,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:07,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1875703830, now seen corresponding path program 1 times [2024-06-03 21:52:07,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:07,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381996258] [2024-06-03 21:52:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:07,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:52:23,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:23,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381996258] [2024-06-03 21:52:23,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381996258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:23,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:23,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:52:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180874892] [2024-06-03 21:52:23,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:23,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:52:23,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:23,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:52:23,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:52:24,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:52:24,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 123 transitions, 1040 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-03 21:52:24,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:24,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:52:24,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:26,054 INFO L124 PetriNetUnfolderBase]: 2409/3707 cut-off events. [2024-06-03 21:52:26,054 INFO L125 PetriNetUnfolderBase]: For 85840/85846 co-relation queries the response was YES. [2024-06-03 21:52:26,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21508 conditions, 3707 events. 2409/3707 cut-off events. For 85840/85846 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 18545 event pairs, 784 based on Foata normal form. 8/3713 useless extension candidates. Maximal degree in co-relation 21462. Up to 3396 conditions per place. [2024-06-03 21:52:26,075 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 123 selfloop transitions, 37 changer transitions 0/165 dead transitions. [2024-06-03 21:52:26,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 165 transitions, 1624 flow [2024-06-03 21:52:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:52:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:52:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-03 21:52:26,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4419753086419753 [2024-06-03 21:52:26,077 INFO L175 Difference]: Start difference. First operand has 106 places, 123 transitions, 1040 flow. Second operand 9 states and 179 transitions. [2024-06-03 21:52:26,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 165 transitions, 1624 flow [2024-06-03 21:52:26,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 165 transitions, 1543 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-03 21:52:26,114 INFO L231 Difference]: Finished difference. Result has 112 places, 132 transitions, 1159 flow [2024-06-03 21:52:26,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1159, PETRI_PLACES=112, PETRI_TRANSITIONS=132} [2024-06-03 21:52:26,114 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 66 predicate places. [2024-06-03 21:52:26,115 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 132 transitions, 1159 flow [2024-06-03 21:52:26,115 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-03 21:52:26,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:26,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:52:26,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 21:52:26,115 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-03 21:52:26,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1059141085, now seen corresponding path program 3 times [2024-06-03 21:52:26,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:26,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616022778] [2024-06-03 21:52:26,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:26,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:52:40,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:40,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616022778] [2024-06-03 21:52:40,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616022778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:40,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:40,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:52:40,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474375819] [2024-06-03 21:52:40,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:40,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:52:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:40,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:52:40,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:52:40,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:52:40,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 132 transitions, 1159 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-03 21:52:40,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:40,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:52:40,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:42,552 INFO L124 PetriNetUnfolderBase]: 2475/3808 cut-off events. [2024-06-03 21:52:42,553 INFO L125 PetriNetUnfolderBase]: For 93828/93828 co-relation queries the response was YES. [2024-06-03 21:52:42,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22928 conditions, 3808 events. 2475/3808 cut-off events. For 93828/93828 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19095 event pairs, 846 based on Foata normal form. 2/3808 useless extension candidates. Maximal degree in co-relation 22879. Up to 3481 conditions per place. [2024-06-03 21:52:42,577 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 127 selfloop transitions, 47 changer transitions 0/179 dead transitions. [2024-06-03 21:52:42,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 179 transitions, 1825 flow [2024-06-03 21:52:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:52:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:52:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-03 21:52:42,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41555555555555557 [2024-06-03 21:52:42,579 INFO L175 Difference]: Start difference. First operand has 112 places, 132 transitions, 1159 flow. Second operand 10 states and 187 transitions. [2024-06-03 21:52:42,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 179 transitions, 1825 flow [2024-06-03 21:52:42,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 179 transitions, 1764 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-03 21:52:42,633 INFO L231 Difference]: Finished difference. Result has 120 places, 149 transitions, 1404 flow [2024-06-03 21:52:42,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1404, PETRI_PLACES=120, PETRI_TRANSITIONS=149} [2024-06-03 21:52:42,634 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 74 predicate places. [2024-06-03 21:52:42,634 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 149 transitions, 1404 flow [2024-06-03 21:52:42,634 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-03 21:52:42,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:42,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:52:42,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 21:52:42,635 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-03 21:52:42,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash -915250338, now seen corresponding path program 2 times [2024-06-03 21:52:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:42,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984873878] [2024-06-03 21:52:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:42,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:54,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-03 21:52:54,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:54,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984873878] [2024-06-03 21:52:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984873878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:54,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:54,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:52:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300483230] [2024-06-03 21:52:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:54,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:52:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:54,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:52:54,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:52:55,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:52:55,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 149 transitions, 1404 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-03 21:52:55,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:55,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:52:55,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:57,145 INFO L124 PetriNetUnfolderBase]: 2497/3843 cut-off events. [2024-06-03 21:52:57,146 INFO L125 PetriNetUnfolderBase]: For 101962/101962 co-relation queries the response was YES. [2024-06-03 21:52:57,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23645 conditions, 3843 events. 2497/3843 cut-off events. For 101962/101962 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19267 event pairs, 846 based on Foata normal form. 4/3845 useless extension candidates. Maximal degree in co-relation 23592. Up to 3572 conditions per place. [2024-06-03 21:52:57,169 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 146 selfloop transitions, 27 changer transitions 0/178 dead transitions. [2024-06-03 21:52:57,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 178 transitions, 1958 flow [2024-06-03 21:52:57,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:52:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:52:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-03 21:52:57,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2024-06-03 21:52:57,170 INFO L175 Difference]: Start difference. First operand has 120 places, 149 transitions, 1404 flow. Second operand 8 states and 158 transitions. [2024-06-03 21:52:57,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 178 transitions, 1958 flow [2024-06-03 21:52:57,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 178 transitions, 1848 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-03 21:52:57,236 INFO L231 Difference]: Finished difference. Result has 122 places, 152 transitions, 1406 flow [2024-06-03 21:52:57,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1406, PETRI_PLACES=122, PETRI_TRANSITIONS=152} [2024-06-03 21:52:57,237 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 76 predicate places. [2024-06-03 21:52:57,237 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 152 transitions, 1406 flow [2024-06-03 21:52:57,237 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-03 21:52:57,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:57,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:52:57,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 21:52:57,237 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-03 21:52:57,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:57,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1700807111, now seen corresponding path program 4 times [2024-06-03 21:52:57,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:57,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569194287] [2024-06-03 21:52:57,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:57,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:53:12,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:12,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569194287] [2024-06-03 21:53:12,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569194287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:12,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:12,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:53:12,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036558640] [2024-06-03 21:53:12,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:12,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:53:12,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:12,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:53:12,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:53:12,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:53:12,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 152 transitions, 1406 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-03 21:53:12,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:12,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:53:12,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:14,369 INFO L124 PetriNetUnfolderBase]: 2524/3882 cut-off events. [2024-06-03 21:53:14,369 INFO L125 PetriNetUnfolderBase]: For 109553/109553 co-relation queries the response was YES. [2024-06-03 21:53:14,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24213 conditions, 3882 events. 2524/3882 cut-off events. For 109553/109553 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19502 event pairs, 846 based on Foata normal form. 2/3882 useless extension candidates. Maximal degree in co-relation 24159. Up to 3627 conditions per place. [2024-06-03 21:53:14,392 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 149 selfloop transitions, 30 changer transitions 0/184 dead transitions. [2024-06-03 21:53:14,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 184 transitions, 2128 flow [2024-06-03 21:53:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:53:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:53:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-03 21:53:14,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2024-06-03 21:53:14,393 INFO L175 Difference]: Start difference. First operand has 122 places, 152 transitions, 1406 flow. Second operand 8 states and 158 transitions. [2024-06-03 21:53:14,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 184 transitions, 2128 flow [2024-06-03 21:53:14,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 184 transitions, 2026 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-03 21:53:14,457 INFO L231 Difference]: Finished difference. Result has 124 places, 158 transitions, 1484 flow [2024-06-03 21:53:14,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1484, PETRI_PLACES=124, PETRI_TRANSITIONS=158} [2024-06-03 21:53:14,459 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 78 predicate places. [2024-06-03 21:53:14,459 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 158 transitions, 1484 flow [2024-06-03 21:53:14,459 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-03 21:53:14,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:14,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:53:14,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 21:53:14,460 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-03 21:53:14,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:14,460 INFO L85 PathProgramCache]: Analyzing trace with hash -679599803, now seen corresponding path program 5 times [2024-06-03 21:53:14,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:14,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224236176] [2024-06-03 21:53:14,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:53:29,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:29,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224236176] [2024-06-03 21:53:29,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224236176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:29,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:29,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:53:29,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58019076] [2024-06-03 21:53:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:29,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:53:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:29,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:53:29,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:53:29,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:53:29,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 158 transitions, 1484 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-03 21:53:29,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:29,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:53:29,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:31,795 INFO L124 PetriNetUnfolderBase]: 2519/3870 cut-off events. [2024-06-03 21:53:31,795 INFO L125 PetriNetUnfolderBase]: For 115596/115596 co-relation queries the response was YES. [2024-06-03 21:53:31,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24336 conditions, 3870 events. 2519/3870 cut-off events. For 115596/115596 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19372 event pairs, 846 based on Foata normal form. 2/3870 useless extension candidates. Maximal degree in co-relation 24281. Up to 3622 conditions per place. [2024-06-03 21:53:31,822 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 146 selfloop transitions, 31 changer transitions 0/182 dead transitions. [2024-06-03 21:53:31,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 182 transitions, 1996 flow [2024-06-03 21:53:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:53:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:53:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-03 21:53:31,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-03 21:53:31,824 INFO L175 Difference]: Start difference. First operand has 124 places, 158 transitions, 1484 flow. Second operand 8 states and 155 transitions. [2024-06-03 21:53:31,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 182 transitions, 1996 flow [2024-06-03 21:53:31,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 182 transitions, 1850 flow, removed 43 selfloop flow, removed 5 redundant places. [2024-06-03 21:53:31,880 INFO L231 Difference]: Finished difference. Result has 127 places, 158 transitions, 1408 flow [2024-06-03 21:53:31,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1408, PETRI_PLACES=127, PETRI_TRANSITIONS=158} [2024-06-03 21:53:31,881 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 81 predicate places. [2024-06-03 21:53:31,881 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 158 transitions, 1408 flow [2024-06-03 21:53:31,881 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-03 21:53:31,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:31,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:53:31,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 21:53:31,882 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-03 21:53:31,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash -679599958, now seen corresponding path program 4 times [2024-06-03 21:53:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:31,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926540390] [2024-06-03 21:53:31,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:53:47,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:47,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926540390] [2024-06-03 21:53:47,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926540390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:47,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:47,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:53:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726839819] [2024-06-03 21:53:47,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:47,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:53:47,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:47,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:53:47,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:53:47,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:53:47,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 158 transitions, 1408 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:47,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:47,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:53:47,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:49,907 INFO L124 PetriNetUnfolderBase]: 2403/3765 cut-off events. [2024-06-03 21:53:49,907 INFO L125 PetriNetUnfolderBase]: For 122649/122649 co-relation queries the response was YES. [2024-06-03 21:53:49,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23930 conditions, 3765 events. 2403/3765 cut-off events. For 122649/122649 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19364 event pairs, 800 based on Foata normal form. 2/3765 useless extension candidates. Maximal degree in co-relation 23874. Up to 3440 conditions per place. [2024-06-03 21:53:49,931 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 145 selfloop transitions, 18 changer transitions 0/183 dead transitions. [2024-06-03 21:53:49,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 183 transitions, 1852 flow [2024-06-03 21:53:49,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:53:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:53:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-03 21:53:49,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4361111111111111 [2024-06-03 21:53:49,932 INFO L175 Difference]: Start difference. First operand has 127 places, 158 transitions, 1408 flow. Second operand 8 states and 157 transitions. [2024-06-03 21:53:49,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 183 transitions, 1852 flow [2024-06-03 21:53:49,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 183 transitions, 1788 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 21:53:49,990 INFO L231 Difference]: Finished difference. Result has 129 places, 161 transitions, 1456 flow [2024-06-03 21:53:49,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1456, PETRI_PLACES=129, PETRI_TRANSITIONS=161} [2024-06-03 21:53:49,990 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 83 predicate places. [2024-06-03 21:53:49,991 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 161 transitions, 1456 flow [2024-06-03 21:53:49,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:49,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:49,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:53:49,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 21:53:49,991 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-03 21:53:49,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash -679392196, now seen corresponding path program 3 times [2024-06-03 21:53:49,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:49,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150248536] [2024-06-03 21:53:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:49,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:54:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:54:05,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:54:05,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150248536] [2024-06-03 21:54:05,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150248536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:54:05,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:54:05,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:54:05,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143216433] [2024-06-03 21:54:05,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:54:05,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:54:05,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:54:05,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:54:05,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:54:05,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:54:05,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 161 transitions, 1456 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-03 21:54:05,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:54:05,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:54:05,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:54:07,543 INFO L124 PetriNetUnfolderBase]: 2552/3924 cut-off events. [2024-06-03 21:54:07,543 INFO L125 PetriNetUnfolderBase]: For 134357/134357 co-relation queries the response was YES. [2024-06-03 21:54:07,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25495 conditions, 3924 events. 2552/3924 cut-off events. For 134357/134357 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19724 event pairs, 850 based on Foata normal form. 4/3926 useless extension candidates. Maximal degree in co-relation 25438. Up to 3675 conditions per place. [2024-06-03 21:54:07,568 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 162 selfloop transitions, 23 changer transitions 0/190 dead transitions. [2024-06-03 21:54:07,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 190 transitions, 2048 flow [2024-06-03 21:54:07,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:54:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:54:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-03 21:54:07,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-03 21:54:07,569 INFO L175 Difference]: Start difference. First operand has 129 places, 161 transitions, 1456 flow. Second operand 8 states and 156 transitions. [2024-06-03 21:54:07,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 190 transitions, 2048 flow [2024-06-03 21:54:07,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 190 transitions, 1960 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-03 21:54:07,635 INFO L231 Difference]: Finished difference. Result has 131 places, 164 transitions, 1470 flow [2024-06-03 21:54:07,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1470, PETRI_PLACES=131, PETRI_TRANSITIONS=164} [2024-06-03 21:54:07,636 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 85 predicate places. [2024-06-03 21:54:07,636 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 164 transitions, 1470 flow [2024-06-03 21:54:07,636 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-03 21:54:07,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:54:07,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:54:07,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 21:54:07,637 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-03 21:54:07,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:54:07,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1693455461, now seen corresponding path program 6 times [2024-06-03 21:54:07,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:54:07,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806015995] [2024-06-03 21:54:07,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:54:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:54:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:54:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:54:22,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:54:22,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806015995] [2024-06-03 21:54:22,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806015995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:54:22,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:54:22,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:54:22,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572402549] [2024-06-03 21:54:22,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:54:22,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:54:22,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:54:22,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:54:22,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:54:22,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:54:22,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 164 transitions, 1470 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-03 21:54:22,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:54:22,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:54:22,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:54:24,867 INFO L124 PetriNetUnfolderBase]: 2547/3917 cut-off events. [2024-06-03 21:54:24,867 INFO L125 PetriNetUnfolderBase]: For 141055/141055 co-relation queries the response was YES. [2024-06-03 21:54:24,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25687 conditions, 3917 events. 2547/3917 cut-off events. For 141055/141055 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19654 event pairs, 850 based on Foata normal form. 2/3917 useless extension candidates. Maximal degree in co-relation 25629. Up to 3710 conditions per place. [2024-06-03 21:54:24,893 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 163 selfloop transitions, 18 changer transitions 0/186 dead transitions. [2024-06-03 21:54:24,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 186 transitions, 1888 flow [2024-06-03 21:54:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:54:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:54:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-03 21:54:24,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-03 21:54:24,900 INFO L175 Difference]: Start difference. First operand has 131 places, 164 transitions, 1470 flow. Second operand 8 states and 150 transitions. [2024-06-03 21:54:24,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 186 transitions, 1888 flow [2024-06-03 21:54:24,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 186 transitions, 1764 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-03 21:54:24,972 INFO L231 Difference]: Finished difference. Result has 133 places, 164 transitions, 1390 flow [2024-06-03 21:54:24,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1390, PETRI_PLACES=133, PETRI_TRANSITIONS=164} [2024-06-03 21:54:24,974 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 87 predicate places. [2024-06-03 21:54:24,974 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 164 transitions, 1390 flow [2024-06-03 21:54:24,975 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-03 21:54:24,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:54:24,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:54:24,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 21:54:24,975 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-03 21:54:24,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:54:24,975 INFO L85 PathProgramCache]: Analyzing trace with hash -671975446, now seen corresponding path program 4 times [2024-06-03 21:54:24,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:54:24,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191501060] [2024-06-03 21:54:24,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:54:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:54:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:54:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:54:39,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:54:39,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191501060] [2024-06-03 21:54:39,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191501060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:54:39,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:54:39,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:54:39,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265512764] [2024-06-03 21:54:39,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:54:39,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:54:39,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:54:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:54:39,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:54:40,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:54:40,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 164 transitions, 1390 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-03 21:54:40,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:54:40,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:54:40,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:54:42,174 INFO L124 PetriNetUnfolderBase]: 2537/3903 cut-off events. [2024-06-03 21:54:42,175 INFO L125 PetriNetUnfolderBase]: For 147736/147736 co-relation queries the response was YES. [2024-06-03 21:54:42,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25628 conditions, 3903 events. 2537/3903 cut-off events. For 147736/147736 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19565 event pairs, 848 based on Foata normal form. 4/3905 useless extension candidates. Maximal degree in co-relation 25569. Up to 3687 conditions per place. [2024-06-03 21:54:42,199 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 164 selfloop transitions, 18 changer transitions 0/187 dead transitions. [2024-06-03 21:54:42,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 187 transitions, 1814 flow [2024-06-03 21:54:42,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:54:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:54:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-03 21:54:42,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-06-03 21:54:42,201 INFO L175 Difference]: Start difference. First operand has 133 places, 164 transitions, 1390 flow. Second operand 8 states and 151 transitions. [2024-06-03 21:54:42,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 187 transitions, 1814 flow [2024-06-03 21:54:42,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 187 transitions, 1730 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-03 21:54:42,280 INFO L231 Difference]: Finished difference. Result has 133 places, 164 transitions, 1350 flow [2024-06-03 21:54:42,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1350, PETRI_PLACES=133, PETRI_TRANSITIONS=164} [2024-06-03 21:54:42,280 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 87 predicate places. [2024-06-03 21:54:42,281 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 164 transitions, 1350 flow [2024-06-03 21:54:42,281 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-03 21:54:42,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:54:42,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:54:42,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 21:54:42,281 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-03 21:54:42,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:54:42,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1344681486, now seen corresponding path program 5 times [2024-06-03 21:54:42,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:54:42,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137400599] [2024-06-03 21:54:42,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:54:42,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:54:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:55:00,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137400599] [2024-06-03 21:55:00,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137400599] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:00,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:55:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826948163] [2024-06-03 21:55:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:00,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:55:00,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:00,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:55:00,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:55:00,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:55:00,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 164 transitions, 1350 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:00,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:00,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:55:00,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:02,748 INFO L124 PetriNetUnfolderBase]: 2503/3907 cut-off events. [2024-06-03 21:55:02,748 INFO L125 PetriNetUnfolderBase]: For 155411/155422 co-relation queries the response was YES. [2024-06-03 21:55:02,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25855 conditions, 3907 events. 2503/3907 cut-off events. For 155411/155422 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 20149 event pairs, 750 based on Foata normal form. 10/3915 useless extension candidates. Maximal degree in co-relation 25795. Up to 3512 conditions per place. [2024-06-03 21:55:02,773 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 162 selfloop transitions, 50 changer transitions 0/232 dead transitions. [2024-06-03 21:55:02,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 232 transitions, 2169 flow [2024-06-03 21:55:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:55:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:55:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2024-06-03 21:55:02,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4488888888888889 [2024-06-03 21:55:02,774 INFO L175 Difference]: Start difference. First operand has 133 places, 164 transitions, 1350 flow. Second operand 10 states and 202 transitions. [2024-06-03 21:55:02,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 232 transitions, 2169 flow [2024-06-03 21:55:02,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 232 transitions, 2121 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 21:55:02,837 INFO L231 Difference]: Finished difference. Result has 139 places, 196 transitions, 1797 flow [2024-06-03 21:55:02,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1797, PETRI_PLACES=139, PETRI_TRANSITIONS=196} [2024-06-03 21:55:02,837 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 93 predicate places. [2024-06-03 21:55:02,838 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 196 transitions, 1797 flow [2024-06-03 21:55:02,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:02,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:02,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:55:02,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 21:55:02,838 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-03 21:55:02,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:02,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1718293940, now seen corresponding path program 6 times [2024-06-03 21:55:02,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:02,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874746735] [2024-06-03 21:55:02,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:02,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:55:19,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:19,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874746735] [2024-06-03 21:55:19,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874746735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:19,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:55:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862516796] [2024-06-03 21:55:19,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:19,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:55:19,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:19,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:55:19,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:55:19,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:55:19,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 196 transitions, 1797 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:19,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:19,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:55:19,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:21,849 INFO L124 PetriNetUnfolderBase]: 2603/4056 cut-off events. [2024-06-03 21:55:21,849 INFO L125 PetriNetUnfolderBase]: For 168518/168528 co-relation queries the response was YES. [2024-06-03 21:55:21,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27894 conditions, 4056 events. 2603/4056 cut-off events. For 168518/168528 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 20936 event pairs, 754 based on Foata normal form. 10/4064 useless extension candidates. Maximal degree in co-relation 27830. Up to 3627 conditions per place. [2024-06-03 21:55:21,876 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 180 selfloop transitions, 73 changer transitions 0/273 dead transitions. [2024-06-03 21:55:21,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 273 transitions, 2954 flow [2024-06-03 21:55:21,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:55:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:55:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2024-06-03 21:55:21,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4488888888888889 [2024-06-03 21:55:21,877 INFO L175 Difference]: Start difference. First operand has 139 places, 196 transitions, 1797 flow. Second operand 10 states and 202 transitions. [2024-06-03 21:55:21,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 273 transitions, 2954 flow [2024-06-03 21:55:21,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 273 transitions, 2746 flow, removed 57 selfloop flow, removed 5 redundant places. [2024-06-03 21:55:21,992 INFO L231 Difference]: Finished difference. Result has 148 places, 240 transitions, 2436 flow [2024-06-03 21:55:21,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2436, PETRI_PLACES=148, PETRI_TRANSITIONS=240} [2024-06-03 21:55:21,993 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 102 predicate places. [2024-06-03 21:55:21,993 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 240 transitions, 2436 flow [2024-06-03 21:55:21,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:21,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:21,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:55:21,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 21:55:21,994 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-03 21:55:21,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:21,994 INFO L85 PathProgramCache]: Analyzing trace with hash -489374832, now seen corresponding path program 7 times [2024-06-03 21:55:21,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:21,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146971899] [2024-06-03 21:55:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:38,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:55:38,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:38,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146971899] [2024-06-03 21:55:38,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146971899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:38,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:38,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:55:38,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977316630] [2024-06-03 21:55:38,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:38,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:55:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:38,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:55:38,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:55:38,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:55:38,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 240 transitions, 2436 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:38,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:38,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:55:38,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:41,072 INFO L124 PetriNetUnfolderBase]: 2639/4116 cut-off events. [2024-06-03 21:55:41,073 INFO L125 PetriNetUnfolderBase]: For 180172/180182 co-relation queries the response was YES. [2024-06-03 21:55:41,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29123 conditions, 4116 events. 2639/4116 cut-off events. For 180172/180182 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 21357 event pairs, 762 based on Foata normal form. 10/4124 useless extension candidates. Maximal degree in co-relation 29054. Up to 3671 conditions per place. [2024-06-03 21:55:41,101 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 196 selfloop transitions, 80 changer transitions 0/296 dead transitions. [2024-06-03 21:55:41,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 296 transitions, 3440 flow [2024-06-03 21:55:41,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:55:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:55:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-03 21:55:41,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2024-06-03 21:55:41,102 INFO L175 Difference]: Start difference. First operand has 148 places, 240 transitions, 2436 flow. Second operand 9 states and 185 transitions. [2024-06-03 21:55:41,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 296 transitions, 3440 flow [2024-06-03 21:55:41,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 296 transitions, 3238 flow, removed 57 selfloop flow, removed 4 redundant places. [2024-06-03 21:55:41,201 INFO L231 Difference]: Finished difference. Result has 154 places, 264 transitions, 2816 flow [2024-06-03 21:55:41,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2295, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2816, PETRI_PLACES=154, PETRI_TRANSITIONS=264} [2024-06-03 21:55:41,201 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 108 predicate places. [2024-06-03 21:55:41,201 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 264 transitions, 2816 flow [2024-06-03 21:55:41,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:41,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:41,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:55:41,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 21:55:41,202 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-03 21:55:41,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:41,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1714478925, now seen corresponding path program 7 times [2024-06-03 21:55:41,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:41,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391600409] [2024-06-03 21:55:41,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:41,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:56:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:56:01,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:56:01,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391600409] [2024-06-03 21:56:01,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391600409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:56:01,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:56:01,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:56:01,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86832180] [2024-06-03 21:56:01,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:56:01,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:56:01,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:56:01,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:56:01,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:56:01,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:56:01,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 264 transitions, 2816 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-03 21:56:01,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:56:01,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:56:01,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:56:03,520 INFO L124 PetriNetUnfolderBase]: 2803/4292 cut-off events. [2024-06-03 21:56:03,521 INFO L125 PetriNetUnfolderBase]: For 191944/191954 co-relation queries the response was YES. [2024-06-03 21:56:03,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30900 conditions, 4292 events. 2803/4292 cut-off events. For 191944/191954 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 21644 event pairs, 816 based on Foata normal form. 10/4300 useless extension candidates. Maximal degree in co-relation 30829. Up to 3926 conditions per place. [2024-06-03 21:56:03,550 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 221 selfloop transitions, 84 changer transitions 0/310 dead transitions. [2024-06-03 21:56:03,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 310 transitions, 3685 flow [2024-06-03 21:56:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:56:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:56:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-03 21:56:03,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43209876543209874 [2024-06-03 21:56:03,560 INFO L175 Difference]: Start difference. First operand has 154 places, 264 transitions, 2816 flow. Second operand 9 states and 175 transitions. [2024-06-03 21:56:03,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 310 transitions, 3685 flow [2024-06-03 21:56:03,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 310 transitions, 3447 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-03 21:56:03,687 INFO L231 Difference]: Finished difference. Result has 159 places, 281 transitions, 2996 flow [2024-06-03 21:56:03,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2578, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2996, PETRI_PLACES=159, PETRI_TRANSITIONS=281} [2024-06-03 21:56:03,687 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 113 predicate places. [2024-06-03 21:56:03,688 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 281 transitions, 2996 flow [2024-06-03 21:56:03,688 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-03 21:56:03,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:56:03,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:56:03,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 21:56:03,688 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:56:03,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:56:03,689 INFO L85 PathProgramCache]: Analyzing trace with hash -453721062, now seen corresponding path program 1 times [2024-06-03 21:56:03,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:56:03,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909077936] [2024-06-03 21:56:03,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:56:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:56:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:56:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:56:25,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:56:25,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909077936] [2024-06-03 21:56:25,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909077936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:56:25,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:56:25,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:56:25,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222088682] [2024-06-03 21:56:25,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:56:25,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:56:25,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:56:25,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:56:25,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:56:26,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:56:26,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 281 transitions, 2996 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-03 21:56:26,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:56:26,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:56:26,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:56:28,611 INFO L124 PetriNetUnfolderBase]: 3108/4749 cut-off events. [2024-06-03 21:56:28,611 INFO L125 PetriNetUnfolderBase]: For 258453/258468 co-relation queries the response was YES. [2024-06-03 21:56:28,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35784 conditions, 4749 events. 3108/4749 cut-off events. For 258453/258468 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 24182 event pairs, 1160 based on Foata normal form. 10/4750 useless extension candidates. Maximal degree in co-relation 35710. Up to 4496 conditions per place. [2024-06-03 21:56:28,650 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 242 selfloop transitions, 12 changer transitions 0/292 dead transitions. [2024-06-03 21:56:28,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 292 transitions, 3556 flow [2024-06-03 21:56:28,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:56:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:56:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-03 21:56:28,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40370370370370373 [2024-06-03 21:56:28,651 INFO L175 Difference]: Start difference. First operand has 159 places, 281 transitions, 2996 flow. Second operand 6 states and 109 transitions. [2024-06-03 21:56:28,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 292 transitions, 3556 flow [2024-06-03 21:56:28,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 292 transitions, 3429 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 21:56:28,783 INFO L231 Difference]: Finished difference. Result has 159 places, 284 transitions, 2931 flow [2024-06-03 21:56:28,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2869, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2931, PETRI_PLACES=159, PETRI_TRANSITIONS=284} [2024-06-03 21:56:28,784 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 113 predicate places. [2024-06-03 21:56:28,784 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 284 transitions, 2931 flow [2024-06-03 21:56:28,784 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-03 21:56:28,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:56:28,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:56:28,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 21:56:28,784 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-03 21:56:28,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:56:28,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1864392296, now seen corresponding path program 1 times [2024-06-03 21:56:28,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:56:28,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492309381] [2024-06-03 21:56:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:56:28,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:56:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:56:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:56:45,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:56:45,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492309381] [2024-06-03 21:56:45,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492309381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:56:45,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:56:45,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:56:45,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50046489] [2024-06-03 21:56:45,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:56:45,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:56:45,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:56:45,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:56:45,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:56:46,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:56:46,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 284 transitions, 2931 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:56:46,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:56:46,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:56:46,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:56:48,932 INFO L124 PetriNetUnfolderBase]: 2788/4318 cut-off events. [2024-06-03 21:56:48,933 INFO L125 PetriNetUnfolderBase]: For 242930/242938 co-relation queries the response was YES. [2024-06-03 21:56:48,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33509 conditions, 4318 events. 2788/4318 cut-off events. For 242930/242938 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 22481 event pairs, 600 based on Foata normal form. 10/4326 useless extension candidates. Maximal degree in co-relation 33434. Up to 3562 conditions per place. [2024-06-03 21:56:48,965 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 175 selfloop transitions, 128 changer transitions 0/328 dead transitions. [2024-06-03 21:56:48,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 328 transitions, 3953 flow [2024-06-03 21:56:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:56:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:56:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 206 transitions. [2024-06-03 21:56:48,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4577777777777778 [2024-06-03 21:56:48,969 INFO L175 Difference]: Start difference. First operand has 159 places, 284 transitions, 2931 flow. Second operand 10 states and 206 transitions. [2024-06-03 21:56:48,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 328 transitions, 3953 flow [2024-06-03 21:56:49,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 328 transitions, 3913 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 21:56:49,113 INFO L231 Difference]: Finished difference. Result has 165 places, 288 transitions, 3294 flow [2024-06-03 21:56:49,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2891, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3294, PETRI_PLACES=165, PETRI_TRANSITIONS=288} [2024-06-03 21:56:49,113 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 119 predicate places. [2024-06-03 21:56:49,113 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 288 transitions, 3294 flow [2024-06-03 21:56:49,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:56:49,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:56:49,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:56:49,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 21:56:49,114 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-03 21:56:49,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:56:49,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1864452870, now seen corresponding path program 1 times [2024-06-03 21:56:49,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:56:49,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150318014] [2024-06-03 21:56:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:56:49,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:56:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:57: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-03 21:57:07,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:57:07,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150318014] [2024-06-03 21:57:07,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150318014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:57:07,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:57:07,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:57:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860493890] [2024-06-03 21:57:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:57:07,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:57:07,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:57:07,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:57:07,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:57:07,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:57:07,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 288 transitions, 3294 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-03 21:57:07,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:57:07,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:57:07,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:57:10,130 INFO L124 PetriNetUnfolderBase]: 2934/4466 cut-off events. [2024-06-03 21:57:10,130 INFO L125 PetriNetUnfolderBase]: For 257912/257918 co-relation queries the response was YES. [2024-06-03 21:57:10,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35449 conditions, 4466 events. 2934/4466 cut-off events. For 257912/257918 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 22663 event pairs, 780 based on Foata normal form. 6/4470 useless extension candidates. Maximal degree in co-relation 35373. Up to 3888 conditions per place. [2024-06-03 21:57:10,162 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 181 selfloop transitions, 144 changer transitions 0/331 dead transitions. [2024-06-03 21:57:10,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 331 transitions, 4170 flow [2024-06-03 21:57:10,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:57:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:57:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-06-03 21:57:10,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-03 21:57:10,185 INFO L175 Difference]: Start difference. First operand has 165 places, 288 transitions, 3294 flow. Second operand 11 states and 210 transitions. [2024-06-03 21:57:10,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 331 transitions, 4170 flow [2024-06-03 21:57:10,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 331 transitions, 3940 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-06-03 21:57:10,348 INFO L231 Difference]: Finished difference. Result has 170 places, 291 transitions, 3458 flow [2024-06-03 21:57:10,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3064, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3458, PETRI_PLACES=170, PETRI_TRANSITIONS=291} [2024-06-03 21:57:10,350 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 124 predicate places. [2024-06-03 21:57:10,350 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 291 transitions, 3458 flow [2024-06-03 21:57:10,350 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-03 21:57:10,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:57:10,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:57:10,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 21:57:10,350 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-03 21:57:10,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:57:10,351 INFO L85 PathProgramCache]: Analyzing trace with hash -447356308, now seen corresponding path program 2 times [2024-06-03 21:57:10,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:57:10,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106777902] [2024-06-03 21:57:10,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:57:10,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:57:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:57:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:57:27,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:57:27,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106777902] [2024-06-03 21:57:27,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106777902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:57:27,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:57:27,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:57:27,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143665326] [2024-06-03 21:57:27,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:57:27,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:57:27,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:57:27,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:57:27,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:57:27,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:57:27,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 291 transitions, 3458 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:57:27,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:57:27,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:57:27,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:57:29,928 INFO L124 PetriNetUnfolderBase]: 2822/4366 cut-off events. [2024-06-03 21:57:29,928 INFO L125 PetriNetUnfolderBase]: For 274876/274882 co-relation queries the response was YES. [2024-06-03 21:57:29,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35621 conditions, 4366 events. 2822/4366 cut-off events. For 274876/274882 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 22706 event pairs, 745 based on Foata normal form. 8/4372 useless extension candidates. Maximal degree in co-relation 35543. Up to 3724 conditions per place. [2024-06-03 21:57:29,964 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 170 selfloop transitions, 134 changer transitions 0/330 dead transitions. [2024-06-03 21:57:29,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 330 transitions, 4258 flow [2024-06-03 21:57:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:57:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:57:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-03 21:57:29,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45111111111111113 [2024-06-03 21:57:29,966 INFO L175 Difference]: Start difference. First operand has 170 places, 291 transitions, 3458 flow. Second operand 10 states and 203 transitions. [2024-06-03 21:57:29,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 330 transitions, 4258 flow [2024-06-03 21:57:30,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 330 transitions, 3924 flow, removed 34 selfloop flow, removed 9 redundant places. [2024-06-03 21:57:30,140 INFO L231 Difference]: Finished difference. Result has 171 places, 293 transitions, 3466 flow [2024-06-03 21:57:30,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3124, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3466, PETRI_PLACES=171, PETRI_TRANSITIONS=293} [2024-06-03 21:57:30,141 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 125 predicate places. [2024-06-03 21:57:30,141 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 293 transitions, 3466 flow [2024-06-03 21:57:30,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:57:30,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:57:30,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:57:30,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 21:57:30,142 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-03 21:57:30,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:57:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1867254216, now seen corresponding path program 1 times [2024-06-03 21:57:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:57:30,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026691616] [2024-06-03 21:57:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:57:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:57:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:57:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:57:46,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:57:46,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026691616] [2024-06-03 21:57:46,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026691616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:57:46,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:57:46,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:57:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143150739] [2024-06-03 21:57:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:57:46,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:57:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:57:46,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:57:46,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:57:46,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:57:46,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 293 transitions, 3466 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-03 21:57:46,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:57:46,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:57:46,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:57:48,939 INFO L124 PetriNetUnfolderBase]: 2976/4537 cut-off events. [2024-06-03 21:57:48,939 INFO L125 PetriNetUnfolderBase]: For 292468/292471 co-relation queries the response was YES. [2024-06-03 21:57:48,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37077 conditions, 4537 events. 2976/4537 cut-off events. For 292468/292471 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 23130 event pairs, 784 based on Foata normal form. 6/4539 useless extension candidates. Maximal degree in co-relation 36998. Up to 4176 conditions per place. [2024-06-03 21:57:48,975 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 256 selfloop transitions, 65 changer transitions 0/327 dead transitions. [2024-06-03 21:57:48,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 327 transitions, 4292 flow [2024-06-03 21:57:48,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:57:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:57:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-03 21:57:48,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2024-06-03 21:57:48,978 INFO L175 Difference]: Start difference. First operand has 171 places, 293 transitions, 3466 flow. Second operand 9 states and 174 transitions. [2024-06-03 21:57:48,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 327 transitions, 4292 flow [2024-06-03 21:57:49,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 327 transitions, 3990 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-03 21:57:49,131 INFO L231 Difference]: Finished difference. Result has 172 places, 296 transitions, 3376 flow [2024-06-03 21:57:49,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3164, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3376, PETRI_PLACES=172, PETRI_TRANSITIONS=296} [2024-06-03 21:57:49,132 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 126 predicate places. [2024-06-03 21:57:49,132 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 296 transitions, 3376 flow [2024-06-03 21:57:49,132 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-03 21:57:49,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:57:49,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:57:49,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 21:57:49,133 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:57:49,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:57:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash -636564214, now seen corresponding path program 3 times [2024-06-03 21:57:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:57:49,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766816183] [2024-06-03 21:57:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:57:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:57:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:58:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:58:05,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:58:05,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766816183] [2024-06-03 21:58:05,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766816183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:58:05,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:58:05,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:58:05,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714942978] [2024-06-03 21:58:05,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:58:05,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:58:05,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:58:05,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:58:05,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:58:05,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:58:05,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 296 transitions, 3376 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:58:05,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:58:05,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:58:05,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:58:08,284 INFO L124 PetriNetUnfolderBase]: 2835/4391 cut-off events. [2024-06-03 21:58:08,284 INFO L125 PetriNetUnfolderBase]: For 301460/301463 co-relation queries the response was YES. [2024-06-03 21:58:08,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36353 conditions, 4391 events. 2835/4391 cut-off events. For 301460/301463 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 22899 event pairs, 749 based on Foata normal form. 6/4393 useless extension candidates. Maximal degree in co-relation 36273. Up to 3888 conditions per place. [2024-06-03 21:58:08,318 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 228 selfloop transitions, 73 changer transitions 0/327 dead transitions. [2024-06-03 21:58:08,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 327 transitions, 4094 flow [2024-06-03 21:58:08,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:58:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:58:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-06-03 21:58:08,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4469135802469136 [2024-06-03 21:58:08,322 INFO L175 Difference]: Start difference. First operand has 172 places, 296 transitions, 3376 flow. Second operand 9 states and 181 transitions. [2024-06-03 21:58:08,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 327 transitions, 4094 flow [2024-06-03 21:58:08,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 327 transitions, 3866 flow, removed 52 selfloop flow, removed 7 redundant places. [2024-06-03 21:58:08,527 INFO L231 Difference]: Finished difference. Result has 174 places, 296 transitions, 3306 flow [2024-06-03 21:58:08,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3148, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3306, PETRI_PLACES=174, PETRI_TRANSITIONS=296} [2024-06-03 21:58:08,527 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 128 predicate places. [2024-06-03 21:58:08,527 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 296 transitions, 3306 flow [2024-06-03 21:58:08,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:58:08,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:58:08,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:58:08,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 21:58:08,528 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-03 21:58:08,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:58:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1982545200, now seen corresponding path program 2 times [2024-06-03 21:58:08,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:58:08,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626097173] [2024-06-03 21:58:08,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:58:08,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:58:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:58:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:58:25,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:58:25,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626097173] [2024-06-03 21:58:25,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626097173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:58:25,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:58:25,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:58:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034430654] [2024-06-03 21:58:25,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:58:25,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:58:25,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:58:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:58:25,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:58:26,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:58:26,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 296 transitions, 3306 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-03 21:58:26,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:58:26,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:58:26,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:58:28,578 INFO L124 PetriNetUnfolderBase]: 2979/4535 cut-off events. [2024-06-03 21:58:28,579 INFO L125 PetriNetUnfolderBase]: For 313773/313779 co-relation queries the response was YES. [2024-06-03 21:58:28,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37505 conditions, 4535 events. 2979/4535 cut-off events. For 313773/313779 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23073 event pairs, 785 based on Foata normal form. 6/4537 useless extension candidates. Maximal degree in co-relation 37424. Up to 3993 conditions per place. [2024-06-03 21:58:28,615 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 209 selfloop transitions, 116 changer transitions 0/331 dead transitions. [2024-06-03 21:58:28,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 331 transitions, 4162 flow [2024-06-03 21:58:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:58:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:58:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-03 21:58:28,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4311111111111111 [2024-06-03 21:58:28,619 INFO L175 Difference]: Start difference. First operand has 174 places, 296 transitions, 3306 flow. Second operand 10 states and 194 transitions. [2024-06-03 21:58:28,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 331 transitions, 4162 flow [2024-06-03 21:58:28,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 331 transitions, 3985 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 21:58:28,817 INFO L231 Difference]: Finished difference. Result has 176 places, 299 transitions, 3459 flow [2024-06-03 21:58:28,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3129, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3459, PETRI_PLACES=176, PETRI_TRANSITIONS=299} [2024-06-03 21:58:28,818 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 130 predicate places. [2024-06-03 21:58:28,818 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 299 transitions, 3459 flow [2024-06-03 21:58:28,818 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-03 21:58:28,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:58:28,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:58:28,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 21:58:28,819 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-03 21:58:28,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:58:28,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1526193432, now seen corresponding path program 2 times [2024-06-03 21:58:28,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:58:28,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975811330] [2024-06-03 21:58:28,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:58:28,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:58:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:58:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:58:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:58:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975811330] [2024-06-03 21:58:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975811330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:58:41,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:58:41,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:58:41,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997595001] [2024-06-03 21:58:41,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:58:41,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:58:41,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:58:41,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:58:41,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:58:41,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:58:41,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 299 transitions, 3459 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:58:41,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:58:41,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:58:41,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:58:43,702 INFO L124 PetriNetUnfolderBase]: 3049/4636 cut-off events. [2024-06-03 21:58:43,702 INFO L125 PetriNetUnfolderBase]: For 340162/340168 co-relation queries the response was YES. [2024-06-03 21:58:43,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39331 conditions, 4636 events. 3049/4636 cut-off events. For 340162/340168 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 23640 event pairs, 756 based on Foata normal form. 8/4640 useless extension candidates. Maximal degree in co-relation 39249. Up to 3864 conditions per place. [2024-06-03 21:58:43,738 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 220 selfloop transitions, 122 changer transitions 0/348 dead transitions. [2024-06-03 21:58:43,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 348 transitions, 4833 flow [2024-06-03 21:58:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:58:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:58:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2024-06-03 21:58:43,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-06-03 21:58:43,756 INFO L175 Difference]: Start difference. First operand has 176 places, 299 transitions, 3459 flow. Second operand 10 states and 216 transitions. [2024-06-03 21:58:43,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 348 transitions, 4833 flow [2024-06-03 21:58:43,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 348 transitions, 4531 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-03 21:58:44,002 INFO L231 Difference]: Finished difference. Result has 178 places, 308 transitions, 3639 flow [2024-06-03 21:58:44,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3157, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3639, PETRI_PLACES=178, PETRI_TRANSITIONS=308} [2024-06-03 21:58:44,002 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 132 predicate places. [2024-06-03 21:58:44,002 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 308 transitions, 3639 flow [2024-06-03 21:58:44,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:58:44,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:58:44,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:58:44,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 21:58:44,003 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-03 21:58:44,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:58:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1982540550, now seen corresponding path program 3 times [2024-06-03 21:58:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:58:44,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384485089] [2024-06-03 21:58:44,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:58:44,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:58:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:59:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:59:00,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:59:00,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384485089] [2024-06-03 21:59:00,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384485089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:59:00,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:59:00,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:59:00,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763495941] [2024-06-03 21:59:00,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:59:00,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:59:00,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:59:00,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:59:00,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:59:00,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:59:00,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 308 transitions, 3639 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-03 21:59:00,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:59:00,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:59:00,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:59:03,035 INFO L124 PetriNetUnfolderBase]: 3076/4675 cut-off events. [2024-06-03 21:59:03,035 INFO L125 PetriNetUnfolderBase]: For 358304/358310 co-relation queries the response was YES. [2024-06-03 21:59:03,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40524 conditions, 4675 events. 3076/4675 cut-off events. For 358304/358310 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 23836 event pairs, 799 based on Foata normal form. 6/4677 useless extension candidates. Maximal degree in co-relation 40441. Up to 4088 conditions per place. [2024-06-03 21:59:03,076 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 220 selfloop transitions, 122 changer transitions 0/348 dead transitions. [2024-06-03 21:59:03,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 348 transitions, 4795 flow [2024-06-03 21:59:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:59:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:59:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-03 21:59:03,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43777777777777777 [2024-06-03 21:59:03,079 INFO L175 Difference]: Start difference. First operand has 178 places, 308 transitions, 3639 flow. Second operand 10 states and 197 transitions. [2024-06-03 21:59:03,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 348 transitions, 4795 flow [2024-06-03 21:59:03,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 348 transitions, 4645 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-03 21:59:03,398 INFO L231 Difference]: Finished difference. Result has 183 places, 314 transitions, 3927 flow [2024-06-03 21:59:03,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3489, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3927, PETRI_PLACES=183, PETRI_TRANSITIONS=314} [2024-06-03 21:59:03,399 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 137 predicate places. [2024-06-03 21:59:03,399 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 314 transitions, 3927 flow [2024-06-03 21:59:03,399 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-03 21:59:03,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:59:03,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:59:03,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 21:59:03,400 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-03 21:59:03,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:59:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1982540426, now seen corresponding path program 4 times [2024-06-03 21:59:03,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:59:03,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503764646] [2024-06-03 21:59:03,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:59:03,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:59:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:59:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:59:19,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:59:19,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503764646] [2024-06-03 21:59:19,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503764646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:59:19,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:59:19,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:59:19,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413867676] [2024-06-03 21:59:19,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:59:19,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:59:19,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:59:19,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:59:19,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:59:19,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:59:19,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 314 transitions, 3927 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:59:19,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:59:19,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:59:19,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:59:22,484 INFO L124 PetriNetUnfolderBase]: 2966/4575 cut-off events. [2024-06-03 21:59:22,485 INFO L125 PetriNetUnfolderBase]: For 377288/377294 co-relation queries the response was YES. [2024-06-03 21:59:22,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40664 conditions, 4575 events. 2966/4575 cut-off events. For 377288/377294 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 23889 event pairs, 764 based on Foata normal form. 8/4579 useless extension candidates. Maximal degree in co-relation 40579. Up to 4025 conditions per place. [2024-06-03 21:59:22,524 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 242 selfloop transitions, 78 changer transitions 0/349 dead transitions. [2024-06-03 21:59:22,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 349 transitions, 4775 flow [2024-06-03 21:59:22,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:59:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:59:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-06-03 21:59:22,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44222222222222224 [2024-06-03 21:59:22,527 INFO L175 Difference]: Start difference. First operand has 183 places, 314 transitions, 3927 flow. Second operand 10 states and 199 transitions. [2024-06-03 21:59:22,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 349 transitions, 4775 flow [2024-06-03 21:59:22,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 349 transitions, 4540 flow, removed 53 selfloop flow, removed 6 redundant places. [2024-06-03 21:59:22,822 INFO L231 Difference]: Finished difference. Result has 187 places, 316 transitions, 3941 flow [2024-06-03 21:59:22,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3692, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3941, PETRI_PLACES=187, PETRI_TRANSITIONS=316} [2024-06-03 21:59:22,822 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 141 predicate places. [2024-06-03 21:59:22,823 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 316 transitions, 3941 flow [2024-06-03 21:59:22,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:59:22,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:59:22,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:59:22,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 21:59:22,823 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-03 21:59:22,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:59:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1526372922, now seen corresponding path program 3 times [2024-06-03 21:59:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:59:22,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549880158] [2024-06-03 21:59:22,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:59:22,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:59:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:59:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:59:35,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:59:35,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549880158] [2024-06-03 21:59:35,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549880158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:59:35,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:59:35,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:59:35,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853286214] [2024-06-03 21:59:35,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:59:35,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:59:35,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:59:35,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:59:35,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:59:35,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 21:59:35,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 316 transitions, 3941 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-03 21:59:35,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:59:35,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 21:59:35,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:59:38,056 INFO L124 PetriNetUnfolderBase]: 3213/4905 cut-off events. [2024-06-03 21:59:38,057 INFO L125 PetriNetUnfolderBase]: For 402198/402198 co-relation queries the response was YES. [2024-06-03 21:59:38,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43467 conditions, 4905 events. 3213/4905 cut-off events. For 402198/402198 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 25544 event pairs, 861 based on Foata normal form. 4/4905 useless extension candidates. Maximal degree in co-relation 43380. Up to 4227 conditions per place. [2024-06-03 21:59:38,099 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 261 selfloop transitions, 103 changer transitions 0/370 dead transitions. [2024-06-03 21:59:38,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 370 transitions, 5351 flow [2024-06-03 21:59:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:59:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:59:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-03 21:59:38,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42828282828282827 [2024-06-03 21:59:38,102 INFO L175 Difference]: Start difference. First operand has 187 places, 316 transitions, 3941 flow. Second operand 11 states and 212 transitions. [2024-06-03 21:59:38,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 370 transitions, 5351 flow [2024-06-03 21:59:38,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 370 transitions, 5118 flow, removed 39 selfloop flow, removed 8 redundant places. [2024-06-03 21:59:38,382 INFO L231 Difference]: Finished difference. Result has 191 places, 331 transitions, 4152 flow [2024-06-03 21:59:38,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3710, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4152, PETRI_PLACES=191, PETRI_TRANSITIONS=331} [2024-06-03 21:59:38,383 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 145 predicate places. [2024-06-03 21:59:38,383 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 331 transitions, 4152 flow [2024-06-03 21:59:38,383 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-03 21:59:38,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:59:38,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:59:38,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 21:59:38,383 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-03 21:59:38,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:59:38,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1526366412, now seen corresponding path program 4 times [2024-06-03 21:59:38,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:59:38,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620452723] [2024-06-03 21:59:38,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:59:38,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:59:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:59:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:59:50,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:59:50,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620452723] [2024-06-03 21:59:50,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620452723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:59:50,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:59:50,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:59:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995368222] [2024-06-03 21:59:50,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:59:50,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:59:50,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:59:50,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:59:50,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:59:51,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:59:51,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 331 transitions, 4152 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:59:51,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:59:51,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:59:51,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:59:53,689 INFO L124 PetriNetUnfolderBase]: 3225/4919 cut-off events. [2024-06-03 21:59:53,690 INFO L125 PetriNetUnfolderBase]: For 416460/416466 co-relation queries the response was YES. [2024-06-03 21:59:53,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43880 conditions, 4919 events. 3225/4919 cut-off events. For 416460/416466 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 25505 event pairs, 756 based on Foata normal form. 12/4927 useless extension candidates. Maximal degree in co-relation 43791. Up to 4034 conditions per place. [2024-06-03 21:59:53,729 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 220 selfloop transitions, 148 changer transitions 0/374 dead transitions. [2024-06-03 21:59:53,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 374 transitions, 5462 flow [2024-06-03 21:59:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:59:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:59:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions. [2024-06-03 21:59:53,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-03 21:59:53,733 INFO L175 Difference]: Start difference. First operand has 191 places, 331 transitions, 4152 flow. Second operand 10 states and 215 transitions. [2024-06-03 21:59:53,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 374 transitions, 5462 flow [2024-06-03 21:59:54,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 374 transitions, 5236 flow, removed 53 selfloop flow, removed 7 redundant places. [2024-06-03 21:59:54,035 INFO L231 Difference]: Finished difference. Result has 194 places, 334 transitions, 4309 flow [2024-06-03 21:59:54,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3926, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4309, PETRI_PLACES=194, PETRI_TRANSITIONS=334} [2024-06-03 21:59:54,035 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 148 predicate places. [2024-06-03 21:59:54,036 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 334 transitions, 4309 flow [2024-06-03 21:59:54,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:59:54,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:59:54,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:59:54,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 21:59:54,036 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-03 21:59:54,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:59:54,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1526366226, now seen corresponding path program 4 times [2024-06-03 21:59:54,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:59:54,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151129769] [2024-06-03 21:59:54,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:59:54,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:59:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:00:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:00:10,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:00:10,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151129769] [2024-06-03 22:00:10,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151129769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:00:10,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:00:10,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:00:10,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400918334] [2024-06-03 22:00:10,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:00:10,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:00:10,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:00:10,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:00:10,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:00:11,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2024-06-03 22:00:11,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 334 transitions, 4309 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-03 22:00:11,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:00:11,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2024-06-03 22:00:11,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:00:13,751 INFO L124 PetriNetUnfolderBase]: 3220/4912 cut-off events. [2024-06-03 22:00:13,752 INFO L125 PetriNetUnfolderBase]: For 422869/422875 co-relation queries the response was YES. [2024-06-03 22:00:13,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44374 conditions, 4912 events. 3220/4912 cut-off events. For 422869/422875 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 25484 event pairs, 804 based on Foata normal form. 6/4914 useless extension candidates. Maximal degree in co-relation 44283. Up to 4345 conditions per place. [2024-06-03 22:00:13,799 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 236 selfloop transitions, 124 changer transitions 0/366 dead transitions. [2024-06-03 22:00:13,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 366 transitions, 5153 flow [2024-06-03 22:00:13,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:00:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:00:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-03 22:00:13,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4288888888888889 [2024-06-03 22:00:13,802 INFO L175 Difference]: Start difference. First operand has 194 places, 334 transitions, 4309 flow. Second operand 10 states and 193 transitions. [2024-06-03 22:00:13,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 366 transitions, 5153 flow [2024-06-03 22:00:14,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 366 transitions, 4735 flow, removed 59 selfloop flow, removed 8 redundant places. [2024-06-03 22:00:14,215 INFO L231 Difference]: Finished difference. Result has 196 places, 334 transitions, 4149 flow [2024-06-03 22:00:14,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3891, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4149, PETRI_PLACES=196, PETRI_TRANSITIONS=334} [2024-06-03 22:00:14,215 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 150 predicate places. [2024-06-03 22:00:14,216 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 334 transitions, 4149 flow [2024-06-03 22:00:14,216 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-03 22:00:14,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:00:14,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:00:14,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:00:14,216 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:00:14,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:00:14,217 INFO L85 PathProgramCache]: Analyzing trace with hash 315192671, now seen corresponding path program 1 times [2024-06-03 22:00:14,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:00:14,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979282743] [2024-06-03 22:00:14,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:00:14,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:00:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15