./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.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/mix033.opt.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/mix033.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix033.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --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:24,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 21:46:24,764 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:24,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 21:46:24,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 21:46:24,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 21:46:24,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 21:46:24,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 21:46:24,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 21:46:24,801 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 21:46:24,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 21:46:24,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 21:46:24,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 21:46:24,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 21:46:24,804 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 21:46:24,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 21:46:24,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 21:46:24,804 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 21:46:24,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 21:46:24,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 21:46:24,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 21:46:24,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 21:46:24,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 21:46:24,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 21:46:24,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 21:46:24,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 21:46:24,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 21:46:24,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 21:46:24,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 21:46:24,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 21:46:24,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 21:46:24,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 21:46:24,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:46:24,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 21:46:24,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 21:46:24,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 21:46:24,810 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 21:46:24,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 21:46:24,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 21:46:24,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 21:46:24,811 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 21:46:24,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 21:46:24,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 21:46:24,812 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:25,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 21:46:25,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 21:46:25,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 21:46:25,118 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 21:46:25,119 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 21:46:25,120 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/mix033.opt.yml/witness.yml [2024-06-03 21:46:25,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 21:46:25,380 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 21:46:25,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2024-06-03 21:46:26,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 21:46:26,828 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 21:46:26,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2024-06-03 21:46:26,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe899fc93/0b9445f64d78433a9e9a29ccde3edcf2/FLAGf78e9fc3d [2024-06-03 21:46:26,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe899fc93/0b9445f64d78433a9e9a29ccde3edcf2 [2024-06-03 21:46:26,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 21:46:26,855 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 21:46:26,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 21:46:26,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 21:46:26,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 21:46:26,862 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:25" (1/2) ... [2024-06-03 21:46:26,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce94775 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:26, skipping insertion in model container [2024-06-03 21:46:26,863 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:25" (1/2) ... [2024-06-03 21:46:26,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@78a71cce and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:26, skipping insertion in model container [2024-06-03 21:46:26,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:46:26" (2/2) ... [2024-06-03 21:46:26,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce94775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:26, skipping insertion in model container [2024-06-03 21:46:26,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:46:26" (2/2) ... [2024-06-03 21:46:26,865 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 21:46:26,971 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 21:46:26,972 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] ((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 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 )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 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 )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_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)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0) [2024-06-03 21:46:26,973 INFO L97 edCorrectnessWitness]: Location invariant before [L846-L846] ((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 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 )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 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 )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_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)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0) [2024-06-03 21:46:26,974 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] ((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 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 )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 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 )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_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)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0) [2024-06-03 21:46:26,975 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 21:46:26,975 INFO L106 edCorrectnessWitness]: ghost_update [L844-L844] multithreaded = 1; [2024-06-03 21:46:27,019 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 21:46:27,355 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:46:27,372 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:27,818 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:46:27,862 INFO L206 MainTranslator]: Completed translation [2024-06-03 21:46:27,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27 WrapperNode [2024-06-03 21:46:27,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 21:46:27,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 21:46:27,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 21:46:27,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 21:46:27,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (1/1) ... [2024-06-03 21:46:27,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (1/1) ... [2024-06-03 21:46:28,151 INFO L138 Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2024-06-03 21:46:28,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 21:46:28,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 21:46:28,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 21:46:28,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 21:46:28,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (1/1) ... [2024-06-03 21:46:28,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (1/1) ... [2024-06-03 21:46:28,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (1/1) ... [2024-06-03 21:46:28,261 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:28,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (1/1) ... [2024-06-03 21:46:28,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (1/1) ... [2024-06-03 21:46:28,345 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (1/1) ... [2024-06-03 21:46:28,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (1/1) ... [2024-06-03 21:46:28,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (1/1) ... [2024-06-03 21:46:28,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (1/1) ... [2024-06-03 21:46:28,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 21:46:28,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 21:46:28,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 21:46:28,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 21:46:28,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (1/1) ... [2024-06-03 21:46:28,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:46:28,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:46:28,468 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:28,476 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:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 21:46:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 21:46:28,511 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 21:46:28,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 21:46:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 21:46:28,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 21:46:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 21:46:28,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 21:46:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 21:46:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 21:46:28,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 21:46:28,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 21:46:28,515 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:28,664 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 21:46:28,666 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 21:46:30,463 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 21:46:30,465 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 21:46:30,866 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 21:46:30,867 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 21:46:30,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:46:30 BoogieIcfgContainer [2024-06-03 21:46:30,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 21:46:30,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 21:46:30,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 21:46:30,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 21:46:30,874 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:25" (1/4) ... [2024-06-03 21:46:30,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef84e7d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:46:30, skipping insertion in model container [2024-06-03 21:46:30,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:46:26" (2/4) ... [2024-06-03 21:46:30,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef84e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:46:30, skipping insertion in model container [2024-06-03 21:46:30,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:27" (3/4) ... [2024-06-03 21:46:30,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef84e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:46:30, skipping insertion in model container [2024-06-03 21:46:30,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:46:30" (4/4) ... [2024-06-03 21:46:30,877 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2024-06-03 21:46:30,892 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 21:46:30,893 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 21:46:30,893 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 21:46:31,060 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 21:46:31,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 102 flow [2024-06-03 21:46:31,175 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2024-06-03 21:46:31,175 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:46:31,178 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 73 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:31,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 45 transitions, 102 flow [2024-06-03 21:46:31,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 81 flow [2024-06-03 21:46:31,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 21:46:31,204 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;@40a58adc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 21:46:31,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 21:46:31,216 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 21:46:31,216 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 21:46:31,217 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:46:31,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:31,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 21:46:31,218 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:31,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1462142692, now seen corresponding path program 1 times [2024-06-03 21:46:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:31,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986654967] [2024-06-03 21:46:31,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:31,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:42,481 INFO 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:42,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:42,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986654967] [2024-06-03 21:46:42,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986654967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:42,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:42,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 21:46:42,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506161490] [2024-06-03 21:46:42,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:42,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 21:46:42,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:42,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 21:46:42,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 21:46:42,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2024-06-03 21:46:42,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:42,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:42,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2024-06-03 21:46:42,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:46:44,451 INFO L124 PetriNetUnfolderBase]: 1359/2190 cut-off events. [2024-06-03 21:46:44,451 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-03 21:46:44,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4306 conditions, 2190 events. 1359/2190 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11459 event pairs, 941 based on Foata normal form. 1/2096 useless extension candidates. Maximal degree in co-relation 4291. Up to 2029 conditions per place. [2024-06-03 21:46:44,470 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 34 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-06-03 21:46:44,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 183 flow [2024-06-03 21:46:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 21:46:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 21:46:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-06-03 21:46:44,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148 [2024-06-03 21:46:44,483 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 81 flow. Second operand 3 states and 83 transitions. [2024-06-03 21:46:44,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 183 flow [2024-06-03 21:46:44,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 21:46:44,488 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 108 flow [2024-06-03 21:46:44,490 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:44,493 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-06-03 21:46:44,494 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 108 flow [2024-06-03 21:46:44,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:44,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:44,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:46:44,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 21:46:44,495 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:44,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash -664792325, now seen corresponding path program 1 times [2024-06-03 21:46:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:44,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273580059] [2024-06-03 21:46:44,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:44,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:46:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:46:52,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:46:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273580059] [2024-06-03 21:46:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273580059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:46:52,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:46:52,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 21:46:52,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889213859] [2024-06-03 21:46:52,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:46:52,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 21:46:52,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:46:52,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 21:46:52,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 21:46:52,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-03 21:46:52,438 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:52,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:46:52,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-03 21:46:52,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:46:54,090 INFO L124 PetriNetUnfolderBase]: 1560/2438 cut-off events. [2024-06-03 21:46:54,090 INFO L125 PetriNetUnfolderBase]: For 455/455 co-relation queries the response was YES. [2024-06-03 21:46:54,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5456 conditions, 2438 events. 1560/2438 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12543 event pairs, 930 based on Foata normal form. 3/2403 useless extension candidates. Maximal degree in co-relation 5441. Up to 2302 conditions per place. [2024-06-03 21:46:54,106 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 42 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-03 21:46:54,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 252 flow [2024-06-03 21:46:54,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 21:46:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 21:46:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-06-03 21:46:54,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-06-03 21:46:54,109 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:54,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 252 flow [2024-06-03 21:46:54,110 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:54,111 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 144 flow [2024-06-03 21:46:54,112 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:54,112 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2024-06-03 21:46:54,113 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 144 flow [2024-06-03 21:46:54,113 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:54,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:46:54,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:46:54,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 21:46:54,114 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:54,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:46:54,114 INFO L85 PathProgramCache]: Analyzing trace with hash 866275369, now seen corresponding path program 1 times [2024-06-03 21:46:54,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:46:54,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355115149] [2024-06-03 21:46:54,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:46:54,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:46:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:00,822 INFO 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:00,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:00,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355115149] [2024-06-03 21:47:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355115149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:00,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:00,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 21:47:00,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825422915] [2024-06-03 21:47:00,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:00,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 21:47:00,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:00,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 21:47:00,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 21:47:00,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-03 21:47:00,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:00,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:00,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-03 21:47:00,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:02,559 INFO L124 PetriNetUnfolderBase]: 1568/2498 cut-off events. [2024-06-03 21:47:02,559 INFO L125 PetriNetUnfolderBase]: For 1343/1343 co-relation queries the response was YES. [2024-06-03 21:47:02,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6133 conditions, 2498 events. 1568/2498 cut-off events. For 1343/1343 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13164 event pairs, 669 based on Foata normal form. 5/2482 useless extension candidates. Maximal degree in co-relation 6116. Up to 2248 conditions per place. [2024-06-03 21:47:02,574 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 55 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2024-06-03 21:47:02,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 78 transitions, 406 flow [2024-06-03 21:47:02,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:47:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:47:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-06-03 21:47:02,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-03 21:47:02,578 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 144 flow. Second operand 5 states and 135 transitions. [2024-06-03 21:47:02,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 78 transitions, 406 flow [2024-06-03 21:47:02,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 392 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-03 21:47:02,582 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 243 flow [2024-06-03 21:47:02,582 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2024-06-03 21:47:02,583 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2024-06-03 21:47:02,583 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 243 flow [2024-06-03 21:47:02,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:02,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:02,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:02,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 21:47:02,584 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:47:02,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash -732993944, now seen corresponding path program 1 times [2024-06-03 21:47:02,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:02,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43078777] [2024-06-03 21:47:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:02,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:08,537 INFO 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:08,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:08,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43078777] [2024-06-03 21:47:08,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43078777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:08,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:47:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578936127] [2024-06-03 21:47:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:08,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:47:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:08,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:47:08,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:47:08,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-03 21:47:08,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:08,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:08,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-03 21:47:08,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:10,498 INFO L124 PetriNetUnfolderBase]: 1580/2518 cut-off events. [2024-06-03 21:47:10,499 INFO L125 PetriNetUnfolderBase]: For 3183/3186 co-relation queries the response was YES. [2024-06-03 21:47:10,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7277 conditions, 2518 events. 1580/2518 cut-off events. For 3183/3186 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13269 event pairs, 481 based on Foata normal form. 12/2509 useless extension candidates. Maximal degree in co-relation 7257. Up to 2216 conditions per place. [2024-06-03 21:47:10,517 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 59 selfloop transitions, 19 changer transitions 0/85 dead transitions. [2024-06-03 21:47:10,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 509 flow [2024-06-03 21:47:10,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:47:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:47:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-06-03 21:47:10,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-06-03 21:47:10,523 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 243 flow. Second operand 6 states and 155 transitions. [2024-06-03 21:47:10,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 509 flow [2024-06-03 21:47:10,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 501 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-03 21:47:10,532 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 299 flow [2024-06-03 21:47:10,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2024-06-03 21:47:10,534 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2024-06-03 21:47:10,534 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 299 flow [2024-06-03 21:47:10,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:47:10,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:10,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:10,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 21:47:10,535 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:10,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1199250010, now seen corresponding path program 1 times [2024-06-03 21:47:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:10,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574671049] [2024-06-03 21:47:10,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:10,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:24,005 INFO 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:24,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:24,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574671049] [2024-06-03 21:47:24,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574671049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:24,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:24,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:47:24,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730446871] [2024-06-03 21:47:24,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:24,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:47:24,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:24,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:47:24,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:47:24,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-03 21:47:24,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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:24,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:24,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-03 21:47:24,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:25,509 INFO L124 PetriNetUnfolderBase]: 1368/2247 cut-off events. [2024-06-03 21:47:25,509 INFO L125 PetriNetUnfolderBase]: For 4097/4097 co-relation queries the response was YES. [2024-06-03 21:47:25,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7019 conditions, 2247 events. 1368/2247 cut-off events. For 4097/4097 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12074 event pairs, 562 based on Foata normal form. 2/2211 useless extension candidates. Maximal degree in co-relation 6996. Up to 2036 conditions per place. [2024-06-03 21:47:25,522 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 50 selfloop transitions, 8 changer transitions 0/66 dead transitions. [2024-06-03 21:47:25,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 443 flow [2024-06-03 21:47:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:47:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:47:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-06-03 21:47:25,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2024-06-03 21:47:25,524 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 299 flow. Second operand 5 states and 111 transitions. [2024-06-03 21:47:25,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 443 flow [2024-06-03 21:47:25,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 393 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 21:47:25,529 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 273 flow [2024-06-03 21:47:25,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-06-03 21:47:25,530 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2024-06-03 21:47:25,530 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 273 flow [2024-06-03 21:47:25,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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:25,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:25,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:25,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 21:47:25,531 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:25,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1447483434, now seen corresponding path program 1 times [2024-06-03 21:47:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:25,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320391689] [2024-06-03 21:47:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:25,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:40,554 INFO 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:40,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:40,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320391689] [2024-06-03 21:47:40,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320391689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:40,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:40,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:47:40,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83861218] [2024-06-03 21:47:40,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:40,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:47:40,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:40,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:47:40,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:47:40,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:47:40,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:40,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:40,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:47:40,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:42,171 INFO L124 PetriNetUnfolderBase]: 1606/2616 cut-off events. [2024-06-03 21:47:42,172 INFO L125 PetriNetUnfolderBase]: For 5550/5550 co-relation queries the response was YES. [2024-06-03 21:47:42,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8117 conditions, 2616 events. 1606/2616 cut-off events. For 5550/5550 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13993 event pairs, 676 based on Foata normal form. 2/2592 useless extension candidates. Maximal degree in co-relation 8092. Up to 2373 conditions per place. [2024-06-03 21:47:42,216 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 55 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2024-06-03 21:47:42,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 461 flow [2024-06-03 21:47:42,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:47:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:47:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-03 21:47:42,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-03 21:47:42,218 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 273 flow. Second operand 6 states and 126 transitions. [2024-06-03 21:47:42,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 461 flow [2024-06-03 21:47:42,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 439 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 21:47:42,223 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 305 flow [2024-06-03 21:47:42,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2024-06-03 21:47:42,224 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2024-06-03 21:47:42,224 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 305 flow [2024-06-03 21:47:42,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:42,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:42,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:42,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 21:47:42,225 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:42,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1916593059, now seen corresponding path program 1 times [2024-06-03 21:47:42,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:42,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342417344] [2024-06-03 21:47:42,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:42,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:47:56,827 INFO 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:56,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:47:56,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342417344] [2024-06-03 21:47:56,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342417344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:47:56,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:47:56,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:47:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515332096] [2024-06-03 21:47:56,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:47:56,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:47:56,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:47:56,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:47:56,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:47:56,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:47:56,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:57,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:47:57,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:47:57,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:47:58,641 INFO L124 PetriNetUnfolderBase]: 1746/2778 cut-off events. [2024-06-03 21:47:58,641 INFO L125 PetriNetUnfolderBase]: For 8538/8544 co-relation queries the response was YES. [2024-06-03 21:47:58,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9398 conditions, 2778 events. 1746/2778 cut-off events. For 8538/8544 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14653 event pairs, 726 based on Foata normal form. 8/2770 useless extension candidates. Maximal degree in co-relation 9373. Up to 2505 conditions per place. [2024-06-03 21:47:58,658 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 54 selfloop transitions, 19 changer transitions 0/81 dead transitions. [2024-06-03 21:47:58,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 547 flow [2024-06-03 21:47:58,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:47:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:47:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-06-03 21:47:58,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-03 21:47:58,660 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 305 flow. Second operand 6 states and 135 transitions. [2024-06-03 21:47:58,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 547 flow [2024-06-03 21:47:58,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 517 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 21:47:58,665 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 347 flow [2024-06-03 21:47:58,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-06-03 21:47:58,666 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2024-06-03 21:47:58,666 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 347 flow [2024-06-03 21:47:58,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:58,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:47:58,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:47:58,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 21:47:58,667 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:58,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:47:58,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1427987707, now seen corresponding path program 2 times [2024-06-03 21:47:58,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:47:58,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577028537] [2024-06-03 21:47:58,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:47:58,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:47:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:48:12,359 INFO 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:12,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:48:12,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577028537] [2024-06-03 21:48:12,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577028537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:48:12,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:48:12,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:48:12,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595647305] [2024-06-03 21:48:12,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:48:12,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:48:12,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:48:12,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:48:12,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:48:12,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:48:12,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 347 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:12,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:48:12,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:48:12,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:48:14,107 INFO L124 PetriNetUnfolderBase]: 1734/2751 cut-off events. [2024-06-03 21:48:14,107 INFO L125 PetriNetUnfolderBase]: For 10319/10325 co-relation queries the response was YES. [2024-06-03 21:48:14,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9634 conditions, 2751 events. 1734/2751 cut-off events. For 10319/10325 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14473 event pairs, 740 based on Foata normal form. 3/2733 useless extension candidates. Maximal degree in co-relation 9608. Up to 2489 conditions per place. [2024-06-03 21:48:14,121 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 48 selfloop transitions, 20 changer transitions 0/76 dead transitions. [2024-06-03 21:48:14,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 521 flow [2024-06-03 21:48:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:48:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:48:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-06-03 21:48:14,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48518518518518516 [2024-06-03 21:48:14,124 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 347 flow. Second operand 6 states and 131 transitions. [2024-06-03 21:48:14,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 521 flow [2024-06-03 21:48:14,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 76 transitions, 492 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 21:48:14,131 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 366 flow [2024-06-03 21:48:14,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-06-03 21:48:14,132 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2024-06-03 21:48:14,132 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 366 flow [2024-06-03 21:48:14,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:14,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:48:14,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:48:14,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 21:48:14,133 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:14,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:48:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1922314915, now seen corresponding path program 1 times [2024-06-03 21:48:14,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:48:14,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846995530] [2024-06-03 21:48:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:48:14,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:48:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:48:29,741 INFO 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,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:48:29,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846995530] [2024-06-03 21:48:29,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846995530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:48:29,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:48:29,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:48:29,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235017048] [2024-06-03 21:48:29,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:48:29,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:48:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:48:29,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:48:29,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:48:30,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:48:30,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 366 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:30,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:48:30,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:48:30,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:48:31,565 INFO L124 PetriNetUnfolderBase]: 1590/2611 cut-off events. [2024-06-03 21:48:31,565 INFO L125 PetriNetUnfolderBase]: For 10273/10273 co-relation queries the response was YES. [2024-06-03 21:48:31,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9114 conditions, 2611 events. 1590/2611 cut-off events. For 10273/10273 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14033 event pairs, 634 based on Foata normal form. 4/2601 useless extension candidates. Maximal degree in co-relation 9087. Up to 2330 conditions per place. [2024-06-03 21:48:31,578 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 63 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2024-06-03 21:48:31,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 592 flow [2024-06-03 21:48:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:48:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:48:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-06-03 21:48:31,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-03 21:48:31,580 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 366 flow. Second operand 7 states and 146 transitions. [2024-06-03 21:48:31,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 592 flow [2024-06-03 21:48:31,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 527 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 21:48:31,594 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 365 flow [2024-06-03 21:48:31,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=61, 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=365, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2024-06-03 21:48:31,595 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2024-06-03 21:48:31,595 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 365 flow [2024-06-03 21:48:31,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:48:31,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:48:31,596 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,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 21:48:31,596 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,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:48:31,597 INFO L85 PathProgramCache]: Analyzing trace with hash -715155925, now seen corresponding path program 1 times [2024-06-03 21:48:31,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:48:31,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321022113] [2024-06-03 21:48:31,602 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,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:48:46,838 INFO 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:46,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:48:46,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321022113] [2024-06-03 21:48:46,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321022113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:48:46,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:48:46,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:48:46,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721993888] [2024-06-03 21:48:46,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:48:46,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:48:46,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:48:46,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:48:46,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:48:47,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:48:47,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 365 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:47,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:48:47,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:48:47,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:48:48,703 INFO L124 PetriNetUnfolderBase]: 1856/2900 cut-off events. [2024-06-03 21:48:48,703 INFO L125 PetriNetUnfolderBase]: For 14773/14779 co-relation queries the response was YES. [2024-06-03 21:48:48,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10882 conditions, 2900 events. 1856/2900 cut-off events. For 14773/14779 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14909 event pairs, 731 based on Foata normal form. 5/2888 useless extension candidates. Maximal degree in co-relation 10854. Up to 2601 conditions per place. [2024-06-03 21:48:48,718 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 64 selfloop transitions, 26 changer transitions 0/96 dead transitions. [2024-06-03 21:48:48,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 96 transitions, 697 flow [2024-06-03 21:48:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:48:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:48:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2024-06-03 21:48:48,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793650793650794 [2024-06-03 21:48:48,720 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 365 flow. Second operand 7 states and 151 transitions. [2024-06-03 21:48:48,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 96 transitions, 697 flow [2024-06-03 21:48:48,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 657 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-03 21:48:48,729 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 444 flow [2024-06-03 21:48:48,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=444, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2024-06-03 21:48:48,732 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2024-06-03 21:48:48,732 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 444 flow [2024-06-03 21:48:48,732 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,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:48:48,733 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,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 21:48:48,733 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,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:48:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1317707417, now seen corresponding path program 2 times [2024-06-03 21:48:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:48:48,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898011566] [2024-06-03 21:48:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:48:48,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:48:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:04,402 INFO 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:04,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:04,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898011566] [2024-06-03 21:49:04,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898011566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:04,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:04,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:49:04,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791293438] [2024-06-03 21:49:04,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:04,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:49:04,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:04,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:49:04,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:49:04,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:49:04,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 444 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:04,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:04,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:49:04,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:06,390 INFO L124 PetriNetUnfolderBase]: 1867/2908 cut-off events. [2024-06-03 21:49:06,390 INFO L125 PetriNetUnfolderBase]: For 18390/18396 co-relation queries the response was YES. [2024-06-03 21:49:06,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11747 conditions, 2908 events. 1867/2908 cut-off events. For 18390/18396 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14909 event pairs, 745 based on Foata normal form. 3/2887 useless extension candidates. Maximal degree in co-relation 11718. Up to 2608 conditions per place. [2024-06-03 21:49:06,408 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 60 selfloop transitions, 34 changer transitions 0/100 dead transitions. [2024-06-03 21:49:06,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 100 transitions, 828 flow [2024-06-03 21:49:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:49:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:49:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2024-06-03 21:49:06,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793650793650794 [2024-06-03 21:49:06,410 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 444 flow. Second operand 7 states and 151 transitions. [2024-06-03 21:49:06,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 100 transitions, 828 flow [2024-06-03 21:49:06,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 792 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-03 21:49:06,421 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 546 flow [2024-06-03 21:49:06,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2024-06-03 21:49:06,422 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2024-06-03 21:49:06,422 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 546 flow [2024-06-03 21:49:06,423 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:06,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:06,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:06,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 21:49:06,423 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:06,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash -538024405, now seen corresponding path program 3 times [2024-06-03 21:49:06,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:06,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987153006] [2024-06-03 21:49:06,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:06,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:21,961 INFO 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:21,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987153006] [2024-06-03 21:49:21,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987153006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:21,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:21,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:49:21,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928376359] [2024-06-03 21:49:21,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:21,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:49:21,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:21,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:49:21,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:49:22,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:49:22,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 546 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:22,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:22,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:49:22,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:23,869 INFO L124 PetriNetUnfolderBase]: 1862/2901 cut-off events. [2024-06-03 21:49:23,869 INFO L125 PetriNetUnfolderBase]: For 21732/21738 co-relation queries the response was YES. [2024-06-03 21:49:23,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12217 conditions, 2901 events. 1862/2901 cut-off events. For 21732/21738 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14889 event pairs, 745 based on Foata normal form. 3/2880 useless extension candidates. Maximal degree in co-relation 12186. Up to 2605 conditions per place. [2024-06-03 21:49:23,883 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 59 selfloop transitions, 33 changer transitions 0/98 dead transitions. [2024-06-03 21:49:23,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 98 transitions, 826 flow [2024-06-03 21:49:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:49:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:49:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-06-03 21:49:23,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473015873015873 [2024-06-03 21:49:23,885 INFO L175 Difference]: Start difference. First operand has 74 places, 77 transitions, 546 flow. Second operand 7 states and 149 transitions. [2024-06-03 21:49:23,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 98 transitions, 826 flow [2024-06-03 21:49:23,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 98 transitions, 764 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-03 21:49:23,899 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 558 flow [2024-06-03 21:49:23,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=558, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2024-06-03 21:49:23,900 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 32 predicate places. [2024-06-03 21:49:23,900 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 558 flow [2024-06-03 21:49:23,901 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:23,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:23,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:23,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 21:49:23,901 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:49:23,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:23,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1407223686, now seen corresponding path program 1 times [2024-06-03 21:49:23,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:23,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305303772] [2024-06-03 21:49:23,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:23,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:39,052 INFO 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:39,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:39,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305303772] [2024-06-03 21:49:39,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305303772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:39,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:39,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:49:39,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327859854] [2024-06-03 21:49:39,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:39,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:49:39,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:39,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:49:39,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:49:39,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-03 21:49:39,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 558 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:39,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:39,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-03 21:49:39,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:40,399 INFO L124 PetriNetUnfolderBase]: 1534/2566 cut-off events. [2024-06-03 21:49:40,399 INFO L125 PetriNetUnfolderBase]: For 20486/20486 co-relation queries the response was YES. [2024-06-03 21:49:40,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10648 conditions, 2566 events. 1534/2566 cut-off events. For 20486/20486 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14034 event pairs, 581 based on Foata normal form. 1/2551 useless extension candidates. Maximal degree in co-relation 10615. Up to 2252 conditions per place. [2024-06-03 21:49:40,412 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 67 selfloop transitions, 8 changer transitions 0/88 dead transitions. [2024-06-03 21:49:40,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 88 transitions, 750 flow [2024-06-03 21:49:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:49:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:49:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-03 21:49:40,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47555555555555556 [2024-06-03 21:49:40,413 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 558 flow. Second operand 5 states and 107 transitions. [2024-06-03 21:49:40,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 88 transitions, 750 flow [2024-06-03 21:49:40,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 88 transitions, 669 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 21:49:40,422 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 527 flow [2024-06-03 21:49:40,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=527, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2024-06-03 21:49:40,423 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places. [2024-06-03 21:49:40,423 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 527 flow [2024-06-03 21:49:40,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:40,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:40,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:40,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 21:49:40,424 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:40,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash 176936383, now seen corresponding path program 1 times [2024-06-03 21:49:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:40,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351182497] [2024-06-03 21:49:40,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:40,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:49:55,058 INFO 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:55,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:49:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351182497] [2024-06-03 21:49:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351182497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:49:55,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:49:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:49:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185152250] [2024-06-03 21:49:55,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:49:55,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:49:55,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:49:55,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:49:55,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:49:55,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:49:55,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 527 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:55,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:49:55,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:49:55,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:49:56,941 INFO L124 PetriNetUnfolderBase]: 1886/2949 cut-off events. [2024-06-03 21:49:56,941 INFO L125 PetriNetUnfolderBase]: For 27374/27377 co-relation queries the response was YES. [2024-06-03 21:49:56,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12983 conditions, 2949 events. 1886/2949 cut-off events. For 27374/27377 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15172 event pairs, 730 based on Foata normal form. 2/2947 useless extension candidates. Maximal degree in co-relation 12949. Up to 2630 conditions per place. [2024-06-03 21:49:56,955 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 70 selfloop transitions, 36 changer transitions 0/112 dead transitions. [2024-06-03 21:49:56,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 112 transitions, 971 flow [2024-06-03 21:49:56,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:49:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:49:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-03 21:49:56,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-03 21:49:56,956 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 527 flow. Second operand 7 states and 152 transitions. [2024-06-03 21:49:56,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 112 transitions, 971 flow [2024-06-03 21:49:56,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 943 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-03 21:49:56,975 INFO L231 Difference]: Finished difference. Result has 81 places, 86 transitions, 648 flow [2024-06-03 21:49:56,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=648, PETRI_PLACES=81, PETRI_TRANSITIONS=86} [2024-06-03 21:49:56,976 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2024-06-03 21:49:56,976 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 86 transitions, 648 flow [2024-06-03 21:49:56,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:49:56,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:49:56,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:49:56,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 21:49:56,977 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,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:49:56,978 INFO L85 PathProgramCache]: Analyzing trace with hash 484567524, now seen corresponding path program 1 times [2024-06-03 21:49:56,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:49:56,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888896976] [2024-06-03 21:49:56,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:49:56,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:49:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:50:07,042 INFO 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:07,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:50:07,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888896976] [2024-06-03 21:50:07,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888896976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:50:07,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:50:07,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:50:07,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593254814] [2024-06-03 21:50:07,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:50:07,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:50:07,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:50:07,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:50:07,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:50:07,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:50:07,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 86 transitions, 648 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:07,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:50:07,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:50:07,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:50:09,319 INFO L124 PetriNetUnfolderBase]: 2100/3287 cut-off events. [2024-06-03 21:50:09,319 INFO L125 PetriNetUnfolderBase]: For 33546/33549 co-relation queries the response was YES. [2024-06-03 21:50:09,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14989 conditions, 3287 events. 2100/3287 cut-off events. For 33546/33549 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 17079 event pairs, 686 based on Foata normal form. 8/3285 useless extension candidates. Maximal degree in co-relation 14954. Up to 2631 conditions per place. [2024-06-03 21:50:09,333 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 91 selfloop transitions, 56 changer transitions 0/153 dead transitions. [2024-06-03 21:50:09,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 153 transitions, 1472 flow [2024-06-03 21:50:09,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:50:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:50:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2024-06-03 21:50:09,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47160493827160493 [2024-06-03 21:50:09,336 INFO L175 Difference]: Start difference. First operand has 81 places, 86 transitions, 648 flow. Second operand 9 states and 191 transitions. [2024-06-03 21:50:09,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 153 transitions, 1472 flow [2024-06-03 21:50:09,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 153 transitions, 1379 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-03 21:50:09,367 INFO L231 Difference]: Finished difference. Result has 92 places, 116 transitions, 1058 flow [2024-06-03 21:50:09,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1058, PETRI_PLACES=92, PETRI_TRANSITIONS=116} [2024-06-03 21:50:09,369 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2024-06-03 21:50:09,369 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 116 transitions, 1058 flow [2024-06-03 21:50:09,369 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:09,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:50:09,369 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:09,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 21:50:09,370 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:50:09,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:50:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1944440732, now seen corresponding path program 2 times [2024-06-03 21:50:09,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:50:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116083137] [2024-06-03 21:50:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:50:09,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:50:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:50:24,359 INFO 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:24,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:50:24,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116083137] [2024-06-03 21:50:24,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116083137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:50:24,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:50:24,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:50:24,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926572430] [2024-06-03 21:50:24,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:50:24,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:50:24,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:50:24,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:50:24,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:50:24,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:50:24,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 116 transitions, 1058 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:24,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:50:24,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:50:24,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:50:26,698 INFO L124 PetriNetUnfolderBase]: 2333/3628 cut-off events. [2024-06-03 21:50:26,698 INFO L125 PetriNetUnfolderBase]: For 42657/42662 co-relation queries the response was YES. [2024-06-03 21:50:26,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18176 conditions, 3628 events. 2333/3628 cut-off events. For 42657/42662 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 18847 event pairs, 529 based on Foata normal form. 10/3634 useless extension candidates. Maximal degree in co-relation 18135. Up to 2779 conditions per place. [2024-06-03 21:50:26,719 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 109 selfloop transitions, 97 changer transitions 0/212 dead transitions. [2024-06-03 21:50:26,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 212 transitions, 2329 flow [2024-06-03 21:50:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:50:26,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:50:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2024-06-03 21:50:26,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2024-06-03 21:50:26,721 INFO L175 Difference]: Start difference. First operand has 92 places, 116 transitions, 1058 flow. Second operand 9 states and 201 transitions. [2024-06-03 21:50:26,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 212 transitions, 2329 flow [2024-06-03 21:50:26,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 212 transitions, 2249 flow, removed 39 selfloop flow, removed 1 redundant places. [2024-06-03 21:50:26,751 INFO L231 Difference]: Finished difference. Result has 104 places, 158 transitions, 1796 flow [2024-06-03 21:50:26,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1796, PETRI_PLACES=104, PETRI_TRANSITIONS=158} [2024-06-03 21:50:26,751 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 58 predicate places. [2024-06-03 21:50:26,752 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 158 transitions, 1796 flow [2024-06-03 21:50:26,753 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:26,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:50:26,753 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:26,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 21:50:26,754 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:26,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:50:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash 484561727, now seen corresponding path program 2 times [2024-06-03 21:50:26,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:50:26,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835119780] [2024-06-03 21:50:26,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:50:26,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:50:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:50:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:50:37,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:50:37,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835119780] [2024-06-03 21:50:37,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835119780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:50:37,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:50:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:50:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37625873] [2024-06-03 21:50:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:50:37,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:50:37,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:50:37,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:50:37,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:50:37,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:50:37,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 158 transitions, 1796 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:37,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:50:37,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:50:37,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:50:39,846 INFO L124 PetriNetUnfolderBase]: 2325/3636 cut-off events. [2024-06-03 21:50:39,846 INFO L125 PetriNetUnfolderBase]: For 48098/48105 co-relation queries the response was YES. [2024-06-03 21:50:39,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19337 conditions, 3636 events. 2325/3636 cut-off events. For 48098/48105 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18998 event pairs, 655 based on Foata normal form. 7/3633 useless extension candidates. Maximal degree in co-relation 19289. Up to 3100 conditions per place. [2024-06-03 21:50:39,864 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 101 selfloop transitions, 80 changer transitions 0/187 dead transitions. [2024-06-03 21:50:39,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 187 transitions, 2394 flow [2024-06-03 21:50:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:50:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:50:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2024-06-03 21:50:39,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-03 21:50:39,865 INFO L175 Difference]: Start difference. First operand has 104 places, 158 transitions, 1796 flow. Second operand 8 states and 168 transitions. [2024-06-03 21:50:39,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 187 transitions, 2394 flow [2024-06-03 21:50:39,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 187 transitions, 2243 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-03 21:50:39,902 INFO L231 Difference]: Finished difference. Result has 109 places, 162 transitions, 1911 flow [2024-06-03 21:50:39,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1911, PETRI_PLACES=109, PETRI_TRANSITIONS=162} [2024-06-03 21:50:39,902 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 63 predicate places. [2024-06-03 21:50:39,903 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 162 transitions, 1911 flow [2024-06-03 21:50:39,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:50:39,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:50:39,903 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:39,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 21:50:39,903 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:39,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:50:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1453320672, now seen corresponding path program 3 times [2024-06-03 21:50:39,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:50:39,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604840151] [2024-06-03 21:50:39,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:50:39,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:50:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:50:55,705 INFO 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:55,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:50:55,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604840151] [2024-06-03 21:50:55,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604840151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:50:55,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:50:55,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:50:55,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928938181] [2024-06-03 21:50:55,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:50:55,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:50:55,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:50:55,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:50:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:50:55,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:50:55,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 162 transitions, 1911 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:55,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:50:55,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:50:55,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:50:58,028 INFO L124 PetriNetUnfolderBase]: 2413/3740 cut-off events. [2024-06-03 21:50:58,028 INFO L125 PetriNetUnfolderBase]: For 55847/55849 co-relation queries the response was YES. [2024-06-03 21:50:58,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20511 conditions, 3740 events. 2413/3740 cut-off events. For 55847/55849 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19363 event pairs, 543 based on Foata normal form. 6/3715 useless extension candidates. Maximal degree in co-relation 20460. Up to 2813 conditions per place. [2024-06-03 21:50:58,052 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 87 selfloop transitions, 118 changer transitions 0/211 dead transitions. [2024-06-03 21:50:58,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 211 transitions, 2837 flow [2024-06-03 21:50:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:50:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:50:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-03 21:50:58,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-06-03 21:50:58,054 INFO L175 Difference]: Start difference. First operand has 109 places, 162 transitions, 1911 flow. Second operand 8 states and 178 transitions. [2024-06-03 21:50:58,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 211 transitions, 2837 flow [2024-06-03 21:50:58,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 211 transitions, 2746 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-03 21:50:58,097 INFO L231 Difference]: Finished difference. Result has 114 places, 177 transitions, 2284 flow [2024-06-03 21:50:58,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2284, PETRI_PLACES=114, PETRI_TRANSITIONS=177} [2024-06-03 21:50:58,098 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 68 predicate places. [2024-06-03 21:50:58,098 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 177 transitions, 2284 flow [2024-06-03 21:50:58,098 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:58,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:50:58,098 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:58,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 21:50:58,098 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:50:58,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:50:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 628458054, now seen corresponding path program 4 times [2024-06-03 21:50:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:50:58,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747833038] [2024-06-03 21:50:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:50:58,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:50:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:08,400 INFO 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:08,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:08,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747833038] [2024-06-03 21:51:08,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747833038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:08,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:08,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:51:08,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42551776] [2024-06-03 21:51:08,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:08,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:51:08,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:08,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:51:08,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:51:08,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:51:08,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 177 transitions, 2284 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:08,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:08,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:51:08,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:10,741 INFO L124 PetriNetUnfolderBase]: 2397/3719 cut-off events. [2024-06-03 21:51:10,741 INFO L125 PetriNetUnfolderBase]: For 62930/62932 co-relation queries the response was YES. [2024-06-03 21:51:10,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21078 conditions, 3719 events. 2397/3719 cut-off events. For 62930/62932 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19249 event pairs, 562 based on Foata normal form. 8/3698 useless extension candidates. Maximal degree in co-relation 21026. Up to 2806 conditions per place. [2024-06-03 21:51:10,764 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 86 selfloop transitions, 117 changer transitions 0/209 dead transitions. [2024-06-03 21:51:10,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 209 transitions, 2932 flow [2024-06-03 21:51:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:51:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:51:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2024-06-03 21:51:10,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-06-03 21:51:10,765 INFO L175 Difference]: Start difference. First operand has 114 places, 177 transitions, 2284 flow. Second operand 9 states and 190 transitions. [2024-06-03 21:51:10,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 209 transitions, 2932 flow [2024-06-03 21:51:10,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 209 transitions, 2837 flow, removed 33 selfloop flow, removed 2 redundant places. [2024-06-03 21:51:10,819 INFO L231 Difference]: Finished difference. Result has 121 places, 177 transitions, 2433 flow [2024-06-03 21:51:10,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2189, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2433, PETRI_PLACES=121, PETRI_TRANSITIONS=177} [2024-06-03 21:51:10,820 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 75 predicate places. [2024-06-03 21:51:10,820 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 177 transitions, 2433 flow [2024-06-03 21:51:10,820 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:10,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:10,820 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:10,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 21:51:10,820 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:10,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1199561089, now seen corresponding path program 3 times [2024-06-03 21:51:10,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:10,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233902040] [2024-06-03 21:51:10,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:10,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:25,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:51:25,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:25,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233902040] [2024-06-03 21:51:25,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233902040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:25,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:25,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:51:25,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404236787] [2024-06-03 21:51:25,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:25,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:51:25,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:25,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:51:25,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:51:25,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:51:25,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 177 transitions, 2433 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:25,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:25,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:51:25,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:27,560 INFO L124 PetriNetUnfolderBase]: 2389/3747 cut-off events. [2024-06-03 21:51:27,561 INFO L125 PetriNetUnfolderBase]: For 66833/66838 co-relation queries the response was YES. [2024-06-03 21:51:27,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21530 conditions, 3747 events. 2389/3747 cut-off events. For 66833/66838 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 19701 event pairs, 669 based on Foata normal form. 5/3734 useless extension candidates. Maximal degree in co-relation 21475. Up to 3196 conditions per place. [2024-06-03 21:51:27,585 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 120 selfloop transitions, 73 changer transitions 0/199 dead transitions. [2024-06-03 21:51:27,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 199 transitions, 2967 flow [2024-06-03 21:51:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:51:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:51:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-06-03 21:51:27,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-03 21:51:27,587 INFO L175 Difference]: Start difference. First operand has 121 places, 177 transitions, 2433 flow. Second operand 7 states and 146 transitions. [2024-06-03 21:51:27,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 199 transitions, 2967 flow [2024-06-03 21:51:27,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 199 transitions, 2649 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-03 21:51:27,646 INFO L231 Difference]: Finished difference. Result has 120 places, 177 transitions, 2271 flow [2024-06-03 21:51:27,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2115, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2271, PETRI_PLACES=120, PETRI_TRANSITIONS=177} [2024-06-03 21:51:27,646 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 74 predicate places. [2024-06-03 21:51:27,646 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 177 transitions, 2271 flow [2024-06-03 21:51:27,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:27,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:27,647 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:27,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 21:51:27,647 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:27,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2101011364, now seen corresponding path program 5 times [2024-06-03 21:51:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:27,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612534470] [2024-06-03 21:51:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:27,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:43,185 INFO 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:43,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:43,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612534470] [2024-06-03 21:51:43,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612534470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:43,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:43,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:51:43,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347993637] [2024-06-03 21:51:43,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:43,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:51:43,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:43,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:51:43,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:51:43,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:51:43,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 177 transitions, 2271 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:43,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:43,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:51:43,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:45,383 INFO L124 PetriNetUnfolderBase]: 2373/3685 cut-off events. [2024-06-03 21:51:45,383 INFO L125 PetriNetUnfolderBase]: For 69228/69230 co-relation queries the response was YES. [2024-06-03 21:51:45,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21078 conditions, 3685 events. 2373/3685 cut-off events. For 69228/69230 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 19084 event pairs, 540 based on Foata normal form. 6/3660 useless extension candidates. Maximal degree in co-relation 21023. Up to 2794 conditions per place. [2024-06-03 21:51:45,407 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 79 selfloop transitions, 122 changer transitions 0/207 dead transitions. [2024-06-03 21:51:45,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 207 transitions, 2847 flow [2024-06-03 21:51:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:51:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:51:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2024-06-03 21:51:45,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2024-06-03 21:51:45,408 INFO L175 Difference]: Start difference. First operand has 120 places, 177 transitions, 2271 flow. Second operand 8 states and 173 transitions. [2024-06-03 21:51:45,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 207 transitions, 2847 flow [2024-06-03 21:51:45,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 207 transitions, 2629 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-03 21:51:45,456 INFO L231 Difference]: Finished difference. Result has 122 places, 177 transitions, 2307 flow [2024-06-03 21:51:45,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2053, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2307, PETRI_PLACES=122, PETRI_TRANSITIONS=177} [2024-06-03 21:51:45,457 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 76 predicate places. [2024-06-03 21:51:45,457 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 177 transitions, 2307 flow [2024-06-03 21:51:45,457 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:45,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:45,457 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:45,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 21:51:45,457 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:51:45,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1943610459, now seen corresponding path program 4 times [2024-06-03 21:51:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409209891] [2024-06-03 21:51:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:51:54,989 INFO 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:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:51:54,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409209891] [2024-06-03 21:51:54,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409209891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:51:54,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:51:54,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:51:54,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015466318] [2024-06-03 21:51:54,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:51:54,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:51:54,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:51:54,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:51:54,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:51:55,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:51:55,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 177 transitions, 2307 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:55,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:51:55,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:51:55,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:51:57,129 INFO L124 PetriNetUnfolderBase]: 2415/3788 cut-off events. [2024-06-03 21:51:57,129 INFO L125 PetriNetUnfolderBase]: For 74866/74873 co-relation queries the response was YES. [2024-06-03 21:51:57,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22091 conditions, 3788 events. 2415/3788 cut-off events. For 74866/74873 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 19971 event pairs, 629 based on Foata normal form. 6/3790 useless extension candidates. Maximal degree in co-relation 22035. Up to 3211 conditions per place. [2024-06-03 21:51:57,154 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 125 selfloop transitions, 104 changer transitions 0/235 dead transitions. [2024-06-03 21:51:57,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 235 transitions, 3328 flow [2024-06-03 21:51:57,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:51:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:51:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-06-03 21:51:57,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-03 21:51:57,155 INFO L175 Difference]: Start difference. First operand has 122 places, 177 transitions, 2307 flow. Second operand 8 states and 172 transitions. [2024-06-03 21:51:57,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 235 transitions, 3328 flow [2024-06-03 21:51:57,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 235 transitions, 2933 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 21:51:57,209 INFO L231 Difference]: Finished difference. Result has 125 places, 207 transitions, 2718 flow [2024-06-03 21:51:57,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1977, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2718, PETRI_PLACES=125, PETRI_TRANSITIONS=207} [2024-06-03 21:51:57,210 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 79 predicate places. [2024-06-03 21:51:57,210 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 207 transitions, 2718 flow [2024-06-03 21:51:57,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:51:57,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:51:57,210 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:57,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 21:51:57,211 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:51:57,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:51:57,211 INFO L85 PathProgramCache]: Analyzing trace with hash -656385548, now seen corresponding path program 1 times [2024-06-03 21:51:57,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:51:57,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993434787] [2024-06-03 21:51:57,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:51:57,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:51:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:12,207 INFO 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:12,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:12,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993434787] [2024-06-03 21:52:12,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993434787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:12,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:12,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:52:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248956152] [2024-06-03 21:52:12,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:12,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:52:12,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:12,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:52:12,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:52:12,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:52:12,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 207 transitions, 2718 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:12,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:12,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:52:12,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:13,969 INFO L124 PetriNetUnfolderBase]: 2301/3670 cut-off events. [2024-06-03 21:52:13,969 INFO L125 PetriNetUnfolderBase]: For 78893/78897 co-relation queries the response was YES. [2024-06-03 21:52:13,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21522 conditions, 3670 events. 2301/3670 cut-off events. For 78893/78897 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19778 event pairs, 700 based on Foata normal form. 3/3644 useless extension candidates. Maximal degree in co-relation 21463. Up to 3315 conditions per place. [2024-06-03 21:52:13,993 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 179 selfloop transitions, 12 changer transitions 0/218 dead transitions. [2024-06-03 21:52:13,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 218 transitions, 3148 flow [2024-06-03 21:52:13,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:52:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:52:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2024-06-03 21:52:13,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2024-06-03 21:52:13,994 INFO L175 Difference]: Start difference. First operand has 125 places, 207 transitions, 2718 flow. Second operand 6 states and 119 transitions. [2024-06-03 21:52:13,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 218 transitions, 3148 flow [2024-06-03 21:52:14,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 218 transitions, 2865 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-03 21:52:14,062 INFO L231 Difference]: Finished difference. Result has 125 places, 210 transitions, 2497 flow [2024-06-03 21:52:14,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2435, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2497, PETRI_PLACES=125, PETRI_TRANSITIONS=210} [2024-06-03 21:52:14,063 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 79 predicate places. [2024-06-03 21:52:14,063 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 210 transitions, 2497 flow [2024-06-03 21:52:14,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:14,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:14,063 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:52:14,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 21:52:14,063 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:14,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash 46891156, now seen corresponding path program 1 times [2024-06-03 21:52:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:14,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940928254] [2024-06-03 21:52:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:30,547 INFO 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:30,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:30,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940928254] [2024-06-03 21:52:30,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940928254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:30,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:30,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:52:30,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927413350] [2024-06-03 21:52:30,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:30,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:52:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:30,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:52:30,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:52:30,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:52:30,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 210 transitions, 2497 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:30,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:30,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:52:30,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:32,820 INFO L124 PetriNetUnfolderBase]: 2381/3765 cut-off events. [2024-06-03 21:52:32,820 INFO L125 PetriNetUnfolderBase]: For 93849/93859 co-relation queries the response was YES. [2024-06-03 21:52:32,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22852 conditions, 3765 events. 2381/3765 cut-off events. For 93849/93859 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 20270 event pairs, 667 based on Foata normal form. 9/3760 useless extension candidates. Maximal degree in co-relation 22793. Up to 3215 conditions per place. [2024-06-03 21:52:32,845 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 154 selfloop transitions, 53 changer transitions 0/235 dead transitions. [2024-06-03 21:52:32,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 235 transitions, 3017 flow [2024-06-03 21:52:32,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:52:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:52:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-03 21:52:32,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-03 21:52:32,848 INFO L175 Difference]: Start difference. First operand has 125 places, 210 transitions, 2497 flow. Second operand 7 states and 152 transitions. [2024-06-03 21:52:32,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 235 transitions, 3017 flow [2024-06-03 21:52:32,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 235 transitions, 2977 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 21:52:32,913 INFO L231 Difference]: Finished difference. Result has 128 places, 212 transitions, 2601 flow [2024-06-03 21:52:32,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2457, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2601, PETRI_PLACES=128, PETRI_TRANSITIONS=212} [2024-06-03 21:52:32,914 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 82 predicate places. [2024-06-03 21:52:32,914 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 212 transitions, 2601 flow [2024-06-03 21:52:32,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:32,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:32,914 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:52:32,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 21:52:32,914 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:32,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:32,915 INFO L85 PathProgramCache]: Analyzing trace with hash 49569556, now seen corresponding path program 2 times [2024-06-03 21:52:32,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:32,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924790139] [2024-06-03 21:52:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:32,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:52:47,965 INFO 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:47,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:52:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924790139] [2024-06-03 21:52:47,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924790139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:52:47,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:52:47,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:52:47,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104651627] [2024-06-03 21:52:47,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:52:47,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:52:47,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:52:47,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:52:47,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:52:48,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:52:48,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 212 transitions, 2601 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:48,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:52:48,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:52:48,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:52:50,154 INFO L124 PetriNetUnfolderBase]: 2367/3766 cut-off events. [2024-06-03 21:52:50,154 INFO L125 PetriNetUnfolderBase]: For 100785/100790 co-relation queries the response was YES. [2024-06-03 21:52:50,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23410 conditions, 3766 events. 2367/3766 cut-off events. For 100785/100790 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 20376 event pairs, 515 based on Foata normal form. 6/3768 useless extension candidates. Maximal degree in co-relation 23350. Up to 3088 conditions per place. [2024-06-03 21:52:50,179 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 163 selfloop transitions, 46 changer transitions 0/237 dead transitions. [2024-06-03 21:52:50,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 237 transitions, 3121 flow [2024-06-03 21:52:50,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:52:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:52:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-03 21:52:50,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-03 21:52:50,182 INFO L175 Difference]: Start difference. First operand has 128 places, 212 transitions, 2601 flow. Second operand 7 states and 152 transitions. [2024-06-03 21:52:50,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 237 transitions, 3121 flow [2024-06-03 21:52:50,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 237 transitions, 3001 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-03 21:52:50,246 INFO L231 Difference]: Finished difference. Result has 130 places, 214 transitions, 2612 flow [2024-06-03 21:52:50,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2481, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2612, PETRI_PLACES=130, PETRI_TRANSITIONS=214} [2024-06-03 21:52:50,247 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 84 predicate places. [2024-06-03 21:52:50,247 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 214 transitions, 2612 flow [2024-06-03 21:52:50,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:52:50,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:52:50,247 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:52:50,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 21:52:50,247 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:52:50,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:52:50,248 INFO L85 PathProgramCache]: Analyzing trace with hash -70210800, now seen corresponding path program 1 times [2024-06-03 21:52:50,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:52:50,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557661448] [2024-06-03 21:52:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:52:50,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:52:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:53:06,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:06,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557661448] [2024-06-03 21:53:06,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557661448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:06,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:06,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:53:06,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767759586] [2024-06-03 21:53:06,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:06,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:53:06,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:06,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:53:06,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:53:06,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:53:06,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 214 transitions, 2612 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:06,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:06,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:53:06,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:08,561 INFO L124 PetriNetUnfolderBase]: 2550/3996 cut-off events. [2024-06-03 21:53:08,562 INFO L125 PetriNetUnfolderBase]: For 110564/110571 co-relation queries the response was YES. [2024-06-03 21:53:08,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24945 conditions, 3996 events. 2550/3996 cut-off events. For 110564/110571 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 21372 event pairs, 600 based on Foata normal form. 14/4006 useless extension candidates. Maximal degree in co-relation 24884. Up to 2958 conditions per place. [2024-06-03 21:53:08,589 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 105 selfloop transitions, 148 changer transitions 0/260 dead transitions. [2024-06-03 21:53:08,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 260 transitions, 3497 flow [2024-06-03 21:53:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:53:08,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:53:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2024-06-03 21:53:08,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49722222222222223 [2024-06-03 21:53:08,592 INFO L175 Difference]: Start difference. First operand has 130 places, 214 transitions, 2612 flow. Second operand 8 states and 179 transitions. [2024-06-03 21:53:08,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 260 transitions, 3497 flow [2024-06-03 21:53:08,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 260 transitions, 3384 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-03 21:53:08,662 INFO L231 Difference]: Finished difference. Result has 133 places, 223 transitions, 2953 flow [2024-06-03 21:53:08,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2499, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2953, PETRI_PLACES=133, PETRI_TRANSITIONS=223} [2024-06-03 21:53:08,663 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 87 predicate places. [2024-06-03 21:53:08,663 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 223 transitions, 2953 flow [2024-06-03 21:53:08,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:08,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:08,664 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:53:08,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 21:53:08,664 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:08,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:08,665 INFO L85 PathProgramCache]: Analyzing trace with hash -70031310, now seen corresponding path program 2 times [2024-06-03 21:53:08,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:08,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773647848] [2024-06-03 21:53:08,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:08,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:25,465 INFO 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:25,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:25,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773647848] [2024-06-03 21:53:25,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773647848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:25,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:25,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:53:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532723173] [2024-06-03 21:53:25,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:25,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:53:25,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:25,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:53:25,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:53:25,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:53:25,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 223 transitions, 2953 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:25,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:25,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:53:25,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:28,077 INFO L124 PetriNetUnfolderBase]: 2660/4174 cut-off events. [2024-06-03 21:53:28,077 INFO L125 PetriNetUnfolderBase]: For 123893/123898 co-relation queries the response was YES. [2024-06-03 21:53:28,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27003 conditions, 4174 events. 2660/4174 cut-off events. For 123893/123898 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 22562 event pairs, 574 based on Foata normal form. 10/4180 useless extension candidates. Maximal degree in co-relation 26941. Up to 3054 conditions per place. [2024-06-03 21:53:28,103 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 114 selfloop transitions, 152 changer transitions 0/273 dead transitions. [2024-06-03 21:53:28,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 273 transitions, 4064 flow [2024-06-03 21:53:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:53:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:53:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-03 21:53:28,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-06-03 21:53:28,106 INFO L175 Difference]: Start difference. First operand has 133 places, 223 transitions, 2953 flow. Second operand 8 states and 177 transitions. [2024-06-03 21:53:28,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 273 transitions, 4064 flow [2024-06-03 21:53:28,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 273 transitions, 3772 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-03 21:53:28,192 INFO L231 Difference]: Finished difference. Result has 136 places, 238 transitions, 3247 flow [2024-06-03 21:53:28,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2676, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3247, PETRI_PLACES=136, PETRI_TRANSITIONS=238} [2024-06-03 21:53:28,193 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 90 predicate places. [2024-06-03 21:53:28,193 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 238 transitions, 3247 flow [2024-06-03 21:53:28,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:28,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:28,193 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:53:28,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 21:53:28,193 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:28,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:28,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2136686050, now seen corresponding path program 3 times [2024-06-03 21:53:28,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:28,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67503383] [2024-06-03 21:53:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:38,653 INFO 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:38,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:38,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67503383] [2024-06-03 21:53:38,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67503383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:38,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:38,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:53:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847532457] [2024-06-03 21:53:38,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:38,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:53:38,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:38,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:53:38,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:53:38,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:53:38,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 238 transitions, 3247 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:38,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:38,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:53:38,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:41,217 INFO L124 PetriNetUnfolderBase]: 2634/4138 cut-off events. [2024-06-03 21:53:41,217 INFO L125 PetriNetUnfolderBase]: For 128924/128929 co-relation queries the response was YES. [2024-06-03 21:53:41,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26830 conditions, 4138 events. 2634/4138 cut-off events. For 128924/128929 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22363 event pairs, 569 based on Foata normal form. 10/4144 useless extension candidates. Maximal degree in co-relation 26767. Up to 3033 conditions per place. [2024-06-03 21:53:41,245 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 119 selfloop transitions, 148 changer transitions 0/274 dead transitions. [2024-06-03 21:53:41,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 274 transitions, 4015 flow [2024-06-03 21:53:41,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:53:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:53:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-03 21:53:41,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-06-03 21:53:41,248 INFO L175 Difference]: Start difference. First operand has 136 places, 238 transitions, 3247 flow. Second operand 8 states and 177 transitions. [2024-06-03 21:53:41,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 274 transitions, 4015 flow [2024-06-03 21:53:41,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 274 transitions, 3714 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-03 21:53:41,353 INFO L231 Difference]: Finished difference. Result has 140 places, 238 transitions, 3259 flow [2024-06-03 21:53:41,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2946, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3259, PETRI_PLACES=140, PETRI_TRANSITIONS=238} [2024-06-03 21:53:41,354 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 94 predicate places. [2024-06-03 21:53:41,354 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 238 transitions, 3259 flow [2024-06-03 21:53:41,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:53:41,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:41,355 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:53:41,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 21:53:41,355 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:53:41,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1125436419, now seen corresponding path program 1 times [2024-06-03 21:53:41,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:41,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311497002] [2024-06-03 21:53:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:41,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:53:56,673 INFO 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:56,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:53:56,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311497002] [2024-06-03 21:53:56,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311497002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:53:56,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:53:56,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:53:56,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101534174] [2024-06-03 21:53:56,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:53:56,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:53:56,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:53:56,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:53:56,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:53:56,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:53:56,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 238 transitions, 3259 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:56,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:53:56,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:53:56,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:53:58,840 INFO L124 PetriNetUnfolderBase]: 2544/4045 cut-off events. [2024-06-03 21:53:58,840 INFO L125 PetriNetUnfolderBase]: For 135793/135808 co-relation queries the response was YES. [2024-06-03 21:53:58,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26586 conditions, 4045 events. 2544/4045 cut-off events. For 135793/135808 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 22381 event pairs, 704 based on Foata normal form. 14/4031 useless extension candidates. Maximal degree in co-relation 26522. Up to 3603 conditions per place. [2024-06-03 21:53:58,869 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 209 selfloop transitions, 19 changer transitions 0/256 dead transitions. [2024-06-03 21:53:58,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 256 transitions, 3809 flow [2024-06-03 21:53:58,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:53:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:53:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-06-03 21:53:58,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-03 21:53:58,870 INFO L175 Difference]: Start difference. First operand has 140 places, 238 transitions, 3259 flow. Second operand 6 states and 125 transitions. [2024-06-03 21:53:58,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 256 transitions, 3809 flow [2024-06-03 21:53:58,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 256 transitions, 3474 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-03 21:53:58,986 INFO L231 Difference]: Finished difference. Result has 139 places, 241 transitions, 3006 flow [2024-06-03 21:53:58,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2924, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3006, PETRI_PLACES=139, PETRI_TRANSITIONS=241} [2024-06-03 21:53:58,987 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 93 predicate places. [2024-06-03 21:53:58,988 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 241 transitions, 3006 flow [2024-06-03 21:53:58,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:58,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:53:58,988 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:53:58,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 21:53:58,988 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:53:58,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:53:58,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1417437790, now seen corresponding path program 4 times [2024-06-03 21:53:58,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:53:58,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813322430] [2024-06-03 21:53:58,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:53:58,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:53:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:54:14,990 INFO 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:14,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:54:14,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813322430] [2024-06-03 21:54:14,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813322430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:54:14,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:54:14,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:54:14,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304285171] [2024-06-03 21:54:14,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:54:14,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:54:14,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:54:14,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:54:14,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:54:15,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:54:15,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 241 transitions, 3006 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:15,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:54:15,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:54:15,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:54:17,451 INFO L124 PetriNetUnfolderBase]: 2701/4241 cut-off events. [2024-06-03 21:54:17,451 INFO L125 PetriNetUnfolderBase]: For 141541/141546 co-relation queries the response was YES. [2024-06-03 21:54:17,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27384 conditions, 4241 events. 2701/4241 cut-off events. For 141541/141546 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 23011 event pairs, 586 based on Foata normal form. 8/4229 useless extension candidates. Maximal degree in co-relation 27319. Up to 3098 conditions per place. [2024-06-03 21:54:17,480 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 126 selfloop transitions, 145 changer transitions 0/278 dead transitions. [2024-06-03 21:54:17,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 278 transitions, 3884 flow [2024-06-03 21:54:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:54:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:54:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-06-03 21:54:17,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-03 21:54:17,483 INFO L175 Difference]: Start difference. First operand has 139 places, 241 transitions, 3006 flow. Second operand 8 states and 171 transitions. [2024-06-03 21:54:17,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 278 transitions, 3884 flow [2024-06-03 21:54:17,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 278 transitions, 3828 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-03 21:54:17,598 INFO L231 Difference]: Finished difference. Result has 143 places, 247 transitions, 3359 flow [2024-06-03 21:54:17,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2950, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3359, PETRI_PLACES=143, PETRI_TRANSITIONS=247} [2024-06-03 21:54:17,598 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 97 predicate places. [2024-06-03 21:54:17,598 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 247 transitions, 3359 flow [2024-06-03 21:54:17,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:17,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:54:17,599 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:54:17,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 21:54:17,599 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:17,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:54:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash 698569838, now seen corresponding path program 5 times [2024-06-03 21:54:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:54:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50862633] [2024-06-03 21:54:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:54:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:54:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:54:33,877 INFO 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:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:54:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50862633] [2024-06-03 21:54:33,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50862633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:54:33,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:54:33,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:54:33,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222746828] [2024-06-03 21:54:33,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:54:33,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:54:33,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:54:33,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:54:33,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:54:34,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:54:34,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 247 transitions, 3359 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:34,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:54:34,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:54:34,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:54:36,488 INFO L124 PetriNetUnfolderBase]: 2737/4305 cut-off events. [2024-06-03 21:54:36,489 INFO L125 PetriNetUnfolderBase]: For 153894/153899 co-relation queries the response was YES. [2024-06-03 21:54:36,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28732 conditions, 4305 events. 2737/4305 cut-off events. For 153894/153899 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 23514 event pairs, 591 based on Foata normal form. 8/4293 useless extension candidates. Maximal degree in co-relation 28666. Up to 3130 conditions per place. [2024-06-03 21:54:36,520 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 126 selfloop transitions, 150 changer transitions 0/283 dead transitions. [2024-06-03 21:54:36,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 283 transitions, 4253 flow [2024-06-03 21:54:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:54:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:54:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-06-03 21:54:36,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-03 21:54:36,523 INFO L175 Difference]: Start difference. First operand has 143 places, 247 transitions, 3359 flow. Second operand 8 states and 172 transitions. [2024-06-03 21:54:36,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 283 transitions, 4253 flow [2024-06-03 21:54:36,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 283 transitions, 3766 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-03 21:54:36,644 INFO L231 Difference]: Finished difference. Result has 144 places, 253 transitions, 3301 flow [2024-06-03 21:54:36,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2898, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3301, PETRI_PLACES=144, PETRI_TRANSITIONS=253} [2024-06-03 21:54:36,644 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 98 predicate places. [2024-06-03 21:54:36,645 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 253 transitions, 3301 flow [2024-06-03 21:54:36,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:36,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:54:36,645 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:54:36,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 21:54:36,645 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:54:36,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:54:36,645 INFO L85 PathProgramCache]: Analyzing trace with hash 706844048, now seen corresponding path program 6 times [2024-06-03 21:54:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:54:36,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861976936] [2024-06-03 21:54:36,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:54:36,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:54:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:54:53,356 INFO 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:53,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:54:53,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861976936] [2024-06-03 21:54:53,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861976936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:54:53,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:54:53,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:54:53,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390850198] [2024-06-03 21:54:53,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:54:53,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:54:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:54:53,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:54:53,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:54:53,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:54:53,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 253 transitions, 3301 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:53,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:54:53,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:54:53,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:54:55,816 INFO L124 PetriNetUnfolderBase]: 2721/4284 cut-off events. [2024-06-03 21:54:55,817 INFO L125 PetriNetUnfolderBase]: For 155308/155313 co-relation queries the response was YES. [2024-06-03 21:54:55,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28425 conditions, 4284 events. 2721/4284 cut-off events. For 155308/155313 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 23399 event pairs, 599 based on Foata normal form. 8/4272 useless extension candidates. Maximal degree in co-relation 28358. Up to 3117 conditions per place. [2024-06-03 21:54:55,848 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 108 selfloop transitions, 164 changer transitions 0/279 dead transitions. [2024-06-03 21:54:55,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 279 transitions, 3935 flow [2024-06-03 21:54:55,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:54:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:54:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-03 21:54:55,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638888888888889 [2024-06-03 21:54:55,852 INFO L175 Difference]: Start difference. First operand has 144 places, 253 transitions, 3301 flow. Second operand 8 states and 167 transitions. [2024-06-03 21:54:55,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 279 transitions, 3935 flow [2024-06-03 21:54:55,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 279 transitions, 3611 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-03 21:54:55,985 INFO L231 Difference]: Finished difference. Result has 147 places, 253 transitions, 3316 flow [2024-06-03 21:54:55,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2977, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3316, PETRI_PLACES=147, PETRI_TRANSITIONS=253} [2024-06-03 21:54:55,986 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 101 predicate places. [2024-06-03 21:54:55,986 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 253 transitions, 3316 flow [2024-06-03 21:54:55,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:54:55,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:54:55,986 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:54:55,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 21:54:55,987 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:54:55,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:54:55,987 INFO L85 PathProgramCache]: Analyzing trace with hash 572757209, now seen corresponding path program 2 times [2024-06-03 21:54:55,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:54:55,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920672233] [2024-06-03 21:54:55,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:54:55,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:54:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:11,384 INFO 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:11,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:11,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920672233] [2024-06-03 21:55:11,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920672233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:11,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:11,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:55:11,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276987297] [2024-06-03 21:55:11,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:11,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:55:11,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:11,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:55:11,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:55:11,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:55:11,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 253 transitions, 3316 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:11,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:11,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:55:11,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:13,329 INFO L124 PetriNetUnfolderBase]: 2586/4143 cut-off events. [2024-06-03 21:55:13,329 INFO L125 PetriNetUnfolderBase]: For 161664/161683 co-relation queries the response was YES. [2024-06-03 21:55:13,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28012 conditions, 4143 events. 2586/4143 cut-off events. For 161664/161683 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 23242 event pairs, 705 based on Foata normal form. 15/4135 useless extension candidates. Maximal degree in co-relation 27944. Up to 3664 conditions per place. [2024-06-03 21:55:13,361 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 215 selfloop transitions, 23 changer transitions 0/266 dead transitions. [2024-06-03 21:55:13,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 266 transitions, 3876 flow [2024-06-03 21:55:13,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:55:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:55:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-03 21:55:13,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44814814814814813 [2024-06-03 21:55:13,362 INFO L175 Difference]: Start difference. First operand has 147 places, 253 transitions, 3316 flow. Second operand 6 states and 121 transitions. [2024-06-03 21:55:13,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 266 transitions, 3876 flow [2024-06-03 21:55:13,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 266 transitions, 3497 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 21:55:13,487 INFO L231 Difference]: Finished difference. Result has 145 places, 256 transitions, 3031 flow [2024-06-03 21:55:13,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2937, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3031, PETRI_PLACES=145, PETRI_TRANSITIONS=256} [2024-06-03 21:55:13,487 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 99 predicate places. [2024-06-03 21:55:13,487 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 256 transitions, 3031 flow [2024-06-03 21:55:13,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:13,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:13,488 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:55:13,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 21:55:13,488 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:55:13,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:13,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1137333611, now seen corresponding path program 1 times [2024-06-03 21:55:13,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:13,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169729435] [2024-06-03 21:55:13,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:13,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:55:28,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:28,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169729435] [2024-06-03 21:55:28,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169729435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:28,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:28,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:55:28,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501590093] [2024-06-03 21:55:28,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:28,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:55:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:28,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:55:28,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:55:28,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-03 21:55:28,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 256 transitions, 3031 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:28,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:28,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-03 21:55:28,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:30,286 INFO L124 PetriNetUnfolderBase]: 2369/3892 cut-off events. [2024-06-03 21:55:30,286 INFO L125 PetriNetUnfolderBase]: For 145709/145715 co-relation queries the response was YES. [2024-06-03 21:55:30,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25607 conditions, 3892 events. 2369/3892 cut-off events. For 145709/145715 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 22251 event pairs, 686 based on Foata normal form. 5/3865 useless extension candidates. Maximal degree in co-relation 25538. Up to 3366 conditions per place. [2024-06-03 21:55:30,315 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 229 selfloop transitions, 12 changer transitions 0/270 dead transitions. [2024-06-03 21:55:30,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 270 transitions, 3577 flow [2024-06-03 21:55:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:55:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:55:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2024-06-03 21:55:30,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703703703703704 [2024-06-03 21:55:30,316 INFO L175 Difference]: Start difference. First operand has 145 places, 256 transitions, 3031 flow. Second operand 6 states and 127 transitions. [2024-06-03 21:55:30,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 270 transitions, 3577 flow [2024-06-03 21:55:30,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 270 transitions, 3505 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-03 21:55:30,446 INFO L231 Difference]: Finished difference. Result has 147 places, 259 transitions, 3027 flow [2024-06-03 21:55:30,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2959, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3027, PETRI_PLACES=147, PETRI_TRANSITIONS=259} [2024-06-03 21:55:30,446 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 101 predicate places. [2024-06-03 21:55:30,447 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 259 transitions, 3027 flow [2024-06-03 21:55:30,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:30,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:30,447 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:55:30,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 21:55:30,447 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:55:30,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash 565353851, now seen corresponding path program 2 times [2024-06-03 21:55:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:30,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838563548] [2024-06-03 21:55:30,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:55:45,736 INFO 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:45,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:55:45,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838563548] [2024-06-03 21:55:45,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838563548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:55:45,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:55:45,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:55:45,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845981907] [2024-06-03 21:55:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:55:45,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:55:45,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:55:45,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:55:45,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:55:45,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-03 21:55:45,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 259 transitions, 3027 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:45,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:55:45,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-03 21:55:45,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:55:47,633 INFO L124 PetriNetUnfolderBase]: 2366/3889 cut-off events. [2024-06-03 21:55:47,633 INFO L125 PetriNetUnfolderBase]: For 152549/152558 co-relation queries the response was YES. [2024-06-03 21:55:47,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26037 conditions, 3889 events. 2366/3889 cut-off events. For 152549/152558 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 22248 event pairs, 690 based on Foata normal form. 7/3863 useless extension candidates. Maximal degree in co-relation 25967. Up to 3356 conditions per place. [2024-06-03 21:55:47,660 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 224 selfloop transitions, 17 changer transitions 0/270 dead transitions. [2024-06-03 21:55:47,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 270 transitions, 3569 flow [2024-06-03 21:55:47,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:55:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:55:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-03 21:55:47,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-03 21:55:47,661 INFO L175 Difference]: Start difference. First operand has 147 places, 259 transitions, 3027 flow. Second operand 6 states and 126 transitions. [2024-06-03 21:55:47,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 270 transitions, 3569 flow [2024-06-03 21:55:47,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 270 transitions, 3523 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-03 21:55:47,773 INFO L231 Difference]: Finished difference. Result has 149 places, 262 transitions, 3065 flow [2024-06-03 21:55:47,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2981, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3065, PETRI_PLACES=149, PETRI_TRANSITIONS=262} [2024-06-03 21:55:47,774 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 103 predicate places. [2024-06-03 21:55:47,774 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 262 transitions, 3065 flow [2024-06-03 21:55:47,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:55:47,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:55:47,774 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:55:47,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 21:55:47,774 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:55:47,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:55:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash 707151878, now seen corresponding path program 1 times [2024-06-03 21:55:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:55:47,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271996286] [2024-06-03 21:55:47,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:55:47,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:55:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:56:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:56:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:56:03,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271996286] [2024-06-03 21:56:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271996286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:56:03,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:56:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:56:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537724383] [2024-06-03 21:56:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:56:03,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:56:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:56:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:56:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:56:03,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:56:03,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 262 transitions, 3065 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:56:03,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:56:03,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:56:03,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:56:05,926 INFO L124 PetriNetUnfolderBase]: 2469/4003 cut-off events. [2024-06-03 21:56:05,927 INFO L125 PetriNetUnfolderBase]: For 159077/159079 co-relation queries the response was YES. [2024-06-03 21:56:05,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26897 conditions, 4003 events. 2469/4003 cut-off events. For 159077/159079 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 22410 event pairs, 669 based on Foata normal form. 4/4004 useless extension candidates. Maximal degree in co-relation 26826. Up to 3544 conditions per place. [2024-06-03 21:56:05,956 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 266 selfloop transitions, 20 changer transitions 0/294 dead transitions. [2024-06-03 21:56:05,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 294 transitions, 3779 flow [2024-06-03 21:56:05,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:56:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:56:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2024-06-03 21:56:05,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2024-06-03 21:56:05,959 INFO L175 Difference]: Start difference. First operand has 149 places, 262 transitions, 3065 flow. Second operand 9 states and 183 transitions. [2024-06-03 21:56:05,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 294 transitions, 3779 flow [2024-06-03 21:56:06,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 294 transitions, 3717 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-03 21:56:06,059 INFO L231 Difference]: Finished difference. Result has 155 places, 267 transitions, 3122 flow [2024-06-03 21:56:06,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3003, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3122, PETRI_PLACES=155, PETRI_TRANSITIONS=267} [2024-06-03 21:56:06,060 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 109 predicate places. [2024-06-03 21:56:06,060 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 267 transitions, 3122 flow [2024-06-03 21:56:06,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:56:06,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:56:06,061 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:06,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 21:56:06,061 INFO L420 AbstractCegarLoop]: === Iteration 37 === 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:06,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:56:06,061 INFO L85 PathProgramCache]: Analyzing trace with hash 572773081, now seen corresponding path program 1 times [2024-06-03 21:56:06,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:56:06,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972069712] [2024-06-03 21:56:06,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:56:06,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:56:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:56:22,210 INFO 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:22,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:56:22,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972069712] [2024-06-03 21:56:22,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972069712] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:56:22,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:56:22,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:56:22,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117524203] [2024-06-03 21:56:22,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:56:22,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:56:22,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:56:22,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:56:22,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:56:22,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:56:22,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 267 transitions, 3122 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:22,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:56:22,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:56:22,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:56:24,121 INFO L124 PetriNetUnfolderBase]: 2490/4005 cut-off events. [2024-06-03 21:56:24,122 INFO L125 PetriNetUnfolderBase]: For 165923/165929 co-relation queries the response was YES. [2024-06-03 21:56:24,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27558 conditions, 4005 events. 2490/4005 cut-off events. For 165923/165929 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 22334 event pairs, 699 based on Foata normal form. 5/3978 useless extension candidates. Maximal degree in co-relation 27485. Up to 3588 conditions per place. [2024-06-03 21:56:24,151 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 237 selfloop transitions, 15 changer transitions 0/279 dead transitions. [2024-06-03 21:56:24,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 279 transitions, 3690 flow [2024-06-03 21:56:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:56:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:56:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-03 21:56:24,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 21:56:24,152 INFO L175 Difference]: Start difference. First operand has 155 places, 267 transitions, 3122 flow. Second operand 7 states and 135 transitions. [2024-06-03 21:56:24,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 279 transitions, 3690 flow [2024-06-03 21:56:24,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 279 transitions, 3619 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-03 21:56:24,285 INFO L231 Difference]: Finished difference. Result has 156 places, 270 transitions, 3133 flow [2024-06-03 21:56:24,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3051, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3133, PETRI_PLACES=156, PETRI_TRANSITIONS=270} [2024-06-03 21:56:24,285 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 110 predicate places. [2024-06-03 21:56:24,285 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 270 transitions, 3133 flow [2024-06-03 21:56:24,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:24,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:56:24,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:56:24,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 21:56:24,286 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:56:24,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:56:24,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1540466906, now seen corresponding path program 1 times [2024-06-03 21:56:24,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:56:24,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307989379] [2024-06-03 21:56:24,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:56:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:56:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:56:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:56:40,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:56:40,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307989379] [2024-06-03 21:56:40,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307989379] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:56:40,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:56:40,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:56:40,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367395054] [2024-06-03 21:56:40,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:56:40,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:56:40,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:56:40,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:56:40,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:56:40,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:56:40,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 270 transitions, 3133 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:56:40,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:56:40,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:56:40,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:56:42,963 INFO L124 PetriNetUnfolderBase]: 2727/4287 cut-off events. [2024-06-03 21:56:42,963 INFO L125 PetriNetUnfolderBase]: For 202003/202008 co-relation queries the response was YES. [2024-06-03 21:56:42,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30541 conditions, 4287 events. 2727/4287 cut-off events. For 202003/202008 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 23370 event pairs, 679 based on Foata normal form. 4/4287 useless extension candidates. Maximal degree in co-relation 30467. Up to 3596 conditions per place. [2024-06-03 21:56:42,997 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 184 selfloop transitions, 108 changer transitions 0/299 dead transitions. [2024-06-03 21:56:42,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 299 transitions, 3841 flow [2024-06-03 21:56:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:56:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:56:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-03 21:56:43,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638888888888889 [2024-06-03 21:56:43,000 INFO L175 Difference]: Start difference. First operand has 156 places, 270 transitions, 3133 flow. Second operand 8 states and 167 transitions. [2024-06-03 21:56:43,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 299 transitions, 3841 flow [2024-06-03 21:56:43,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 299 transitions, 3781 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-03 21:56:43,153 INFO L231 Difference]: Finished difference. Result has 159 places, 272 transitions, 3333 flow [2024-06-03 21:56:43,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3073, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3333, PETRI_PLACES=159, PETRI_TRANSITIONS=272} [2024-06-03 21:56:43,153 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 113 predicate places. [2024-06-03 21:56:43,153 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 272 transitions, 3333 flow [2024-06-03 21:56:43,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:56:43,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:56:43,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:56:43,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 21:56:43,154 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:56:43,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:56:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1455746144, now seen corresponding path program 2 times [2024-06-03 21:56:43,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:56:43,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512758090] [2024-06-03 21:56:43,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:56:43,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:56:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:57:00,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:57:00,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:57:00,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512758090] [2024-06-03 21:57:00,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512758090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:57:00,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:57:00,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:57:00,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836662580] [2024-06-03 21:57:00,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:57:00,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:57:00,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:57:00,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:57:00,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:57:00,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:57:00,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 272 transitions, 3333 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:57:00,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:57:00,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:57:00,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:57:02,770 INFO L124 PetriNetUnfolderBase]: 2744/4316 cut-off events. [2024-06-03 21:57:02,770 INFO L125 PetriNetUnfolderBase]: For 213711/213716 co-relation queries the response was YES. [2024-06-03 21:57:02,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31450 conditions, 4316 events. 2744/4316 cut-off events. For 213711/213716 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 23530 event pairs, 683 based on Foata normal form. 4/4316 useless extension candidates. Maximal degree in co-relation 31375. Up to 3571 conditions per place. [2024-06-03 21:57:02,805 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 185 selfloop transitions, 109 changer transitions 0/301 dead transitions. [2024-06-03 21:57:02,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 301 transitions, 4041 flow [2024-06-03 21:57:02,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:57:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:57:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2024-06-03 21:57:02,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-03 21:57:02,809 INFO L175 Difference]: Start difference. First operand has 159 places, 272 transitions, 3333 flow. Second operand 8 states and 168 transitions. [2024-06-03 21:57:02,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 301 transitions, 4041 flow [2024-06-03 21:57:02,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 301 transitions, 3805 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 21:57:02,946 INFO L231 Difference]: Finished difference. Result has 161 places, 274 transitions, 3360 flow [2024-06-03 21:57:02,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3097, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3360, PETRI_PLACES=161, PETRI_TRANSITIONS=274} [2024-06-03 21:57:02,947 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 115 predicate places. [2024-06-03 21:57:02,947 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 274 transitions, 3360 flow [2024-06-03 21:57:02,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:57:02,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:57:02,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:57:02,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 21:57:02,948 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:02,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:57:02,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1451753276, now seen corresponding path program 3 times [2024-06-03 21:57:02,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:57:02,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999231934] [2024-06-03 21:57:02,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:57:02,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:57:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:57:20,560 INFO 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:20,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:57:20,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999231934] [2024-06-03 21:57:20,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999231934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:57:20,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:57:20,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:57:20,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094201575] [2024-06-03 21:57:20,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:57:20,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:57:20,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:57:20,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:57:20,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:57:20,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:57:20,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 274 transitions, 3360 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:57:20,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:57:20,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:57:20,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:57:23,054 INFO L124 PetriNetUnfolderBase]: 2761/4355 cut-off events. [2024-06-03 21:57:23,054 INFO L125 PetriNetUnfolderBase]: For 224496/224501 co-relation queries the response was YES. [2024-06-03 21:57:23,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31995 conditions, 4355 events. 2761/4355 cut-off events. For 224496/224501 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 23878 event pairs, 559 based on Foata normal form. 4/4355 useless extension candidates. Maximal degree in co-relation 31919. Up to 3403 conditions per place. [2024-06-03 21:57:23,091 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 200 selfloop transitions, 100 changer transitions 0/307 dead transitions. [2024-06-03 21:57:23,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 307 transitions, 4260 flow [2024-06-03 21:57:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:57:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:57:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-03 21:57:23,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2024-06-03 21:57:23,094 INFO L175 Difference]: Start difference. First operand has 161 places, 274 transitions, 3360 flow. Second operand 8 states and 169 transitions. [2024-06-03 21:57:23,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 307 transitions, 4260 flow [2024-06-03 21:57:23,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 307 transitions, 4015 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-03 21:57:23,220 INFO L231 Difference]: Finished difference. Result has 163 places, 278 transitions, 3402 flow [2024-06-03 21:57:23,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3115, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3402, PETRI_PLACES=163, PETRI_TRANSITIONS=278} [2024-06-03 21:57:23,220 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 117 predicate places. [2024-06-03 21:57:23,220 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 278 transitions, 3402 flow [2024-06-03 21:57:23,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:57:23,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:57:23,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:57:23,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 21:57:23,221 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:57:23,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:57:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2118280126, now seen corresponding path program 4 times [2024-06-03 21:57:23,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:57:23,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585103728] [2024-06-03 21:57:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:57:23,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:57:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:57:40,547 INFO 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:40,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:57:40,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585103728] [2024-06-03 21:57:40,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585103728] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:57:40,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:57:40,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:57:40,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651365640] [2024-06-03 21:57:40,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:57:40,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:57:40,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:57:40,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:57:40,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:57:40,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:57:40,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 278 transitions, 3402 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:57:40,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:57:40,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:57:40,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:57:43,077 INFO L124 PetriNetUnfolderBase]: 2778/4388 cut-off events. [2024-06-03 21:57:43,078 INFO L125 PetriNetUnfolderBase]: For 234892/234899 co-relation queries the response was YES. [2024-06-03 21:57:43,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32502 conditions, 4388 events. 2778/4388 cut-off events. For 234892/234899 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 24113 event pairs, 521 based on Foata normal form. 8/4392 useless extension candidates. Maximal degree in co-relation 32425. Up to 3544 conditions per place. [2024-06-03 21:57:43,114 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 188 selfloop transitions, 117 changer transitions 0/312 dead transitions. [2024-06-03 21:57:43,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 312 transitions, 4312 flow [2024-06-03 21:57:43,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:57:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:57:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2024-06-03 21:57:43,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-03 21:57:43,117 INFO L175 Difference]: Start difference. First operand has 163 places, 278 transitions, 3402 flow. Second operand 8 states and 174 transitions. [2024-06-03 21:57:43,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 312 transitions, 4312 flow [2024-06-03 21:57:43,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 312 transitions, 4167 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-03 21:57:43,271 INFO L231 Difference]: Finished difference. Result has 167 places, 280 transitions, 3540 flow [2024-06-03 21:57:43,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3265, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3540, PETRI_PLACES=167, PETRI_TRANSITIONS=280} [2024-06-03 21:57:43,272 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 121 predicate places. [2024-06-03 21:57:43,272 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 280 transitions, 3540 flow [2024-06-03 21:57:43,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:57:43,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:57:43,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:57:43,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 21:57:43,272 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:57:43,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:57:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash 2123790376, now seen corresponding path program 5 times [2024-06-03 21:57:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:57:43,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049039012] [2024-06-03 21:57:43,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:57:43,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:57:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:58:00,734 INFO 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:00,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:58:00,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049039012] [2024-06-03 21:58:00,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049039012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:58:00,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:58:00,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:58:00,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638746764] [2024-06-03 21:58:00,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:58:00,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:58:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:58:00,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:58:00,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:58:00,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:58:00,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 280 transitions, 3540 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:58:00,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:58:00,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:58:00,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:58:03,323 INFO L124 PetriNetUnfolderBase]: 2795/4404 cut-off events. [2024-06-03 21:58:03,323 INFO L125 PetriNetUnfolderBase]: For 246663/246668 co-relation queries the response was YES. [2024-06-03 21:58:03,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33241 conditions, 4404 events. 2795/4404 cut-off events. For 246663/246668 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 24191 event pairs, 685 based on Foata normal form. 4/4404 useless extension candidates. Maximal degree in co-relation 33162. Up to 3704 conditions per place. [2024-06-03 21:58:03,360 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 200 selfloop transitions, 102 changer transitions 0/309 dead transitions. [2024-06-03 21:58:03,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 309 transitions, 4276 flow [2024-06-03 21:58:03,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:58:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:58:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2024-06-03 21:58:03,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2024-06-03 21:58:03,363 INFO L175 Difference]: Start difference. First operand has 167 places, 280 transitions, 3540 flow. Second operand 8 states and 166 transitions. [2024-06-03 21:58:03,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 309 transitions, 4276 flow [2024-06-03 21:58:03,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 309 transitions, 4001 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 21:58:03,541 INFO L231 Difference]: Finished difference. Result has 169 places, 282 transitions, 3521 flow [2024-06-03 21:58:03,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3269, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3521, PETRI_PLACES=169, PETRI_TRANSITIONS=282} [2024-06-03 21:58:03,541 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 123 predicate places. [2024-06-03 21:58:03,541 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 282 transitions, 3521 flow [2024-06-03 21:58:03,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:58:03,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:58:03,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:58:03,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 21:58:03,542 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:03,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:58:03,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2118283846, now seen corresponding path program 6 times [2024-06-03 21:58:03,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:58:03,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481308841] [2024-06-03 21:58:03,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:58:03,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:58:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:58:19,775 INFO 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:19,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:58:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481308841] [2024-06-03 21:58:19,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481308841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:58:19,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:58:19,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:58:19,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870032019] [2024-06-03 21:58:19,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:58:19,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:58:19,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:58:19,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:58:19,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:58:19,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:58:19,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 282 transitions, 3521 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:58:19,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:58:19,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:58:19,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:58:22,361 INFO L124 PetriNetUnfolderBase]: 2812/4437 cut-off events. [2024-06-03 21:58:22,362 INFO L125 PetriNetUnfolderBase]: For 257226/257233 co-relation queries the response was YES. [2024-06-03 21:58:22,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33539 conditions, 4437 events. 2812/4437 cut-off events. For 257226/257233 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 24476 event pairs, 685 based on Foata normal form. 8/4441 useless extension candidates. Maximal degree in co-relation 33459. Up to 3731 conditions per place. [2024-06-03 21:58:22,402 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 192 selfloop transitions, 115 changer transitions 0/314 dead transitions. [2024-06-03 21:58:22,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 314 transitions, 4289 flow [2024-06-03 21:58:22,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:58:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:58:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2024-06-03 21:58:22,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-03 21:58:22,405 INFO L175 Difference]: Start difference. First operand has 169 places, 282 transitions, 3521 flow. Second operand 8 states and 170 transitions. [2024-06-03 21:58:22,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 314 transitions, 4289 flow [2024-06-03 21:58:22,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 314 transitions, 4065 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 21:58:22,588 INFO L231 Difference]: Finished difference. Result has 171 places, 284 transitions, 3579 flow [2024-06-03 21:58:22,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3297, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3579, PETRI_PLACES=171, PETRI_TRANSITIONS=284} [2024-06-03 21:58:22,588 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 125 predicate places. [2024-06-03 21:58:22,589 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 284 transitions, 3579 flow [2024-06-03 21:58:22,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:58:22,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:58:22,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:58:22,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 21:58:22,589 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:58:22,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:58:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash 528433295, now seen corresponding path program 1 times [2024-06-03 21:58:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:58:22,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929070195] [2024-06-03 21:58:22,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:58:22,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:58:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:58:38,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:58:38,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:58:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929070195] [2024-06-03 21:58:38,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929070195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:58:38,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:58:38,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:58:38,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077718437] [2024-06-03 21:58:38,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:58:38,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:58:38,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:58:38,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:58:38,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:58:38,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:58:38,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 284 transitions, 3579 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:38,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:58:38,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:58:38,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:58:40,201 INFO L124 PetriNetUnfolderBase]: 2679/4304 cut-off events. [2024-06-03 21:58:40,201 INFO L125 PetriNetUnfolderBase]: For 267309/267317 co-relation queries the response was YES. [2024-06-03 21:58:40,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32963 conditions, 4304 events. 2679/4304 cut-off events. For 267309/267317 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 24403 event pairs, 672 based on Foata normal form. 9/4306 useless extension candidates. Maximal degree in co-relation 32882. Up to 3608 conditions per place. [2024-06-03 21:58:40,243 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 217 selfloop transitions, 58 changer transitions 0/310 dead transitions. [2024-06-03 21:58:40,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 310 transitions, 4275 flow [2024-06-03 21:58:40,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:58:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:58:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-03 21:58:40,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-03 21:58:40,244 INFO L175 Difference]: Start difference. First operand has 171 places, 284 transitions, 3579 flow. Second operand 7 states and 152 transitions. [2024-06-03 21:58:40,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 310 transitions, 4275 flow [2024-06-03 21:58:40,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 310 transitions, 4021 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-03 21:58:40,443 INFO L231 Difference]: Finished difference. Result has 172 places, 288 transitions, 3514 flow [2024-06-03 21:58:40,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3325, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3514, PETRI_PLACES=172, PETRI_TRANSITIONS=288} [2024-06-03 21:58:40,443 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 126 predicate places. [2024-06-03 21:58:40,443 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 288 transitions, 3514 flow [2024-06-03 21:58:40,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:40,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:58:40,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:58:40,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 21:58:40,444 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:58:40,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:58:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash 528791779, now seen corresponding path program 1 times [2024-06-03 21:58:40,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:58:40,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330359202] [2024-06-03 21:58:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:58:40,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:58:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:58:57,256 INFO 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:57,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:58:57,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330359202] [2024-06-03 21:58:57,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330359202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:58:57,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:58:57,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:58:57,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393113092] [2024-06-03 21:58:57,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:58:57,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:58:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:58:57,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:58:57,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:58:57,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:58:57,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 288 transitions, 3514 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:58:57,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:58:57,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:58:57,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:58:59,498 INFO L124 PetriNetUnfolderBase]: 2826/4440 cut-off events. [2024-06-03 21:58:59,499 INFO L125 PetriNetUnfolderBase]: For 277684/277700 co-relation queries the response was YES. [2024-06-03 21:58:59,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34097 conditions, 4440 events. 2826/4440 cut-off events. For 277684/277700 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 24490 event pairs, 756 based on Foata normal form. 15/4427 useless extension candidates. Maximal degree in co-relation 34015. Up to 4021 conditions per place. [2024-06-03 21:58:59,535 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 252 selfloop transitions, 22 changer transitions 0/307 dead transitions. [2024-06-03 21:58:59,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 307 transitions, 4170 flow [2024-06-03 21:58:59,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:58:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:58:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-03 21:58:59,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 21:58:59,536 INFO L175 Difference]: Start difference. First operand has 172 places, 288 transitions, 3514 flow. Second operand 7 states and 135 transitions. [2024-06-03 21:58:59,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 307 transitions, 4170 flow [2024-06-03 21:58:59,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 307 transitions, 4017 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-03 21:58:59,732 INFO L231 Difference]: Finished difference. Result has 174 places, 291 transitions, 3459 flow [2024-06-03 21:58:59,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3361, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3459, PETRI_PLACES=174, PETRI_TRANSITIONS=291} [2024-06-03 21:58:59,733 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 128 predicate places. [2024-06-03 21:58:59,733 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 291 transitions, 3459 flow [2024-06-03 21:58:59,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:58:59,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:58:59,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:58:59,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 21:58:59,734 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:58:59,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:58:59,734 INFO L85 PathProgramCache]: Analyzing trace with hash 528791345, now seen corresponding path program 2 times [2024-06-03 21:58:59,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:58:59,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513209159] [2024-06-03 21:58:59,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:58:59,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:58:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:59:15,455 INFO 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:15,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:59:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513209159] [2024-06-03 21:59:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513209159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:59:15,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:59:15,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:59:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378671206] [2024-06-03 21:59:15,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:59:15,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:59:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:59:15,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:59:15,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:59:15,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-03 21:59:15,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 291 transitions, 3459 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:15,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:59:15,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-03 21:59:15,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:59:17,677 INFO L124 PetriNetUnfolderBase]: 2729/4368 cut-off events. [2024-06-03 21:59:17,677 INFO L125 PetriNetUnfolderBase]: For 291323/291329 co-relation queries the response was YES. [2024-06-03 21:59:17,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34368 conditions, 4368 events. 2729/4368 cut-off events. For 291323/291329 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24637 event pairs, 689 based on Foata normal form. 5/4366 useless extension candidates. Maximal degree in co-relation 34285. Up to 3624 conditions per place. [2024-06-03 21:59:17,717 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 227 selfloop transitions, 52 changer transitions 0/315 dead transitions. [2024-06-03 21:59:17,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 315 transitions, 4281 flow [2024-06-03 21:59:17,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:59:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:59:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-03 21:59:17,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46984126984126984 [2024-06-03 21:59:17,718 INFO L175 Difference]: Start difference. First operand has 174 places, 291 transitions, 3459 flow. Second operand 7 states and 148 transitions. [2024-06-03 21:59:17,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 315 transitions, 4281 flow [2024-06-03 21:59:17,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 315 transitions, 4205 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 21:59:17,919 INFO L231 Difference]: Finished difference. Result has 177 places, 299 transitions, 3651 flow [2024-06-03 21:59:17,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3383, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3651, PETRI_PLACES=177, PETRI_TRANSITIONS=299} [2024-06-03 21:59:17,919 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 131 predicate places. [2024-06-03 21:59:17,919 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 299 transitions, 3651 flow [2024-06-03 21:59:17,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:17,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:59:17,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:59:17,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 21:59:17,920 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:17,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:59:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash 180622188, now seen corresponding path program 7 times [2024-06-03 21:59:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:59:17,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628586617] [2024-06-03 21:59:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:59:17,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:59:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:59:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:59:34,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:59:34,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628586617] [2024-06-03 21:59:34,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628586617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:59:34,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:59:34,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:59:34,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075863023] [2024-06-03 21:59:34,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:59:34,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:59:34,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:59:34,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:59:34,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:59:34,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:59:34,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 299 transitions, 3651 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:59:34,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:59:34,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:59:34,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:59:36,543 INFO L124 PetriNetUnfolderBase]: 2863/4502 cut-off events. [2024-06-03 21:59:36,543 INFO L125 PetriNetUnfolderBase]: For 305625/305630 co-relation queries the response was YES. [2024-06-03 21:59:36,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36051 conditions, 4502 events. 2863/4502 cut-off events. For 305625/305630 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24799 event pairs, 710 based on Foata normal form. 6/4488 useless extension candidates. Maximal degree in co-relation 35966. Up to 3798 conditions per place. [2024-06-03 21:59:36,583 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 219 selfloop transitions, 96 changer transitions 0/323 dead transitions. [2024-06-03 21:59:36,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 323 transitions, 4371 flow [2024-06-03 21:59:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:59:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:59:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-03 21:59:36,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 21:59:36,586 INFO L175 Difference]: Start difference. First operand has 177 places, 299 transitions, 3651 flow. Second operand 8 states and 162 transitions. [2024-06-03 21:59:36,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 323 transitions, 4371 flow [2024-06-03 21:59:36,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 323 transitions, 4238 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-03 21:59:36,873 INFO L231 Difference]: Finished difference. Result has 182 places, 299 transitions, 3719 flow [2024-06-03 21:59:36,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3518, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3719, PETRI_PLACES=182, PETRI_TRANSITIONS=299} [2024-06-03 21:59:36,874 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 136 predicate places. [2024-06-03 21:59:36,874 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 299 transitions, 3719 flow [2024-06-03 21:59:36,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:59:36,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:59:36,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:59:36,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 21:59:36,874 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 21:59:36,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:59:36,874 INFO L85 PathProgramCache]: Analyzing trace with hash 573702099, now seen corresponding path program 2 times [2024-06-03 21:59:36,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:59:36,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963417518] [2024-06-03 21:59:36,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:59:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:59:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:59:52,500 INFO 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:52,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:59:52,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963417518] [2024-06-03 21:59:52,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963417518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:59:52,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:59:52,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:59:52,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005282773] [2024-06-03 21:59:52,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:59:52,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:59:52,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:59:52,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:59:52,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:59:52,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-03 21:59:52,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 299 transitions, 3719 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:59:52,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:59:52,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-03 21:59:52,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:59:54,566 INFO L124 PetriNetUnfolderBase]: 2842/4478 cut-off events. [2024-06-03 21:59:54,566 INFO L125 PetriNetUnfolderBase]: For 314402/314421 co-relation queries the response was YES. [2024-06-03 21:59:54,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36170 conditions, 4478 events. 2842/4478 cut-off events. For 314402/314421 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 24882 event pairs, 734 based on Foata normal form. 15/4470 useless extension candidates. Maximal degree in co-relation 36083. Up to 4034 conditions per place. [2024-06-03 21:59:54,610 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 250 selfloop transitions, 34 changer transitions 0/317 dead transitions. [2024-06-03 21:59:54,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 317 transitions, 4537 flow [2024-06-03 21:59:54,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:59:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:59:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-03 21:59:54,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-03 21:59:54,612 INFO L175 Difference]: Start difference. First operand has 182 places, 299 transitions, 3719 flow. Second operand 7 states and 133 transitions. [2024-06-03 21:59:54,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 317 transitions, 4537 flow [2024-06-03 21:59:54,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 317 transitions, 4314 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 21:59:54,849 INFO L231 Difference]: Finished difference. Result has 182 places, 305 transitions, 3680 flow [2024-06-03 21:59:54,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3496, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3680, PETRI_PLACES=182, PETRI_TRANSITIONS=305} [2024-06-03 21:59:54,850 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 136 predicate places. [2024-06-03 21:59:54,850 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 305 transitions, 3680 flow [2024-06-03 21:59:54,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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:59:54,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:59:54,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:59:54,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 21:59:54,850 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 21:59:54,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:59:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash 575605453, now seen corresponding path program 3 times [2024-06-03 21:59:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:59:54,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538973759] [2024-06-03 21:59:54,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:59:54,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:59:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15