./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix003.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix003.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 11:11:53,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:11:53,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:11:53,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:11:53,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:11:53,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:11:53,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:11:53,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:11:53,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:11:53,914 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:11:53,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:11:53,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:11:53,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:11:53,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:11:53,917 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:11:53,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:11:53,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:11:53,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:11:53,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:11:53,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:11:53,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:11:53,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:11:53,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:11:53,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:11:53,920 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:11:53,920 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:11:53,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:11:53,921 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:11:53,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:11:53,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:11:53,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:11:53,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:11:53,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:11:53,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:11:53,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:11:53,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:11:53,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:11:53,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:11:53,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:11:53,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:11:53,925 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:11:53,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:11:53,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:11:53,926 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 11:11:54,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:11:54,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:11:54,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:11:54,197 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:11:54,197 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:11:54,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/mix003.oepc.yml/witness.yml [2024-05-12 11:11:54,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:11:54,460 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:11:54,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2024-05-12 11:11:55,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:11:55,845 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:11:55,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2024-05-12 11:11:55,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320c7a9eb/15400e04323d4a2bac94adbe2913842f/FLAG99af774a0 [2024-05-12 11:11:55,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320c7a9eb/15400e04323d4a2bac94adbe2913842f [2024-05-12 11:11:55,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:11:55,876 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:11:55,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:11:55,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:11:55,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:11:55,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:11:54" (1/2) ... [2024-05-12 11:11:55,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33fdc7b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:11:55, skipping insertion in model container [2024-05-12 11:11:55,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:11:54" (1/2) ... [2024-05-12 11:11:55,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5ee736de and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:11:55, skipping insertion in model container [2024-05-12 11:11:55,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:11:55" (2/2) ... [2024-05-12 11:11:55,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33fdc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:55, skipping insertion in model container [2024-05-12 11:11:55,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:11:55" (2/2) ... [2024-05-12 11:11:55,886 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:11:56,048 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:11:56,049 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0) [2024-05-12 11:11:56,050 INFO L97 edCorrectnessWitness]: Location invariant before [L850-L850] (((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0) [2024-05-12 11:11:56,051 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] (((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0) [2024-05-12 11:11:56,051 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:11:56,052 INFO L106 edCorrectnessWitness]: ghost_update [L846-L846] multithreaded = 1; [2024-05-12 11:11:56,100 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:11:56,247 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i[945,958] [2024-05-12 11:11:56,408 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:11:56,422 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:11:56,464 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:11:56,973 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:11:57,016 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:11:57,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57 WrapperNode [2024-05-12 11:11:57,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:11:57,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:11:57,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:11:57,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:11:57,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (1/1) ... [2024-05-12 11:11:57,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (1/1) ... [2024-05-12 11:11:57,226 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2024-05-12 11:11:57,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:11:57,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:11:57,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:11:57,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:11:57,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (1/1) ... [2024-05-12 11:11:57,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (1/1) ... [2024-05-12 11:11:57,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (1/1) ... [2024-05-12 11:11:57,321 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-05-12 11:11:57,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (1/1) ... [2024-05-12 11:11:57,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (1/1) ... [2024-05-12 11:11:57,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (1/1) ... [2024-05-12 11:11:57,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (1/1) ... [2024-05-12 11:11:57,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (1/1) ... [2024-05-12 11:11:57,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (1/1) ... [2024-05-12 11:11:57,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:11:57,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:11:57,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:11:57,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:11:57,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (1/1) ... [2024-05-12 11:11:57,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:11:57,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:11:57,521 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-05-12 11:11:57,546 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-05-12 11:11:57,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:11:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:11:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:11:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 11:11:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:11:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:11:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:11:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:11:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:11:57,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:11:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:11:57,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:11:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 11:11:57,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 11:11:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:11:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:11:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:11:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 11:11:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:11:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:11:57,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:11:57,610 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 11:11:57,738 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:11:57,740 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:11:59,499 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:11:59,499 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:11:59,920 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:11:59,921 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:11:59,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:11:59 BoogieIcfgContainer [2024-05-12 11:11:59,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:11:59,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:11:59,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:11:59,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:11:59,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:11:54" (1/4) ... [2024-05-12 11:11:59,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e91ab7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:11:59, skipping insertion in model container [2024-05-12 11:11:59,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:11:55" (2/4) ... [2024-05-12 11:11:59,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e91ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:11:59, skipping insertion in model container [2024-05-12 11:11:59,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:11:57" (3/4) ... [2024-05-12 11:11:59,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e91ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:11:59, skipping insertion in model container [2024-05-12 11:11:59,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:11:59" (4/4) ... [2024-05-12 11:11:59,931 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2024-05-12 11:11:59,947 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:11:59,948 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 11:11:59,948 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:12:00,115 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:12:00,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 110 flow [2024-05-12 11:12:00,227 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-05-12 11:12:00,227 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:12:00,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-05-12 11:12:00,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 49 transitions, 110 flow [2024-05-12 11:12:00,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 46 transitions, 101 flow [2024-05-12 11:12:00,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:12:00,263 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;@235de531, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:12:00,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 11:12:00,275 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:12:00,276 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:12:00,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:12:00,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:00,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:12:00,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:12:00,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:00,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1944967507, now seen corresponding path program 1 times [2024-05-12 11:12:00,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:00,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726652501] [2024-05-12 11:12:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:12:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:12:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:12:10,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726652501] [2024-05-12 11:12:10,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726652501] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:12:10,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:12:10,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:12:10,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608013286] [2024-05-12 11:12:10,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:12:10,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:12:10,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:12:10,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:12:10,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:12:10,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-05-12 11:12:10,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:10,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:12:10,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-05-12 11:12:10,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:12:12,694 INFO L124 PetriNetUnfolderBase]: 3136/5250 cut-off events. [2024-05-12 11:12:12,694 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-05-12 11:12:12,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9869 conditions, 5250 events. 3136/5250 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 34280 event pairs, 2366 based on Foata normal form. 151/4933 useless extension candidates. Maximal degree in co-relation 9854. Up to 4526 conditions per place. [2024-05-12 11:12:12,738 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 42 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2024-05-12 11:12:12,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 229 flow [2024-05-12 11:12:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:12:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:12:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-05-12 11:12:12,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6802721088435374 [2024-05-12 11:12:12,752 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 101 flow. Second operand 3 states and 100 transitions. [2024-05-12 11:12:12,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 229 flow [2024-05-12 11:12:12,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 11:12:12,761 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 133 flow [2024-05-12 11:12:12,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-05-12 11:12:12,766 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2024-05-12 11:12:12,767 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 133 flow [2024-05-12 11:12:12,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:12,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:12,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:12:12,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:12:12,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:12:12,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:12,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1944966247, now seen corresponding path program 1 times [2024-05-12 11:12:12,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:12,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139504282] [2024-05-12 11:12:12,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:12,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:12:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:12:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:12:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139504282] [2024-05-12 11:12:12,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139504282] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:12:12,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:12:12,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:12:12,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256819206] [2024-05-12 11:12:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:12:12,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:12:12,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:12:12,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:12:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:12:12,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2024-05-12 11:12:12,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:12,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:12:12,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2024-05-12 11:12:12,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:12:13,459 INFO L124 PetriNetUnfolderBase]: 996/1923 cut-off events. [2024-05-12 11:12:13,459 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-05-12 11:12:13,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3689 conditions, 1923 events. 996/1923 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12991 event pairs, 655 based on Foata normal form. 0/1774 useless extension candidates. Maximal degree in co-relation 3674. Up to 1277 conditions per place. [2024-05-12 11:12:13,473 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 37 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2024-05-12 11:12:13,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 240 flow [2024-05-12 11:12:13,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:12:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:12:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-05-12 11:12:13,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2024-05-12 11:12:13,476 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 133 flow. Second operand 3 states and 112 transitions. [2024-05-12 11:12:13,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 240 flow [2024-05-12 11:12:13,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:12:13,478 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 126 flow [2024-05-12 11:12:13,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-05-12 11:12:13,479 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2024-05-12 11:12:13,479 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 126 flow [2024-05-12 11:12:13,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:13,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:13,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:12:13,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:12:13,480 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:12:13,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash -802970581, now seen corresponding path program 1 times [2024-05-12 11:12:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:13,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303065962] [2024-05-12 11:12:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:13,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:12:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:12:20,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:12:20,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303065962] [2024-05-12 11:12:20,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303065962] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:12:20,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:12:20,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:12:20,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098668295] [2024-05-12 11:12:20,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:12:20,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:12:20,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:12:20,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:12:20,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:12:20,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-05-12 11:12:20,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:20,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:12:20,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-05-12 11:12:20,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:12:22,370 INFO L124 PetriNetUnfolderBase]: 2578/4297 cut-off events. [2024-05-12 11:12:22,370 INFO L125 PetriNetUnfolderBase]: For 1104/1104 co-relation queries the response was YES. [2024-05-12 11:12:22,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9154 conditions, 4297 events. 2578/4297 cut-off events. For 1104/1104 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 26938 event pairs, 1548 based on Foata normal form. 3/4138 useless extension candidates. Maximal degree in co-relation 9138. Up to 3717 conditions per place. [2024-05-12 11:12:22,453 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 50 selfloop transitions, 8 changer transitions 2/73 dead transitions. [2024-05-12 11:12:22,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 318 flow [2024-05-12 11:12:22,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:12:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:12:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-05-12 11:12:22,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2024-05-12 11:12:22,459 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 126 flow. Second operand 4 states and 124 transitions. [2024-05-12 11:12:22,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 318 flow [2024-05-12 11:12:22,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:12:22,463 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 187 flow [2024-05-12 11:12:22,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-05-12 11:12:22,464 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2024-05-12 11:12:22,464 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 187 flow [2024-05-12 11:12:22,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:22,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:22,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:12:22,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:12:22,466 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:12:22,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:22,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1439417770, now seen corresponding path program 1 times [2024-05-12 11:12:22,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:22,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972647350] [2024-05-12 11:12:22,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:22,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:12:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:12:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:12:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972647350] [2024-05-12 11:12:30,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972647350] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:12:30,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:12:30,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:12:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026125662] [2024-05-12 11:12:30,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:12:30,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:12:30,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:12:30,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:12:30,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:12:31,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-05-12 11:12:31,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:31,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:12:31,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-05-12 11:12:31,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:12:32,697 INFO L124 PetriNetUnfolderBase]: 2687/4604 cut-off events. [2024-05-12 11:12:32,698 INFO L125 PetriNetUnfolderBase]: For 2043/2043 co-relation queries the response was YES. [2024-05-12 11:12:32,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10483 conditions, 4604 events. 2687/4604 cut-off events. For 2043/2043 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 29622 event pairs, 1480 based on Foata normal form. 3/4445 useless extension candidates. Maximal degree in co-relation 10465. Up to 3824 conditions per place. [2024-05-12 11:12:32,727 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 70 selfloop transitions, 21 changer transitions 0/103 dead transitions. [2024-05-12 11:12:32,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 527 flow [2024-05-12 11:12:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:12:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:12:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2024-05-12 11:12:32,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5986394557823129 [2024-05-12 11:12:32,729 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 187 flow. Second operand 6 states and 176 transitions. [2024-05-12 11:12:32,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 527 flow [2024-05-12 11:12:32,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 510 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-05-12 11:12:32,735 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 305 flow [2024-05-12 11:12:32,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2024-05-12 11:12:32,736 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2024-05-12 11:12:32,736 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 305 flow [2024-05-12 11:12:32,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:32,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:32,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:12:32,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:12:32,737 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:12:32,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:32,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1672278997, now seen corresponding path program 1 times [2024-05-12 11:12:32,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:32,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088476805] [2024-05-12 11:12:32,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:32,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:12:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:12:39,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:12:39,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088476805] [2024-05-12 11:12:39,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088476805] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:12:39,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:12:39,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:12:39,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847579411] [2024-05-12 11:12:39,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:12:39,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:12:39,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:12:39,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:12:39,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:12:39,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-05-12 11:12:39,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:39,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:12:39,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-05-12 11:12:39,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:12:41,290 INFO L124 PetriNetUnfolderBase]: 2678/4577 cut-off events. [2024-05-12 11:12:41,291 INFO L125 PetriNetUnfolderBase]: For 4303/4303 co-relation queries the response was YES. [2024-05-12 11:12:41,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11658 conditions, 4577 events. 2678/4577 cut-off events. For 4303/4303 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 29453 event pairs, 1206 based on Foata normal form. 6/4421 useless extension candidates. Maximal degree in co-relation 11636. Up to 3767 conditions per place. [2024-05-12 11:12:41,318 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 77 selfloop transitions, 23 changer transitions 0/112 dead transitions. [2024-05-12 11:12:41,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 112 transitions, 633 flow [2024-05-12 11:12:41,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:12:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:12:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2024-05-12 11:12:41,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5830903790087464 [2024-05-12 11:12:41,320 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 305 flow. Second operand 7 states and 200 transitions. [2024-05-12 11:12:41,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 112 transitions, 633 flow [2024-05-12 11:12:41,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 112 transitions, 610 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-05-12 11:12:41,326 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 347 flow [2024-05-12 11:12:41,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=347, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2024-05-12 11:12:41,327 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2024-05-12 11:12:41,327 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 347 flow [2024-05-12 11:12:41,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:41,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:41,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:12:41,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:12:41,328 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:12:41,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:41,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1174831858, now seen corresponding path program 1 times [2024-05-12 11:12:41,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:41,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834337120] [2024-05-12 11:12:41,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:41,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:12:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:12:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:12:54,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834337120] [2024-05-12 11:12:54,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834337120] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:12:54,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:12:54,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:12:54,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965350591] [2024-05-12 11:12:54,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:12:54,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:12:54,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:12:54,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:12:54,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:12:54,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:12:54,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 347 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-05-12 11:12:54,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:12:54,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:12:54,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:12:57,040 INFO L124 PetriNetUnfolderBase]: 3797/6350 cut-off events. [2024-05-12 11:12:57,040 INFO L125 PetriNetUnfolderBase]: For 7825/7825 co-relation queries the response was YES. [2024-05-12 11:12:57,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16680 conditions, 6350 events. 3797/6350 cut-off events. For 7825/7825 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 41076 event pairs, 1709 based on Foata normal form. 2/6169 useless extension candidates. Maximal degree in co-relation 16656. Up to 5433 conditions per place. [2024-05-12 11:12:57,075 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 65 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2024-05-12 11:12:57,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 86 transitions, 559 flow [2024-05-12 11:12:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:12:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:12:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-05-12 11:12:57,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-05-12 11:12:57,077 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 347 flow. Second operand 5 states and 124 transitions. [2024-05-12 11:12:57,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 86 transitions, 559 flow [2024-05-12 11:12:57,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 86 transitions, 504 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 11:12:57,084 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 345 flow [2024-05-12 11:12:57,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=345, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2024-05-12 11:12:57,088 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2024-05-12 11:12:57,088 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 345 flow [2024-05-12 11:12:57,088 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-05-12 11:12:57,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:57,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:12:57,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:12:57,089 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:12:57,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:57,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2060050351, now seen corresponding path program 1 times [2024-05-12 11:12:57,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:57,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379010870] [2024-05-12 11:12:57,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:57,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:13:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:13:12,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:13:12,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379010870] [2024-05-12 11:13:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379010870] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:13:12,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:13:12,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:13:12,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720348799] [2024-05-12 11:13:12,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:13:12,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:13:12,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:13:12,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:13:12,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:13:12,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:13:12,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 345 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:12,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:13:12,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:13:12,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:13:14,657 INFO L124 PetriNetUnfolderBase]: 3787/6331 cut-off events. [2024-05-12 11:13:14,657 INFO L125 PetriNetUnfolderBase]: For 10221/10221 co-relation queries the response was YES. [2024-05-12 11:13:14,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17418 conditions, 6331 events. 3787/6331 cut-off events. For 10221/10221 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 40934 event pairs, 1625 based on Foata normal form. 4/6154 useless extension candidates. Maximal degree in co-relation 17392. Up to 5385 conditions per place. [2024-05-12 11:13:14,691 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 74 selfloop transitions, 14 changer transitions 0/98 dead transitions. [2024-05-12 11:13:14,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 98 transitions, 607 flow [2024-05-12 11:13:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:13:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:13:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-05-12 11:13:14,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068027210884354 [2024-05-12 11:13:14,693 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 345 flow. Second operand 6 states and 149 transitions. [2024-05-12 11:13:14,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 98 transitions, 607 flow [2024-05-12 11:13:14,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 98 transitions, 580 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 11:13:14,700 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 380 flow [2024-05-12 11:13:14,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-05-12 11:13:14,701 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2024-05-12 11:13:14,701 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 380 flow [2024-05-12 11:13:14,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:14,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:13:14,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:13:14,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:13:14,702 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:13:14,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:13:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash -569592784, now seen corresponding path program 1 times [2024-05-12 11:13:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:13:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691075271] [2024-05-12 11:13:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:13:14,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:13:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:13:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:13:26,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:13:26,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691075271] [2024-05-12 11:13:26,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691075271] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:13:26,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:13:26,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:13:26,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138119575] [2024-05-12 11:13:26,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:13:26,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:13:26,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:13:26,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:13:26,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:13:26,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:13:26,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:26,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:13:26,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:13:26,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:13:28,808 INFO L124 PetriNetUnfolderBase]: 3815/6314 cut-off events. [2024-05-12 11:13:28,808 INFO L125 PetriNetUnfolderBase]: For 12878/12884 co-relation queries the response was YES. [2024-05-12 11:13:28,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18488 conditions, 6314 events. 3815/6314 cut-off events. For 12878/12884 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 40075 event pairs, 1455 based on Foata normal form. 6/6136 useless extension candidates. Maximal degree in co-relation 18461. Up to 5409 conditions per place. [2024-05-12 11:13:28,839 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 84 selfloop transitions, 18 changer transitions 0/112 dead transitions. [2024-05-12 11:13:28,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 112 transitions, 755 flow [2024-05-12 11:13:28,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:13:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:13:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-05-12 11:13:28,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-05-12 11:13:28,842 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 380 flow. Second operand 6 states and 154 transitions. [2024-05-12 11:13:28,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 112 transitions, 755 flow [2024-05-12 11:13:28,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 112 transitions, 712 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-05-12 11:13:28,853 INFO L231 Difference]: Finished difference. Result has 76 places, 82 transitions, 486 flow [2024-05-12 11:13:28,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=76, PETRI_TRANSITIONS=82} [2024-05-12 11:13:28,856 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 21 predicate places. [2024-05-12 11:13:28,856 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 82 transitions, 486 flow [2024-05-12 11:13:28,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:28,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:13:28,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:13:28,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:13:28,857 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:13:28,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:13:28,857 INFO L85 PathProgramCache]: Analyzing trace with hash 124322066, now seen corresponding path program 2 times [2024-05-12 11:13:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:13:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018310285] [2024-05-12 11:13:28,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:13:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:13:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:13:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:13:40,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:13:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018310285] [2024-05-12 11:13:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018310285] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:13:40,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:13:40,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:13:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458470776] [2024-05-12 11:13:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:13:40,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:13:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:13:40,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:13:40,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:13:40,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:13:40,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 82 transitions, 486 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:40,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:13:40,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:13:40,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:13:42,962 INFO L124 PetriNetUnfolderBase]: 3810/6422 cut-off events. [2024-05-12 11:13:42,962 INFO L125 PetriNetUnfolderBase]: For 16600/16600 co-relation queries the response was YES. [2024-05-12 11:13:42,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19762 conditions, 6422 events. 3810/6422 cut-off events. For 16600/16600 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 41913 event pairs, 1633 based on Foata normal form. 2/6240 useless extension candidates. Maximal degree in co-relation 19732. Up to 5442 conditions per place. [2024-05-12 11:13:42,999 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 82 selfloop transitions, 13 changer transitions 0/105 dead transitions. [2024-05-12 11:13:43,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 105 transitions, 734 flow [2024-05-12 11:13:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:13:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:13:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-05-12 11:13:43,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965986394557823 [2024-05-12 11:13:43,003 INFO L175 Difference]: Start difference. First operand has 76 places, 82 transitions, 486 flow. Second operand 6 states and 146 transitions. [2024-05-12 11:13:43,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 105 transitions, 734 flow [2024-05-12 11:13:43,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 105 transitions, 706 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-05-12 11:13:43,018 INFO L231 Difference]: Finished difference. Result has 81 places, 82 transitions, 492 flow [2024-05-12 11:13:43,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=492, PETRI_PLACES=81, PETRI_TRANSITIONS=82} [2024-05-12 11:13:43,020 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 26 predicate places. [2024-05-12 11:13:43,020 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 492 flow [2024-05-12 11:13:43,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:43,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:13:43,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:13:43,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:13:43,021 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:13:43,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:13:43,022 INFO L85 PathProgramCache]: Analyzing trace with hash 134333719, now seen corresponding path program 1 times [2024-05-12 11:13:43,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:13:43,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211682695] [2024-05-12 11:13:43,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:13:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:13:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:13:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:13:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:13:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211682695] [2024-05-12 11:13:54,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211682695] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:13:54,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:13:54,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:13:54,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055635796] [2024-05-12 11:13:54,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:13:54,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:13:54,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:13:54,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:13:54,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:13:54,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:13:54,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 492 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:54,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:13:54,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:13:54,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:13:57,470 INFO L124 PetriNetUnfolderBase]: 3833/6336 cut-off events. [2024-05-12 11:13:57,470 INFO L125 PetriNetUnfolderBase]: For 18207/18207 co-relation queries the response was YES. [2024-05-12 11:13:57,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20027 conditions, 6336 events. 3833/6336 cut-off events. For 18207/18207 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 40228 event pairs, 1409 based on Foata normal form. 2/6155 useless extension candidates. Maximal degree in co-relation 19994. Up to 5441 conditions per place. [2024-05-12 11:13:57,502 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 99 selfloop transitions, 15 changer transitions 0/124 dead transitions. [2024-05-12 11:13:57,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 124 transitions, 852 flow [2024-05-12 11:13:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:13:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:13:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-05-12 11:13:57,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160349854227405 [2024-05-12 11:13:57,504 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 492 flow. Second operand 7 states and 177 transitions. [2024-05-12 11:13:57,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 124 transitions, 852 flow [2024-05-12 11:13:57,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 124 transitions, 819 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 11:13:57,516 INFO L231 Difference]: Finished difference. Result has 84 places, 85 transitions, 531 flow [2024-05-12 11:13:57,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=531, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2024-05-12 11:13:57,516 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 29 predicate places. [2024-05-12 11:13:57,517 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 531 flow [2024-05-12 11:13:57,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:57,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:13:57,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:13:57,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:13:57,518 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:13:57,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:13:57,518 INFO L85 PathProgramCache]: Analyzing trace with hash 134453875, now seen corresponding path program 1 times [2024-05-12 11:13:57,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:13:57,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536063422] [2024-05-12 11:13:57,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:13:57,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:13:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:14:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:14:09,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:14:09,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536063422] [2024-05-12 11:14:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536063422] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:14:09,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:14:09,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:14:09,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018665426] [2024-05-12 11:14:09,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:14:09,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:14:09,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:14:09,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:14:09,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:14:09,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:14:09,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 531 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:09,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:14:09,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:14:09,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:14:11,853 INFO L124 PetriNetUnfolderBase]: 3912/6454 cut-off events. [2024-05-12 11:14:11,853 INFO L125 PetriNetUnfolderBase]: For 23262/23271 co-relation queries the response was YES. [2024-05-12 11:14:11,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21523 conditions, 6454 events. 3912/6454 cut-off events. For 23262/23271 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 40914 event pairs, 1311 based on Foata normal form. 6/6273 useless extension candidates. Maximal degree in co-relation 21490. Up to 5452 conditions per place. [2024-05-12 11:14:11,881 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 99 selfloop transitions, 26 changer transitions 0/135 dead transitions. [2024-05-12 11:14:11,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 135 transitions, 993 flow [2024-05-12 11:14:11,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:14:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:14:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-05-12 11:14:11,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-05-12 11:14:11,883 INFO L175 Difference]: Start difference. First operand has 84 places, 85 transitions, 531 flow. Second operand 7 states and 182 transitions. [2024-05-12 11:14:11,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 135 transitions, 993 flow [2024-05-12 11:14:11,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 135 transitions, 939 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-05-12 11:14:11,898 INFO L231 Difference]: Finished difference. Result has 87 places, 95 transitions, 634 flow [2024-05-12 11:14:11,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=634, PETRI_PLACES=87, PETRI_TRANSITIONS=95} [2024-05-12 11:14:11,899 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2024-05-12 11:14:11,899 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 95 transitions, 634 flow [2024-05-12 11:14:11,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:11,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:14:11,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:14:11,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:14:11,900 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:14:11,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:14:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash 134453689, now seen corresponding path program 2 times [2024-05-12 11:14:11,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:14:11,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352436358] [2024-05-12 11:14:11,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:14:11,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:14:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:14:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:14:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:14:24,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352436358] [2024-05-12 11:14:24,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352436358] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:14:24,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:14:24,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:14:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012208765] [2024-05-12 11:14:24,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:14:24,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:14:24,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:14:24,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:14:24,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:14:24,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:14:24,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 95 transitions, 634 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:24,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:14:24,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:14:24,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:14:27,019 INFO L124 PetriNetUnfolderBase]: 3940/6505 cut-off events. [2024-05-12 11:14:27,019 INFO L125 PetriNetUnfolderBase]: For 28917/28923 co-relation queries the response was YES. [2024-05-12 11:14:27,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23307 conditions, 6505 events. 3940/6505 cut-off events. For 28917/28923 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 41153 event pairs, 1343 based on Foata normal form. 6/6324 useless extension candidates. Maximal degree in co-relation 23272. Up to 5509 conditions per place. [2024-05-12 11:14:27,048 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 101 selfloop transitions, 28 changer transitions 0/139 dead transitions. [2024-05-12 11:14:27,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 139 transitions, 1110 flow [2024-05-12 11:14:27,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:14:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:14:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-05-12 11:14:27,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247813411078717 [2024-05-12 11:14:27,050 INFO L175 Difference]: Start difference. First operand has 87 places, 95 transitions, 634 flow. Second operand 7 states and 180 transitions. [2024-05-12 11:14:27,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 139 transitions, 1110 flow [2024-05-12 11:14:27,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 139 transitions, 1082 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-05-12 11:14:27,070 INFO L231 Difference]: Finished difference. Result has 92 places, 101 transitions, 748 flow [2024-05-12 11:14:27,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=748, PETRI_PLACES=92, PETRI_TRANSITIONS=101} [2024-05-12 11:14:27,071 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 37 predicate places. [2024-05-12 11:14:27,071 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 101 transitions, 748 flow [2024-05-12 11:14:27,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:27,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:14:27,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:14:27,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:14:27,072 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:14:27,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:14:27,072 INFO L85 PathProgramCache]: Analyzing trace with hash -425788905, now seen corresponding path program 3 times [2024-05-12 11:14:27,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:14:27,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192453067] [2024-05-12 11:14:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:14:27,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:14:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:14:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:14:38,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:14:38,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192453067] [2024-05-12 11:14:38,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192453067] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:14:38,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:14:38,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:14:38,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314023853] [2024-05-12 11:14:38,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:14:38,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:14:38,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:14:38,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:14:38,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:14:38,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:14:38,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 101 transitions, 748 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:38,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:14:38,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:14:38,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:14:40,780 INFO L124 PetriNetUnfolderBase]: 3935/6619 cut-off events. [2024-05-12 11:14:40,780 INFO L125 PetriNetUnfolderBase]: For 34613/34613 co-relation queries the response was YES. [2024-05-12 11:14:40,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24346 conditions, 6619 events. 3935/6619 cut-off events. For 34613/34613 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 43171 event pairs, 1525 based on Foata normal form. 2/6432 useless extension candidates. Maximal degree in co-relation 24308. Up to 5599 conditions per place. [2024-05-12 11:14:40,817 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 106 selfloop transitions, 16 changer transitions 0/132 dead transitions. [2024-05-12 11:14:40,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 132 transitions, 1076 flow [2024-05-12 11:14:40,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:14:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:14:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-05-12 11:14:40,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956268221574344 [2024-05-12 11:14:40,818 INFO L175 Difference]: Start difference. First operand has 92 places, 101 transitions, 748 flow. Second operand 7 states and 170 transitions. [2024-05-12 11:14:40,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 132 transitions, 1076 flow [2024-05-12 11:14:40,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 132 transitions, 1012 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-05-12 11:14:40,847 INFO L231 Difference]: Finished difference. Result has 96 places, 101 transitions, 724 flow [2024-05-12 11:14:40,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=724, PETRI_PLACES=96, PETRI_TRANSITIONS=101} [2024-05-12 11:14:40,847 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 41 predicate places. [2024-05-12 11:14:40,847 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 101 transitions, 724 flow [2024-05-12 11:14:40,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:40,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:14:40,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:14:40,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:14:40,848 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:14:40,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:14:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash -271775119, now seen corresponding path program 2 times [2024-05-12 11:14:40,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:14:40,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783607773] [2024-05-12 11:14:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:14:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:14:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:14:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:14:52,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:14:52,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783607773] [2024-05-12 11:14:52,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783607773] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:14:52,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:14:52,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:14:52,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488070463] [2024-05-12 11:14:52,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:14:52,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:14:52,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:14:52,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:14:52,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:14:52,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:14:52,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 101 transitions, 724 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:52,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:14:52,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:14:52,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:14:55,073 INFO L124 PetriNetUnfolderBase]: 3981/6686 cut-off events. [2024-05-12 11:14:55,073 INFO L125 PetriNetUnfolderBase]: For 37380/37380 co-relation queries the response was YES. [2024-05-12 11:14:55,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24840 conditions, 6686 events. 3981/6686 cut-off events. For 37380/37380 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 43539 event pairs, 1525 based on Foata normal form. 4/6501 useless extension candidates. Maximal degree in co-relation 24800. Up to 5595 conditions per place. [2024-05-12 11:14:55,107 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 107 selfloop transitions, 22 changer transitions 0/139 dead transitions. [2024-05-12 11:14:55,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 139 transitions, 1160 flow [2024-05-12 11:14:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:14:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:14:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-05-12 11:14:55,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131195335276968 [2024-05-12 11:14:55,109 INFO L175 Difference]: Start difference. First operand has 96 places, 101 transitions, 724 flow. Second operand 7 states and 176 transitions. [2024-05-12 11:14:55,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 139 transitions, 1160 flow [2024-05-12 11:14:55,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 139 transitions, 1106 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 11:14:55,131 INFO L231 Difference]: Finished difference. Result has 97 places, 104 transitions, 756 flow [2024-05-12 11:14:55,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=756, PETRI_PLACES=97, PETRI_TRANSITIONS=104} [2024-05-12 11:14:55,132 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 42 predicate places. [2024-05-12 11:14:55,132 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 756 flow [2024-05-12 11:14:55,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:55,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:14:55,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:14:55,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:14:55,133 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:14:55,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:14:55,133 INFO L85 PathProgramCache]: Analyzing trace with hash -271509139, now seen corresponding path program 3 times [2024-05-12 11:14:55,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:14:55,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754486161] [2024-05-12 11:14:55,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:14:55,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:14:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:15:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:15:06,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:15:06,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754486161] [2024-05-12 11:15:06,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754486161] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:15:06,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:15:06,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:15:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907817606] [2024-05-12 11:15:06,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:15:06,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:15:06,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:15:06,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:15:06,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:15:06,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:15:06,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 756 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:15:06,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:15:06,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:15:06,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:15:09,313 INFO L124 PetriNetUnfolderBase]: 3971/6678 cut-off events. [2024-05-12 11:15:09,313 INFO L125 PetriNetUnfolderBase]: For 40046/40046 co-relation queries the response was YES. [2024-05-12 11:15:09,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25009 conditions, 6678 events. 3971/6678 cut-off events. For 40046/40046 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 43484 event pairs, 1529 based on Foata normal form. 4/6491 useless extension candidates. Maximal degree in co-relation 24968. Up to 5636 conditions per place. [2024-05-12 11:15:09,357 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 107 selfloop transitions, 17 changer transitions 0/134 dead transitions. [2024-05-12 11:15:09,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 134 transitions, 1082 flow [2024-05-12 11:15:09,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:15:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:15:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-05-12 11:15:09,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956268221574344 [2024-05-12 11:15:09,358 INFO L175 Difference]: Start difference. First operand has 97 places, 104 transitions, 756 flow. Second operand 7 states and 170 transitions. [2024-05-12 11:15:09,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 134 transitions, 1082 flow [2024-05-12 11:15:09,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 134 transitions, 991 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-05-12 11:15:09,395 INFO L231 Difference]: Finished difference. Result has 99 places, 104 transitions, 707 flow [2024-05-12 11:15:09,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=707, PETRI_PLACES=99, PETRI_TRANSITIONS=104} [2024-05-12 11:15:09,396 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 44 predicate places. [2024-05-12 11:15:09,396 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 104 transitions, 707 flow [2024-05-12 11:15:09,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:15:09,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:15:09,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:15:09,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:15:09,397 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:15:09,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:15:09,397 INFO L85 PathProgramCache]: Analyzing trace with hash -884580626, now seen corresponding path program 1 times [2024-05-12 11:15:09,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:15:09,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834536171] [2024-05-12 11:15:09,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:15:09,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:15:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:15:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:15:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:15:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834536171] [2024-05-12 11:15:25,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834536171] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:15:25,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:15:25,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:15:25,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380336769] [2024-05-12 11:15:25,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:15:25,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:15:25,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:15:25,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:15:25,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:15:25,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:15:25,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 104 transitions, 707 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-05-12 11:15:25,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:15:25,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:15:25,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:15:28,713 INFO L124 PetriNetUnfolderBase]: 4795/8121 cut-off events. [2024-05-12 11:15:28,713 INFO L125 PetriNetUnfolderBase]: For 50572/50616 co-relation queries the response was YES. [2024-05-12 11:15:28,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28976 conditions, 8121 events. 4795/8121 cut-off events. For 50572/50616 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 54891 event pairs, 2107 based on Foata normal form. 9/7868 useless extension candidates. Maximal degree in co-relation 28935. Up to 6866 conditions per place. [2024-05-12 11:15:28,751 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 87 selfloop transitions, 11 changer transitions 0/122 dead transitions. [2024-05-12 11:15:28,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 122 transitions, 963 flow [2024-05-12 11:15:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:15:28,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:15:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-05-12 11:15:28,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-05-12 11:15:28,753 INFO L175 Difference]: Start difference. First operand has 99 places, 104 transitions, 707 flow. Second operand 5 states and 120 transitions. [2024-05-12 11:15:28,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 122 transitions, 963 flow [2024-05-12 11:15:28,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 122 transitions, 916 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-05-12 11:15:28,777 INFO L231 Difference]: Finished difference. Result has 98 places, 107 transitions, 715 flow [2024-05-12 11:15:28,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=715, PETRI_PLACES=98, PETRI_TRANSITIONS=107} [2024-05-12 11:15:28,778 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 43 predicate places. [2024-05-12 11:15:28,778 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 107 transitions, 715 flow [2024-05-12 11:15:28,778 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-05-12 11:15:28,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:15:28,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:15:28,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:15:28,779 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:15:28,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:15:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1917936751, now seen corresponding path program 1 times [2024-05-12 11:15:28,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:15:28,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559153172] [2024-05-12 11:15:28,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:15:28,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:15:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:15:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:15:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:15:40,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559153172] [2024-05-12 11:15:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559153172] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:15:40,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:15:40,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:15:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538297047] [2024-05-12 11:15:40,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:15:40,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:15:40,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:15:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:15:40,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:15:40,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:15:40,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 107 transitions, 715 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:15:40,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:15:40,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:15:40,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:15:43,012 INFO L124 PetriNetUnfolderBase]: 4184/6407 cut-off events. [2024-05-12 11:15:43,012 INFO L125 PetriNetUnfolderBase]: For 50809/50809 co-relation queries the response was YES. [2024-05-12 11:15:43,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27036 conditions, 6407 events. 4184/6407 cut-off events. For 50809/50809 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 37461 event pairs, 1171 based on Foata normal form. 2/6358 useless extension candidates. Maximal degree in co-relation 26994. Up to 5804 conditions per place. [2024-05-12 11:15:43,048 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 131 selfloop transitions, 35 changer transitions 0/177 dead transitions. [2024-05-12 11:15:43,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 177 transitions, 1391 flow [2024-05-12 11:15:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:15:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:15:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 232 transitions. [2024-05-12 11:15:43,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260770975056689 [2024-05-12 11:15:43,051 INFO L175 Difference]: Start difference. First operand has 98 places, 107 transitions, 715 flow. Second operand 9 states and 232 transitions. [2024-05-12 11:15:43,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 177 transitions, 1391 flow [2024-05-12 11:15:43,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 177 transitions, 1360 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-05-12 11:15:43,101 INFO L231 Difference]: Finished difference. Result has 105 places, 116 transitions, 892 flow [2024-05-12 11:15:43,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=892, PETRI_PLACES=105, PETRI_TRANSITIONS=116} [2024-05-12 11:15:43,102 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 50 predicate places. [2024-05-12 11:15:43,102 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 116 transitions, 892 flow [2024-05-12 11:15:43,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:15:43,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:15:43,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:15:43,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:15:43,103 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:15:43,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:15:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1921507796, now seen corresponding path program 1 times [2024-05-12 11:15:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:15:43,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842202969] [2024-05-12 11:15:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:15:43,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:15:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:15:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:15:54,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:15:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842202969] [2024-05-12 11:15:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842202969] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:15:54,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:15:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:15:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602124152] [2024-05-12 11:15:54,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:15:54,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:15:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:15:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:15:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:15:54,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:15:54,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 116 transitions, 892 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:15:54,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:15:54,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:15:54,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:15:57,529 INFO L124 PetriNetUnfolderBase]: 4281/6958 cut-off events. [2024-05-12 11:15:57,530 INFO L125 PetriNetUnfolderBase]: For 60837/60837 co-relation queries the response was YES. [2024-05-12 11:15:57,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29474 conditions, 6958 events. 4281/6958 cut-off events. For 60837/60837 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 43824 event pairs, 1337 based on Foata normal form. 4/6753 useless extension candidates. Maximal degree in co-relation 29430. Up to 5989 conditions per place. [2024-05-12 11:15:57,587 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 138 selfloop transitions, 18 changer transitions 0/167 dead transitions. [2024-05-12 11:15:57,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 167 transitions, 1384 flow [2024-05-12 11:15:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:15:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:15:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-05-12 11:15:57,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2024-05-12 11:15:57,588 INFO L175 Difference]: Start difference. First operand has 105 places, 116 transitions, 892 flow. Second operand 8 states and 202 transitions. [2024-05-12 11:15:57,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 167 transitions, 1384 flow [2024-05-12 11:15:57,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 167 transitions, 1295 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-05-12 11:15:57,705 INFO L231 Difference]: Finished difference. Result has 109 places, 119 transitions, 895 flow [2024-05-12 11:15:57,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=895, PETRI_PLACES=109, PETRI_TRANSITIONS=119} [2024-05-12 11:15:57,705 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 54 predicate places. [2024-05-12 11:15:57,705 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 119 transitions, 895 flow [2024-05-12 11:15:57,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:15:57,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:15:57,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:15:57,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:15:57,706 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:15:57,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:15:57,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1921507951, now seen corresponding path program 2 times [2024-05-12 11:15:57,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:15:57,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095137186] [2024-05-12 11:15:57,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:15:57,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:15:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:16:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:16:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:16:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095137186] [2024-05-12 11:16:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095137186] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:16:10,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:16:10,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:16:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698917682] [2024-05-12 11:16:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:16:10,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:16:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:16:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:16:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:16:10,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:16:10,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 119 transitions, 895 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:10,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:16:10,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:16:10,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:16:13,506 INFO L124 PetriNetUnfolderBase]: 4232/6459 cut-off events. [2024-05-12 11:16:13,507 INFO L125 PetriNetUnfolderBase]: For 66567/66567 co-relation queries the response was YES. [2024-05-12 11:16:13,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29721 conditions, 6459 events. 4232/6459 cut-off events. For 66567/66567 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 37630 event pairs, 1165 based on Foata normal form. 2/6408 useless extension candidates. Maximal degree in co-relation 29675. Up to 5912 conditions per place. [2024-05-12 11:16:13,542 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 127 selfloop transitions, 29 changer transitions 0/167 dead transitions. [2024-05-12 11:16:13,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 167 transitions, 1343 flow [2024-05-12 11:16:13,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:16:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:16:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-05-12 11:16:13,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2024-05-12 11:16:13,545 INFO L175 Difference]: Start difference. First operand has 109 places, 119 transitions, 895 flow. Second operand 8 states and 202 transitions. [2024-05-12 11:16:13,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 167 transitions, 1343 flow [2024-05-12 11:16:13,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 167 transitions, 1259 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-05-12 11:16:13,592 INFO L231 Difference]: Finished difference. Result has 111 places, 119 transitions, 878 flow [2024-05-12 11:16:13,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=878, PETRI_PLACES=111, PETRI_TRANSITIONS=119} [2024-05-12 11:16:13,592 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 56 predicate places. [2024-05-12 11:16:13,593 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 119 transitions, 878 flow [2024-05-12 11:16:13,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:13,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:16:13,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:16:13,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:16:13,593 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:16:13,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:16:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash -62100582, now seen corresponding path program 2 times [2024-05-12 11:16:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:16:13,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866463397] [2024-05-12 11:16:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:16:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:16:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:16:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:16:26,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:16:26,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866463397] [2024-05-12 11:16:26,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866463397] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:16:26,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:16:26,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:16:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593916495] [2024-05-12 11:16:26,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:16:26,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:16:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:16:26,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:16:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:16:26,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:16:26,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 119 transitions, 878 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:26,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:16:26,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:16:26,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:16:29,367 INFO L124 PetriNetUnfolderBase]: 4416/7157 cut-off events. [2024-05-12 11:16:29,367 INFO L125 PetriNetUnfolderBase]: For 75980/75986 co-relation queries the response was YES. [2024-05-12 11:16:29,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31788 conditions, 7157 events. 4416/7157 cut-off events. For 75980/75986 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 45102 event pairs, 1287 based on Foata normal form. 5/6954 useless extension candidates. Maximal degree in co-relation 31741. Up to 5824 conditions per place. [2024-05-12 11:16:29,414 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 121 selfloop transitions, 47 changer transitions 0/179 dead transitions. [2024-05-12 11:16:29,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 179 transitions, 1644 flow [2024-05-12 11:16:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:16:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:16:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-05-12 11:16:29,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2024-05-12 11:16:29,415 INFO L175 Difference]: Start difference. First operand has 111 places, 119 transitions, 878 flow. Second operand 8 states and 212 transitions. [2024-05-12 11:16:29,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 179 transitions, 1644 flow [2024-05-12 11:16:29,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 179 transitions, 1577 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-05-12 11:16:29,462 INFO L231 Difference]: Finished difference. Result has 112 places, 128 transitions, 1063 flow [2024-05-12 11:16:29,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1063, PETRI_PLACES=112, PETRI_TRANSITIONS=128} [2024-05-12 11:16:29,462 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 57 predicate places. [2024-05-12 11:16:29,462 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 128 transitions, 1063 flow [2024-05-12 11:16:29,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:29,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:16:29,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:16:29,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:16:29,463 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:16:29,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:16:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash -126901816, now seen corresponding path program 3 times [2024-05-12 11:16:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:16:29,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092918857] [2024-05-12 11:16:29,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:16:29,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:16:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:16:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:16:41,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:16:41,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092918857] [2024-05-12 11:16:41,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092918857] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:16:41,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:16:41,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:16:41,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406526319] [2024-05-12 11:16:41,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:16:41,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:16:41,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:16:41,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:16:41,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:16:41,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:16:41,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 128 transitions, 1063 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:41,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:16:41,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:16:41,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:16:44,513 INFO L124 PetriNetUnfolderBase]: 4406/7143 cut-off events. [2024-05-12 11:16:44,513 INFO L125 PetriNetUnfolderBase]: For 84858/84864 co-relation queries the response was YES. [2024-05-12 11:16:44,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32883 conditions, 7143 events. 4406/7143 cut-off events. For 84858/84864 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 44954 event pairs, 1285 based on Foata normal form. 5/6940 useless extension candidates. Maximal degree in co-relation 32835. Up to 5816 conditions per place. [2024-05-12 11:16:44,553 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 121 selfloop transitions, 46 changer transitions 0/178 dead transitions. [2024-05-12 11:16:44,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 178 transitions, 1617 flow [2024-05-12 11:16:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:16:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:16:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-05-12 11:16:44,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2024-05-12 11:16:44,555 INFO L175 Difference]: Start difference. First operand has 112 places, 128 transitions, 1063 flow. Second operand 8 states and 212 transitions. [2024-05-12 11:16:44,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 178 transitions, 1617 flow [2024-05-12 11:16:44,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 178 transitions, 1518 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-05-12 11:16:44,619 INFO L231 Difference]: Finished difference. Result has 117 places, 128 transitions, 1064 flow [2024-05-12 11:16:44,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1064, PETRI_PLACES=117, PETRI_TRANSITIONS=128} [2024-05-12 11:16:44,619 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 62 predicate places. [2024-05-12 11:16:44,620 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 128 transitions, 1064 flow [2024-05-12 11:16:44,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:44,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:16:44,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:16:44,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:16:44,620 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:16:44,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:16:44,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1009583101, now seen corresponding path program 3 times [2024-05-12 11:16:44,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:16:44,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660122119] [2024-05-12 11:16:44,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:16:44,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:16:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:16:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:16:57,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:16:57,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660122119] [2024-05-12 11:16:57,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660122119] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:16:57,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:16:57,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:16:57,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734259448] [2024-05-12 11:16:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:16:57,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:16:57,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:16:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:16:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:16:57,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:16:57,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 128 transitions, 1064 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:57,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:16:57,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:16:57,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:00,408 INFO L124 PetriNetUnfolderBase]: 4390/6692 cut-off events. [2024-05-12 11:17:00,408 INFO L125 PetriNetUnfolderBase]: For 87626/87632 co-relation queries the response was YES. [2024-05-12 11:17:00,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32694 conditions, 6692 events. 4390/6692 cut-off events. For 87626/87632 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 39146 event pairs, 1181 based on Foata normal form. 6/6644 useless extension candidates. Maximal degree in co-relation 32644. Up to 6037 conditions per place. [2024-05-12 11:17:00,449 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 124 selfloop transitions, 51 changer transitions 0/186 dead transitions. [2024-05-12 11:17:00,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 186 transitions, 1756 flow [2024-05-12 11:17:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:17:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:17:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-05-12 11:17:00,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2024-05-12 11:17:00,451 INFO L175 Difference]: Start difference. First operand has 117 places, 128 transitions, 1064 flow. Second operand 8 states and 203 transitions. [2024-05-12 11:17:00,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 186 transitions, 1756 flow [2024-05-12 11:17:00,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 186 transitions, 1646 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-05-12 11:17:00,503 INFO L231 Difference]: Finished difference. Result has 119 places, 140 transitions, 1297 flow [2024-05-12 11:17:00,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1297, PETRI_PLACES=119, PETRI_TRANSITIONS=140} [2024-05-12 11:17:00,503 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 64 predicate places. [2024-05-12 11:17:00,503 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 140 transitions, 1297 flow [2024-05-12 11:17:00,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:00,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:00,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:00,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:17:00,504 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:17:00,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:00,504 INFO L85 PathProgramCache]: Analyzing trace with hash -785543176, now seen corresponding path program 4 times [2024-05-12 11:17:00,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:00,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206731090] [2024-05-12 11:17:00,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:00,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:11,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:11,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206731090] [2024-05-12 11:17:11,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206731090] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:11,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:11,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:17:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881205501] [2024-05-12 11:17:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:11,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:17:11,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:11,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:17:11,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:17:12,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:17:12,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 140 transitions, 1297 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:12,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:12,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:17:12,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:14,744 INFO L124 PetriNetUnfolderBase]: 4550/7239 cut-off events. [2024-05-12 11:17:14,744 INFO L125 PetriNetUnfolderBase]: For 104821/104821 co-relation queries the response was YES. [2024-05-12 11:17:14,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35760 conditions, 7239 events. 4550/7239 cut-off events. For 104821/104821 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 45267 event pairs, 1570 based on Foata normal form. 4/7098 useless extension candidates. Maximal degree in co-relation 35708. Up to 6191 conditions per place. [2024-05-12 11:17:14,795 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 149 selfloop transitions, 32 changer transitions 0/192 dead transitions. [2024-05-12 11:17:14,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 192 transitions, 2055 flow [2024-05-12 11:17:14,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:17:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:17:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-05-12 11:17:14,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5229591836734694 [2024-05-12 11:17:14,797 INFO L175 Difference]: Start difference. First operand has 119 places, 140 transitions, 1297 flow. Second operand 8 states and 205 transitions. [2024-05-12 11:17:14,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 192 transitions, 2055 flow [2024-05-12 11:17:14,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 192 transitions, 1912 flow, removed 61 selfloop flow, removed 3 redundant places. [2024-05-12 11:17:14,892 INFO L231 Difference]: Finished difference. Result has 124 places, 146 transitions, 1330 flow [2024-05-12 11:17:14,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1330, PETRI_PLACES=124, PETRI_TRANSITIONS=146} [2024-05-12 11:17:14,892 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 69 predicate places. [2024-05-12 11:17:14,893 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 146 transitions, 1330 flow [2024-05-12 11:17:14,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:14,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:14,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:14,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:17:14,893 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:17:14,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash 164901258, now seen corresponding path program 5 times [2024-05-12 11:17:14,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:14,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264680368] [2024-05-12 11:17:14,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:14,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:26,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:26,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264680368] [2024-05-12 11:17:26,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264680368] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:26,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:26,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:17:26,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594722081] [2024-05-12 11:17:26,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:26,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:17:26,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:26,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:17:26,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:17:26,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:17:26,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 146 transitions, 1330 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:26,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:26,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:17:26,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:29,221 INFO L124 PetriNetUnfolderBase]: 4540/7234 cut-off events. [2024-05-12 11:17:29,221 INFO L125 PetriNetUnfolderBase]: For 107316/107316 co-relation queries the response was YES. [2024-05-12 11:17:29,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35651 conditions, 7234 events. 4540/7234 cut-off events. For 107316/107316 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 45302 event pairs, 1555 based on Foata normal form. 4/7089 useless extension candidates. Maximal degree in co-relation 35598. Up to 6183 conditions per place. [2024-05-12 11:17:29,268 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 146 selfloop transitions, 33 changer transitions 0/190 dead transitions. [2024-05-12 11:17:29,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 190 transitions, 1898 flow [2024-05-12 11:17:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:17:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:17:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-05-12 11:17:29,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2024-05-12 11:17:29,270 INFO L175 Difference]: Start difference. First operand has 124 places, 146 transitions, 1330 flow. Second operand 8 states and 202 transitions. [2024-05-12 11:17:29,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 190 transitions, 1898 flow [2024-05-12 11:17:29,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 190 transitions, 1752 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-05-12 11:17:29,356 INFO L231 Difference]: Finished difference. Result has 127 places, 146 transitions, 1258 flow [2024-05-12 11:17:29,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1258, PETRI_PLACES=127, PETRI_TRANSITIONS=146} [2024-05-12 11:17:29,357 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 72 predicate places. [2024-05-12 11:17:29,357 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 146 transitions, 1258 flow [2024-05-12 11:17:29,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:29,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:29,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:29,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:17:29,357 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:17:29,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:29,358 INFO L85 PathProgramCache]: Analyzing trace with hash 16988559, now seen corresponding path program 4 times [2024-05-12 11:17:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:29,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097338262] [2024-05-12 11:17:29,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:29,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:41,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:41,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097338262] [2024-05-12 11:17:41,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097338262] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:41,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:41,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:17:41,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501804111] [2024-05-12 11:17:41,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:41,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:17:41,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:41,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:17:41,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:17:41,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:17:41,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 146 transitions, 1258 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:41,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:41,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:17:41,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:44,519 INFO L124 PetriNetUnfolderBase]: 4535/7230 cut-off events. [2024-05-12 11:17:44,520 INFO L125 PetriNetUnfolderBase]: For 108660/108660 co-relation queries the response was YES. [2024-05-12 11:17:44,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35361 conditions, 7230 events. 4535/7230 cut-off events. For 108660/108660 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 45417 event pairs, 1576 based on Foata normal form. 2/7083 useless extension candidates. Maximal degree in co-relation 35307. Up to 6350 conditions per place. [2024-05-12 11:17:44,571 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 153 selfloop transitions, 29 changer transitions 0/193 dead transitions. [2024-05-12 11:17:44,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 193 transitions, 1824 flow [2024-05-12 11:17:44,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:17:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:17:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-05-12 11:17:44,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:17:44,573 INFO L175 Difference]: Start difference. First operand has 127 places, 146 transitions, 1258 flow. Second operand 8 states and 196 transitions. [2024-05-12 11:17:44,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 193 transitions, 1824 flow [2024-05-12 11:17:44,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 193 transitions, 1754 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-05-12 11:17:44,635 INFO L231 Difference]: Finished difference. Result has 130 places, 152 transitions, 1361 flow [2024-05-12 11:17:44,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1361, PETRI_PLACES=130, PETRI_TRANSITIONS=152} [2024-05-12 11:17:44,636 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 75 predicate places. [2024-05-12 11:17:44,636 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 152 transitions, 1361 flow [2024-05-12 11:17:44,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:44,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:44,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:44,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:17:44,637 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:17:44,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash 173152218, now seen corresponding path program 6 times [2024-05-12 11:17:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:44,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269928328] [2024-05-12 11:17:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:44,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:56,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:56,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269928328] [2024-05-12 11:17:56,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269928328] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:56,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:56,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:17:56,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990490989] [2024-05-12 11:17:56,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:56,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:17:56,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:56,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:17:56,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:17:56,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:17:56,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 152 transitions, 1361 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:56,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:56,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:17:56,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:59,318 INFO L124 PetriNetUnfolderBase]: 4525/7222 cut-off events. [2024-05-12 11:17:59,318 INFO L125 PetriNetUnfolderBase]: For 117477/117477 co-relation queries the response was YES. [2024-05-12 11:17:59,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35990 conditions, 7222 events. 4525/7222 cut-off events. For 117477/117477 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 45442 event pairs, 1576 based on Foata normal form. 4/7075 useless extension candidates. Maximal degree in co-relation 35934. Up to 6311 conditions per place. [2024-05-12 11:17:59,371 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 160 selfloop transitions, 20 changer transitions 0/191 dead transitions. [2024-05-12 11:17:59,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 191 transitions, 1827 flow [2024-05-12 11:17:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:17:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:17:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 11:17:59,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49744897959183676 [2024-05-12 11:17:59,373 INFO L175 Difference]: Start difference. First operand has 130 places, 152 transitions, 1361 flow. Second operand 8 states and 195 transitions. [2024-05-12 11:17:59,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 191 transitions, 1827 flow [2024-05-12 11:17:59,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 191 transitions, 1658 flow, removed 50 selfloop flow, removed 6 redundant places. [2024-05-12 11:17:59,482 INFO L231 Difference]: Finished difference. Result has 132 places, 152 transitions, 1240 flow [2024-05-12 11:17:59,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1240, PETRI_PLACES=132, PETRI_TRANSITIONS=152} [2024-05-12 11:17:59,482 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 77 predicate places. [2024-05-12 11:17:59,482 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 152 transitions, 1240 flow [2024-05-12 11:17:59,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:59,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:59,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:59,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 11:17:59,483 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:17:59,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:59,484 INFO L85 PathProgramCache]: Analyzing trace with hash 173459056, now seen corresponding path program 1 times [2024-05-12 11:17:59,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:59,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868812149] [2024-05-12 11:17:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:15,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:15,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868812149] [2024-05-12 11:18:15,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868812149] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:15,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:15,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:18:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330082878] [2024-05-12 11:18:15,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:15,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:18:15,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:15,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:18:15,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:18:15,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:18:15,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 152 transitions, 1240 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-05-12 11:18:15,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:15,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:18:15,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:19,001 INFO L124 PetriNetUnfolderBase]: 5394/8538 cut-off events. [2024-05-12 11:18:19,001 INFO L125 PetriNetUnfolderBase]: For 140003/140003 co-relation queries the response was YES. [2024-05-12 11:18:19,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41159 conditions, 8538 events. 5394/8538 cut-off events. For 140003/140003 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 53496 event pairs, 1898 based on Foata normal form. 4/8349 useless extension candidates. Maximal degree in co-relation 41103. Up to 7521 conditions per place. [2024-05-12 11:18:19,062 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 159 selfloop transitions, 21 changer transitions 0/190 dead transitions. [2024-05-12 11:18:19,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 190 transitions, 1738 flow [2024-05-12 11:18:19,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:18:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:18:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-05-12 11:18:19,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-05-12 11:18:19,063 INFO L175 Difference]: Start difference. First operand has 132 places, 152 transitions, 1240 flow. Second operand 7 states and 168 transitions. [2024-05-12 11:18:19,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 190 transitions, 1738 flow [2024-05-12 11:18:19,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 190 transitions, 1674 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 11:18:19,149 INFO L231 Difference]: Finished difference. Result has 131 places, 154 transitions, 1271 flow [2024-05-12 11:18:19,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1271, PETRI_PLACES=131, PETRI_TRANSITIONS=154} [2024-05-12 11:18:19,150 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 76 predicate places. [2024-05-12 11:18:19,150 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 154 transitions, 1271 flow [2024-05-12 11:18:19,150 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-05-12 11:18:19,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:19,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:19,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 11:18:19,151 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:18:19,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:19,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1667387162, now seen corresponding path program 1 times [2024-05-12 11:18:19,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:19,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210800672] [2024-05-12 11:18:19,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:19,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:37,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:37,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210800672] [2024-05-12 11:18:37,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210800672] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:37,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:37,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:18:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92931662] [2024-05-12 11:18:37,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:37,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:18:37,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:37,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:18:37,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:18:37,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:18:37,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 154 transitions, 1271 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-05-12 11:18:37,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:37,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:18:37,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:40,998 INFO L124 PetriNetUnfolderBase]: 5134/8037 cut-off events. [2024-05-12 11:18:40,998 INFO L125 PetriNetUnfolderBase]: For 141521/141591 co-relation queries the response was YES. [2024-05-12 11:18:41,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38544 conditions, 8037 events. 5134/8037 cut-off events. For 141521/141591 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 49441 event pairs, 2081 based on Foata normal form. 13/7881 useless extension candidates. Maximal degree in co-relation 38487. Up to 7244 conditions per place. [2024-05-12 11:18:41,058 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 130 selfloop transitions, 14 changer transitions 0/179 dead transitions. [2024-05-12 11:18:41,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 179 transitions, 1645 flow [2024-05-12 11:18:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:18:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:18:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-05-12 11:18:41,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48639455782312924 [2024-05-12 11:18:41,060 INFO L175 Difference]: Start difference. First operand has 131 places, 154 transitions, 1271 flow. Second operand 6 states and 143 transitions. [2024-05-12 11:18:41,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 179 transitions, 1645 flow [2024-05-12 11:18:41,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 179 transitions, 1562 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-05-12 11:18:41,163 INFO L231 Difference]: Finished difference. Result has 132 places, 157 transitions, 1254 flow [2024-05-12 11:18:41,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1254, PETRI_PLACES=132, PETRI_TRANSITIONS=157} [2024-05-12 11:18:41,164 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 77 predicate places. [2024-05-12 11:18:41,164 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 157 transitions, 1254 flow [2024-05-12 11:18:41,164 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-05-12 11:18:41,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:41,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:41,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 11:18:41,165 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:18:41,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:41,165 INFO L85 PathProgramCache]: Analyzing trace with hash 559939700, now seen corresponding path program 1 times [2024-05-12 11:18:41,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:41,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401432915] [2024-05-12 11:18:41,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:41,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:56,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401432915] [2024-05-12 11:18:56,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401432915] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:56,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:56,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:18:56,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645827275] [2024-05-12 11:18:56,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:56,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:18:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:56,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:18:56,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:18:56,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:18:56,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 157 transitions, 1254 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:56,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:56,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:18:56,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:59,652 INFO L124 PetriNetUnfolderBase]: 4536/6916 cut-off events. [2024-05-12 11:18:59,652 INFO L125 PetriNetUnfolderBase]: For 132759/132763 co-relation queries the response was YES. [2024-05-12 11:18:59,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36604 conditions, 6916 events. 4536/6916 cut-off events. For 132759/132763 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 40621 event pairs, 856 based on Foata normal form. 8/6868 useless extension candidates. Maximal degree in co-relation 36546. Up to 6161 conditions per place. [2024-05-12 11:18:59,701 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 181 selfloop transitions, 40 changer transitions 0/232 dead transitions. [2024-05-12 11:18:59,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 232 transitions, 2092 flow [2024-05-12 11:18:59,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:18:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:18:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 257 transitions. [2024-05-12 11:18:59,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5244897959183673 [2024-05-12 11:18:59,703 INFO L175 Difference]: Start difference. First operand has 132 places, 157 transitions, 1254 flow. Second operand 10 states and 257 transitions. [2024-05-12 11:18:59,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 232 transitions, 2092 flow [2024-05-12 11:18:59,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 232 transitions, 2048 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-05-12 11:18:59,813 INFO L231 Difference]: Finished difference. Result has 138 places, 161 transitions, 1393 flow [2024-05-12 11:18:59,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1393, PETRI_PLACES=138, PETRI_TRANSITIONS=161} [2024-05-12 11:18:59,814 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 83 predicate places. [2024-05-12 11:18:59,814 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 161 transitions, 1393 flow [2024-05-12 11:18:59,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:59,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:59,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:59,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 11:18:59,815 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:18:59,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash 560000150, now seen corresponding path program 2 times [2024-05-12 11:18:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:59,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699479972] [2024-05-12 11:18:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:59,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:13,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699479972] [2024-05-12 11:19:13,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699479972] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:13,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:19:13,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509425205] [2024-05-12 11:19:13,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:13,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:19:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:13,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:19:13,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:19:13,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:19:13,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 161 transitions, 1393 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:13,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:13,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:19:13,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:17,033 INFO L124 PetriNetUnfolderBase]: 4614/7247 cut-off events. [2024-05-12 11:19:17,033 INFO L125 PetriNetUnfolderBase]: For 145415/145419 co-relation queries the response was YES. [2024-05-12 11:19:17,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38241 conditions, 7247 events. 4614/7247 cut-off events. For 145415/145419 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 44467 event pairs, 1304 based on Foata normal form. 8/7117 useless extension candidates. Maximal degree in co-relation 38182. Up to 6396 conditions per place. [2024-05-12 11:19:17,086 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 202 selfloop transitions, 26 changer transitions 0/239 dead transitions. [2024-05-12 11:19:17,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 239 transitions, 2158 flow [2024-05-12 11:19:17,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:19:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:19:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 253 transitions. [2024-05-12 11:19:17,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163265306122449 [2024-05-12 11:19:17,087 INFO L175 Difference]: Start difference. First operand has 138 places, 161 transitions, 1393 flow. Second operand 10 states and 253 transitions. [2024-05-12 11:19:17,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 239 transitions, 2158 flow [2024-05-12 11:19:17,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 239 transitions, 2027 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-05-12 11:19:17,194 INFO L231 Difference]: Finished difference. Result has 144 places, 172 transitions, 1472 flow [2024-05-12 11:19:17,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1472, PETRI_PLACES=144, PETRI_TRANSITIONS=172} [2024-05-12 11:19:17,194 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 89 predicate places. [2024-05-12 11:19:17,195 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 172 transitions, 1472 flow [2024-05-12 11:19:17,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:17,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:17,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:17,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 11:19:17,195 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:19:17,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash 418423322, now seen corresponding path program 1 times [2024-05-12 11:19:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:17,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038717662] [2024-05-12 11:19:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:17,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:31,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:31,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038717662] [2024-05-12 11:19:31,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038717662] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:31,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:31,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:19:31,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234392951] [2024-05-12 11:19:31,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:31,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:19:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:31,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:19:31,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:19:31,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:19:31,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 172 transitions, 1472 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:31,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:31,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:19:31,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:34,705 INFO L124 PetriNetUnfolderBase]: 4697/7132 cut-off events. [2024-05-12 11:19:34,706 INFO L125 PetriNetUnfolderBase]: For 155820/155824 co-relation queries the response was YES. [2024-05-12 11:19:34,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38994 conditions, 7132 events. 4697/7132 cut-off events. For 155820/155824 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 41779 event pairs, 1101 based on Foata normal form. 8/7080 useless extension candidates. Maximal degree in co-relation 38931. Up to 6383 conditions per place. [2024-05-12 11:19:34,766 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 190 selfloop transitions, 52 changer transitions 0/253 dead transitions. [2024-05-12 11:19:34,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 253 transitions, 2440 flow [2024-05-12 11:19:34,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:19:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:19:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 261 transitions. [2024-05-12 11:19:34,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5326530612244897 [2024-05-12 11:19:34,768 INFO L175 Difference]: Start difference. First operand has 144 places, 172 transitions, 1472 flow. Second operand 10 states and 261 transitions. [2024-05-12 11:19:34,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 253 transitions, 2440 flow [2024-05-12 11:19:34,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 253 transitions, 2379 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-05-12 11:19:34,909 INFO L231 Difference]: Finished difference. Result has 149 places, 181 transitions, 1708 flow [2024-05-12 11:19:34,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1708, PETRI_PLACES=149, PETRI_TRANSITIONS=181} [2024-05-12 11:19:34,910 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 94 predicate places. [2024-05-12 11:19:34,910 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 181 transitions, 1708 flow [2024-05-12 11:19:34,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:34,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:34,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:34,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 11:19:34,910 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:19:34,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:34,911 INFO L85 PathProgramCache]: Analyzing trace with hash 245716146, now seen corresponding path program 2 times [2024-05-12 11:19:34,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:34,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912075623] [2024-05-12 11:19:34,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:34,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:48,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:48,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912075623] [2024-05-12 11:19:48,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912075623] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:48,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:48,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:19:48,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946126075] [2024-05-12 11:19:48,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:48,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:19:48,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:48,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:19:48,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:19:48,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:19:48,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 181 transitions, 1708 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:48,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:48,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:19:48,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:51,652 INFO L124 PetriNetUnfolderBase]: 4748/7207 cut-off events. [2024-05-12 11:19:51,652 INFO L125 PetriNetUnfolderBase]: For 169532/169536 co-relation queries the response was YES. [2024-05-12 11:19:51,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40810 conditions, 7207 events. 4748/7207 cut-off events. For 169532/169536 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 42349 event pairs, 1107 based on Foata normal form. 8/7156 useless extension candidates. Maximal degree in co-relation 40745. Up to 6509 conditions per place. [2024-05-12 11:19:51,712 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 192 selfloop transitions, 42 changer transitions 0/245 dead transitions. [2024-05-12 11:19:51,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 245 transitions, 2528 flow [2024-05-12 11:19:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:19:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:19:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-05-12 11:19:51,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528344671201814 [2024-05-12 11:19:51,714 INFO L175 Difference]: Start difference. First operand has 149 places, 181 transitions, 1708 flow. Second operand 9 states and 233 transitions. [2024-05-12 11:19:51,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 245 transitions, 2528 flow [2024-05-12 11:19:51,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 245 transitions, 2397 flow, removed 49 selfloop flow, removed 5 redundant places. [2024-05-12 11:19:51,860 INFO L231 Difference]: Finished difference. Result has 153 places, 184 transitions, 1730 flow [2024-05-12 11:19:51,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1730, PETRI_PLACES=153, PETRI_TRANSITIONS=184} [2024-05-12 11:19:51,860 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 98 predicate places. [2024-05-12 11:19:51,861 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 184 transitions, 1730 flow [2024-05-12 11:19:51,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:51,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:51,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:51,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 11:19:51,861 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:19:51,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash 245716022, now seen corresponding path program 3 times [2024-05-12 11:19:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:51,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957475381] [2024-05-12 11:19:51,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:51,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:05,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:05,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957475381] [2024-05-12 11:20:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957475381] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:05,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:05,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:05,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202628684] [2024-05-12 11:20:05,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:05,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:05,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:05,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:05,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:05,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:20:05,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 184 transitions, 1730 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:05,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:05,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:20:05,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:08,956 INFO L124 PetriNetUnfolderBase]: 4782/7501 cut-off events. [2024-05-12 11:20:08,957 INFO L125 PetriNetUnfolderBase]: For 174899/174903 co-relation queries the response was YES. [2024-05-12 11:20:08,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41261 conditions, 7501 events. 4782/7501 cut-off events. For 174899/174903 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 46241 event pairs, 1323 based on Foata normal form. 8/7361 useless extension candidates. Maximal degree in co-relation 41194. Up to 6668 conditions per place. [2024-05-12 11:20:09,015 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 211 selfloop transitions, 20 changer transitions 0/242 dead transitions. [2024-05-12 11:20:09,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 242 transitions, 2388 flow [2024-05-12 11:20:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:20:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:20:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-05-12 11:20:09,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-05-12 11:20:09,017 INFO L175 Difference]: Start difference. First operand has 153 places, 184 transitions, 1730 flow. Second operand 9 states and 225 transitions. [2024-05-12 11:20:09,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 242 transitions, 2388 flow [2024-05-12 11:20:09,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 242 transitions, 2218 flow, removed 41 selfloop flow, removed 7 redundant places. [2024-05-12 11:20:09,157 INFO L231 Difference]: Finished difference. Result has 155 places, 186 transitions, 1647 flow [2024-05-12 11:20:09,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1647, PETRI_PLACES=155, PETRI_TRANSITIONS=186} [2024-05-12 11:20:09,157 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 100 predicate places. [2024-05-12 11:20:09,157 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 186 transitions, 1647 flow [2024-05-12 11:20:09,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:09,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:09,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:09,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 11:20:09,158 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:20:09,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:09,159 INFO L85 PathProgramCache]: Analyzing trace with hash 245720796, now seen corresponding path program 3 times [2024-05-12 11:20:09,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:09,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425126089] [2024-05-12 11:20:09,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:09,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:23,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:23,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425126089] [2024-05-12 11:20:23,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425126089] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:23,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:23,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:23,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617550995] [2024-05-12 11:20:23,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:23,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:23,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:23,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:23,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:20:23,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 186 transitions, 1647 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:23,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:23,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:20:23,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:26,282 INFO L124 PetriNetUnfolderBase]: 4777/7492 cut-off events. [2024-05-12 11:20:26,282 INFO L125 PetriNetUnfolderBase]: For 178529/178533 co-relation queries the response was YES. [2024-05-12 11:20:26,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40846 conditions, 7492 events. 4777/7492 cut-off events. For 178529/178533 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 46242 event pairs, 1306 based on Foata normal form. 8/7351 useless extension candidates. Maximal degree in co-relation 40778. Up to 6637 conditions per place. [2024-05-12 11:20:26,339 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 214 selfloop transitions, 21 changer transitions 0/246 dead transitions. [2024-05-12 11:20:26,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 246 transitions, 2329 flow [2024-05-12 11:20:26,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:20:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:20:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2024-05-12 11:20:26,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147392290249433 [2024-05-12 11:20:26,341 INFO L175 Difference]: Start difference. First operand has 155 places, 186 transitions, 1647 flow. Second operand 9 states and 227 transitions. [2024-05-12 11:20:26,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 246 transitions, 2329 flow [2024-05-12 11:20:26,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 246 transitions, 2234 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-05-12 11:20:26,476 INFO L231 Difference]: Finished difference. Result has 158 places, 189 transitions, 1654 flow [2024-05-12 11:20:26,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1654, PETRI_PLACES=158, PETRI_TRANSITIONS=189} [2024-05-12 11:20:26,476 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 103 predicate places. [2024-05-12 11:20:26,477 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 189 transitions, 1654 flow [2024-05-12 11:20:26,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:26,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:26,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:26,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 11:20:26,477 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:20:26,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash 361184946, now seen corresponding path program 4 times [2024-05-12 11:20:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:26,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724191904] [2024-05-12 11:20:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:39,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724191904] [2024-05-12 11:20:39,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724191904] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:39,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:39,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:39,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837417559] [2024-05-12 11:20:39,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:39,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:39,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:39,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:39,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:39,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:20:39,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 189 transitions, 1654 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:39,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:39,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:20:39,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:43,093 INFO L124 PetriNetUnfolderBase]: 4823/7356 cut-off events. [2024-05-12 11:20:43,093 INFO L125 PetriNetUnfolderBase]: For 188419/188429 co-relation queries the response was YES. [2024-05-12 11:20:43,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41409 conditions, 7356 events. 4823/7356 cut-off events. For 188419/188429 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 43689 event pairs, 985 based on Foata normal form. 9/7309 useless extension candidates. Maximal degree in co-relation 41340. Up to 6176 conditions per place. [2024-05-12 11:20:43,151 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 165 selfloop transitions, 88 changer transitions 0/264 dead transitions. [2024-05-12 11:20:43,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 264 transitions, 2742 flow [2024-05-12 11:20:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:20:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:20:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2024-05-12 11:20:43,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5374149659863946 [2024-05-12 11:20:43,152 INFO L175 Difference]: Start difference. First operand has 158 places, 189 transitions, 1654 flow. Second operand 9 states and 237 transitions. [2024-05-12 11:20:43,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 264 transitions, 2742 flow [2024-05-12 11:20:43,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 264 transitions, 2698 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 11:20:43,305 INFO L231 Difference]: Finished difference. Result has 161 places, 202 transitions, 2085 flow [2024-05-12 11:20:43,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2085, PETRI_PLACES=161, PETRI_TRANSITIONS=202} [2024-05-12 11:20:43,305 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 106 predicate places. [2024-05-12 11:20:43,305 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 202 transitions, 2085 flow [2024-05-12 11:20:43,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:43,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:43,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:43,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 11:20:43,306 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:20:43,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash 361007192, now seen corresponding path program 4 times [2024-05-12 11:20:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870192444] [2024-05-12 11:20:43,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:56,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:56,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870192444] [2024-05-12 11:20:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870192444] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:56,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:56,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:56,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140021901] [2024-05-12 11:20:56,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:56,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:56,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:56,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:57,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:20:57,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 202 transitions, 2085 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:57,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:57,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:20:57,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:00,382 INFO L124 PetriNetUnfolderBase]: 4888/7670 cut-off events. [2024-05-12 11:21:00,382 INFO L125 PetriNetUnfolderBase]: For 208082/208092 co-relation queries the response was YES. [2024-05-12 11:21:00,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44334 conditions, 7670 events. 4888/7670 cut-off events. For 208082/208092 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 47646 event pairs, 1294 based on Foata normal form. 12/7539 useless extension candidates. Maximal degree in co-relation 44263. Up to 6741 conditions per place. [2024-05-12 11:21:00,441 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 216 selfloop transitions, 33 changer transitions 0/260 dead transitions. [2024-05-12 11:21:00,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 260 transitions, 2804 flow [2024-05-12 11:21:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:21:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:21:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2024-05-12 11:21:00,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124716553287982 [2024-05-12 11:21:00,443 INFO L175 Difference]: Start difference. First operand has 161 places, 202 transitions, 2085 flow. Second operand 9 states and 226 transitions. [2024-05-12 11:21:00,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 260 transitions, 2804 flow [2024-05-12 11:21:00,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 260 transitions, 2598 flow, removed 85 selfloop flow, removed 3 redundant places. [2024-05-12 11:21:00,607 INFO L231 Difference]: Finished difference. Result has 168 places, 207 transitions, 2035 flow [2024-05-12 11:21:00,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2035, PETRI_PLACES=168, PETRI_TRANSITIONS=207} [2024-05-12 11:21:00,607 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 113 predicate places. [2024-05-12 11:21:00,608 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 207 transitions, 2035 flow [2024-05-12 11:21:00,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:00,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:00,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:00,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 11:21:00,608 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:21:00,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:00,608 INFO L85 PathProgramCache]: Analyzing trace with hash 678092604, now seen corresponding path program 5 times [2024-05-12 11:21:00,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:00,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573990153] [2024-05-12 11:21:00,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:21:14,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:14,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573990153] [2024-05-12 11:21:14,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573990153] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:14,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:14,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:21:14,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138411087] [2024-05-12 11:21:14,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:14,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:21:14,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:14,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:21:14,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:21:15,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:21:15,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 207 transitions, 2035 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:15,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:21:15,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:21:15,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:18,430 INFO L124 PetriNetUnfolderBase]: 4911/7482 cut-off events. [2024-05-12 11:21:18,430 INFO L125 PetriNetUnfolderBase]: For 212176/212186 co-relation queries the response was YES. [2024-05-12 11:21:18,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43883 conditions, 7482 events. 4911/7482 cut-off events. For 212176/212186 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 44442 event pairs, 985 based on Foata normal form. 9/7435 useless extension candidates. Maximal degree in co-relation 43809. Up to 6302 conditions per place. [2024-05-12 11:21:18,495 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 176 selfloop transitions, 88 changer transitions 0/275 dead transitions. [2024-05-12 11:21:18,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 275 transitions, 2991 flow [2024-05-12 11:21:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:21:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:21:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-05-12 11:21:18,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5419501133786848 [2024-05-12 11:21:18,499 INFO L175 Difference]: Start difference. First operand has 168 places, 207 transitions, 2035 flow. Second operand 9 states and 239 transitions. [2024-05-12 11:21:18,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 275 transitions, 2991 flow [2024-05-12 11:21:18,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 275 transitions, 2884 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-05-12 11:21:18,687 INFO L231 Difference]: Finished difference. Result has 171 places, 212 transitions, 2209 flow [2024-05-12 11:21:18,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1928, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2209, PETRI_PLACES=171, PETRI_TRANSITIONS=212} [2024-05-12 11:21:18,687 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 116 predicate places. [2024-05-12 11:21:18,687 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 212 transitions, 2209 flow [2024-05-12 11:21:18,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:18,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:18,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:18,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 11:21:18,688 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:21:18,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:18,689 INFO L85 PathProgramCache]: Analyzing trace with hash 678087954, now seen corresponding path program 6 times [2024-05-12 11:21:18,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:18,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331253099] [2024-05-12 11:21:18,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:18,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:21:32,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:32,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331253099] [2024-05-12 11:21:32,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331253099] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:32,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:32,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:21:32,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645654404] [2024-05-12 11:21:32,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:32,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:21:32,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:32,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:21:32,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:21:32,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:21:32,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 212 transitions, 2209 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:32,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:21:32,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:21:32,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:35,870 INFO L124 PetriNetUnfolderBase]: 4957/7546 cut-off events. [2024-05-12 11:21:35,870 INFO L125 PetriNetUnfolderBase]: For 226672/226682 co-relation queries the response was YES. [2024-05-12 11:21:35,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45476 conditions, 7546 events. 4957/7546 cut-off events. For 226672/226682 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 44831 event pairs, 983 based on Foata normal form. 9/7499 useless extension candidates. Maximal degree in co-relation 45401. Up to 6263 conditions per place. [2024-05-12 11:21:35,940 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 169 selfloop transitions, 98 changer transitions 0/278 dead transitions. [2024-05-12 11:21:35,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 278 transitions, 3155 flow [2024-05-12 11:21:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:21:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:21:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2024-05-12 11:21:35,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54421768707483 [2024-05-12 11:21:35,941 INFO L175 Difference]: Start difference. First operand has 171 places, 212 transitions, 2209 flow. Second operand 9 states and 240 transitions. [2024-05-12 11:21:35,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 278 transitions, 3155 flow [2024-05-12 11:21:36,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 278 transitions, 2930 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-05-12 11:21:36,154 INFO L231 Difference]: Finished difference. Result has 174 places, 215 transitions, 2265 flow [2024-05-12 11:21:36,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2265, PETRI_PLACES=174, PETRI_TRANSITIONS=215} [2024-05-12 11:21:36,154 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 119 predicate places. [2024-05-12 11:21:36,155 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 215 transitions, 2265 flow [2024-05-12 11:21:36,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:36,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:36,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:36,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 11:21:36,155 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:21:36,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:36,155 INFO L85 PathProgramCache]: Analyzing trace with hash -162711122, now seen corresponding path program 1 times [2024-05-12 11:21:36,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:36,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370163666] [2024-05-12 11:21:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:36,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:21:51,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:51,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370163666] [2024-05-12 11:21:51,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370163666] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:51,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:51,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:21:51,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412444077] [2024-05-12 11:21:51,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:51,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:21:51,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:51,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:21:51,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:21:51,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:21:51,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 215 transitions, 2265 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-05-12 11:21:51,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:21:51,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:21:51,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:54,757 INFO L124 PetriNetUnfolderBase]: 5774/9099 cut-off events. [2024-05-12 11:21:54,757 INFO L125 PetriNetUnfolderBase]: For 270384/270427 co-relation queries the response was YES. [2024-05-12 11:21:54,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51025 conditions, 9099 events. 5774/9099 cut-off events. For 270384/270427 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 57753 event pairs, 1865 based on Foata normal form. 20/8891 useless extension candidates. Maximal degree in co-relation 50950. Up to 8079 conditions per place. [2024-05-12 11:21:54,834 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 187 selfloop transitions, 20 changer transitions 0/251 dead transitions. [2024-05-12 11:21:54,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 251 transitions, 2907 flow [2024-05-12 11:21:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:21:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:21:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-05-12 11:21:54,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068027210884354 [2024-05-12 11:21:54,835 INFO L175 Difference]: Start difference. First operand has 174 places, 215 transitions, 2265 flow. Second operand 6 states and 149 transitions. [2024-05-12 11:21:54,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 251 transitions, 2907 flow [2024-05-12 11:21:55,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 251 transitions, 2652 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-05-12 11:21:55,040 INFO L231 Difference]: Finished difference. Result has 174 places, 225 transitions, 2161 flow [2024-05-12 11:21:55,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2010, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2161, PETRI_PLACES=174, PETRI_TRANSITIONS=225} [2024-05-12 11:21:55,041 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 119 predicate places. [2024-05-12 11:21:55,041 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 225 transitions, 2161 flow [2024-05-12 11:21:55,041 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-05-12 11:21:55,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:55,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:55,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 11:21:55,042 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:21:55,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:55,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1775243580, now seen corresponding path program 1 times [2024-05-12 11:21:55,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:55,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097508163] [2024-05-12 11:21:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:55,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:07,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:07,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097508163] [2024-05-12 11:22:07,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097508163] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:07,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:07,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:22:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246399963] [2024-05-12 11:22:07,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:07,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:22:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:07,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:22:07,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:22:07,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:22:07,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 225 transitions, 2161 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-05-12 11:22:07,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:07,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:22:07,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:22:11,168 INFO L124 PetriNetUnfolderBase]: 6120/9520 cut-off events. [2024-05-12 11:22:11,168 INFO L125 PetriNetUnfolderBase]: For 287153/287173 co-relation queries the response was YES. [2024-05-12 11:22:11,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54819 conditions, 9520 events. 6120/9520 cut-off events. For 287153/287173 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 59205 event pairs, 1933 based on Foata normal form. 2/9343 useless extension candidates. Maximal degree in co-relation 54742. Up to 8503 conditions per place. [2024-05-12 11:22:11,246 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 228 selfloop transitions, 23 changer transitions 0/264 dead transitions. [2024-05-12 11:22:11,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 264 transitions, 2844 flow [2024-05-12 11:22:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:22:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:22:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-05-12 11:22:11,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868804664723032 [2024-05-12 11:22:11,247 INFO L175 Difference]: Start difference. First operand has 174 places, 225 transitions, 2161 flow. Second operand 7 states and 167 transitions. [2024-05-12 11:22:11,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 264 transitions, 2844 flow [2024-05-12 11:22:11,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 264 transitions, 2818 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-05-12 11:22:11,530 INFO L231 Difference]: Finished difference. Result has 181 places, 232 transitions, 2312 flow [2024-05-12 11:22:11,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2135, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2312, PETRI_PLACES=181, PETRI_TRANSITIONS=232} [2024-05-12 11:22:11,531 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 126 predicate places. [2024-05-12 11:22:11,531 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 232 transitions, 2312 flow [2024-05-12 11:22:11,531 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-05-12 11:22:11,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:22:11,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:22:11,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 11:22:11,532 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:22:11,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:22:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1072752428, now seen corresponding path program 7 times [2024-05-12 11:22:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:22:11,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358065694] [2024-05-12 11:22:11,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:22:11,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:22:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:25,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358065694] [2024-05-12 11:22:25,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358065694] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:25,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:25,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:22:25,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098903342] [2024-05-12 11:22:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:25,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:22:25,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:25,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:22:25,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:22:25,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:22:25,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 232 transitions, 2312 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:25,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:25,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:22:25,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:22:28,974 INFO L124 PetriNetUnfolderBase]: 5126/8076 cut-off events. [2024-05-12 11:22:28,974 INFO L125 PetriNetUnfolderBase]: For 264907/264919 co-relation queries the response was YES. [2024-05-12 11:22:29,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49007 conditions, 8076 events. 5126/8076 cut-off events. For 264907/264919 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 51024 event pairs, 1524 based on Foata normal form. 4/7933 useless extension candidates. Maximal degree in co-relation 48926. Up to 7099 conditions per place. [2024-05-12 11:22:29,046 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 246 selfloop transitions, 23 changer transitions 0/283 dead transitions. [2024-05-12 11:22:29,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 283 transitions, 3072 flow [2024-05-12 11:22:29,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:22:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:22:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2024-05-12 11:22:29,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988662131519274 [2024-05-12 11:22:29,048 INFO L175 Difference]: Start difference. First operand has 181 places, 232 transitions, 2312 flow. Second operand 9 states and 220 transitions. [2024-05-12 11:22:29,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 283 transitions, 3072 flow [2024-05-12 11:22:29,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 283 transitions, 2982 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-05-12 11:22:29,324 INFO L231 Difference]: Finished difference. Result has 185 places, 235 transitions, 2358 flow [2024-05-12 11:22:29,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2222, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2358, PETRI_PLACES=185, PETRI_TRANSITIONS=235} [2024-05-12 11:22:29,325 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 130 predicate places. [2024-05-12 11:22:29,325 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 235 transitions, 2358 flow [2024-05-12 11:22:29,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:29,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:22:29,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:22:29,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 11:22:29,326 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:22:29,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:22:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash 816972668, now seen corresponding path program 8 times [2024-05-12 11:22:29,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:22:29,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183967098] [2024-05-12 11:22:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:22:29,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:22:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:42,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:42,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183967098] [2024-05-12 11:22:42,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183967098] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:42,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:42,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:22:42,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691587704] [2024-05-12 11:22:42,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:42,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:22:42,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:42,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:22:42,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:22:42,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:22:42,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 235 transitions, 2358 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:42,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:42,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:22:42,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:22:46,069 INFO L124 PetriNetUnfolderBase]: 5172/8131 cut-off events. [2024-05-12 11:22:46,069 INFO L125 PetriNetUnfolderBase]: For 272948/272960 co-relation queries the response was YES. [2024-05-12 11:22:46,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50174 conditions, 8131 events. 5172/8131 cut-off events. For 272948/272960 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 51212 event pairs, 1494 based on Foata normal form. 4/7993 useless extension candidates. Maximal degree in co-relation 50093. Up to 7020 conditions per place. [2024-05-12 11:22:46,142 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 239 selfloop transitions, 36 changer transitions 0/289 dead transitions. [2024-05-12 11:22:46,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 289 transitions, 3154 flow [2024-05-12 11:22:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:22:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:22:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-05-12 11:22:46,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-05-12 11:22:46,143 INFO L175 Difference]: Start difference. First operand has 185 places, 235 transitions, 2358 flow. Second operand 9 states and 225 transitions. [2024-05-12 11:22:46,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 289 transitions, 3154 flow [2024-05-12 11:22:46,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 289 transitions, 3042 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-05-12 11:22:46,366 INFO L231 Difference]: Finished difference. Result has 187 places, 238 transitions, 2414 flow [2024-05-12 11:22:46,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2414, PETRI_PLACES=187, PETRI_TRANSITIONS=238} [2024-05-12 11:22:46,367 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 132 predicate places. [2024-05-12 11:22:46,367 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 238 transitions, 2414 flow [2024-05-12 11:22:46,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:46,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:22:46,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:22:46,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 11:22:46,368 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:22:46,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:22:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1509958786, now seen corresponding path program 9 times [2024-05-12 11:22:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:22:46,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623565673] [2024-05-12 11:22:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:22:46,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:22:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:59,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:59,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623565673] [2024-05-12 11:22:59,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623565673] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:59,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:59,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:22:59,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320149894] [2024-05-12 11:22:59,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:59,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:22:59,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:59,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:22:59,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:22:59,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:22:59,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 238 transitions, 2414 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:59,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:59,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:22:59,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:03,385 INFO L124 PetriNetUnfolderBase]: 5218/8173 cut-off events. [2024-05-12 11:23:03,385 INFO L125 PetriNetUnfolderBase]: For 289217/289229 co-relation queries the response was YES. [2024-05-12 11:23:03,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51479 conditions, 8173 events. 5218/8173 cut-off events. For 289217/289229 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 51217 event pairs, 1458 based on Foata normal form. 4/8041 useless extension candidates. Maximal degree in co-relation 51397. Up to 6840 conditions per place. [2024-05-12 11:23:03,459 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 224 selfloop transitions, 67 changer transitions 0/305 dead transitions. [2024-05-12 11:23:03,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 305 transitions, 3732 flow [2024-05-12 11:23:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:23:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:23:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-05-12 11:23:03,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528344671201814 [2024-05-12 11:23:03,461 INFO L175 Difference]: Start difference. First operand has 187 places, 238 transitions, 2414 flow. Second operand 9 states and 233 transitions. [2024-05-12 11:23:03,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 305 transitions, 3732 flow [2024-05-12 11:23:03,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 305 transitions, 3588 flow, removed 38 selfloop flow, removed 7 redundant places. [2024-05-12 11:23:03,763 INFO L231 Difference]: Finished difference. Result has 190 places, 247 transitions, 2689 flow [2024-05-12 11:23:03,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2689, PETRI_PLACES=190, PETRI_TRANSITIONS=247} [2024-05-12 11:23:03,764 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 135 predicate places. [2024-05-12 11:23:03,764 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 247 transitions, 2689 flow [2024-05-12 11:23:03,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:03,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:03,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:03,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 11:23:03,764 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:23:03,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:03,765 INFO L85 PathProgramCache]: Analyzing trace with hash 817145648, now seen corresponding path program 10 times [2024-05-12 11:23:03,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:03,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445356297] [2024-05-12 11:23:03,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:03,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:23:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:23:18,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:23:18,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445356297] [2024-05-12 11:23:18,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445356297] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:23:18,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:23:18,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:23:18,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371030720] [2024-05-12 11:23:18,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:23:18,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:23:18,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:23:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:23:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:23:18,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:23:18,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 247 transitions, 2689 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:18,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:23:18,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:23:18,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:22,043 INFO L124 PetriNetUnfolderBase]: 5241/8245 cut-off events. [2024-05-12 11:23:22,043 INFO L125 PetriNetUnfolderBase]: For 306042/306054 co-relation queries the response was YES. [2024-05-12 11:23:22,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52904 conditions, 8245 events. 5241/8245 cut-off events. For 306042/306054 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 52032 event pairs, 1510 based on Foata normal form. 4/8103 useless extension candidates. Maximal degree in co-relation 52820. Up to 7116 conditions per place. [2024-05-12 11:23:22,131 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 252 selfloop transitions, 35 changer transitions 0/301 dead transitions. [2024-05-12 11:23:22,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 301 transitions, 3521 flow [2024-05-12 11:23:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:23:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:23:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2024-05-12 11:23:22,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124716553287982 [2024-05-12 11:23:22,133 INFO L175 Difference]: Start difference. First operand has 190 places, 247 transitions, 2689 flow. Second operand 9 states and 226 transitions. [2024-05-12 11:23:22,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 301 transitions, 3521 flow [2024-05-12 11:23:22,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 301 transitions, 3265 flow, removed 95 selfloop flow, removed 4 redundant places. [2024-05-12 11:23:22,445 INFO L231 Difference]: Finished difference. Result has 195 places, 250 transitions, 2611 flow [2024-05-12 11:23:22,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2459, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2611, PETRI_PLACES=195, PETRI_TRANSITIONS=250} [2024-05-12 11:23:22,446 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 140 predicate places. [2024-05-12 11:23:22,446 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 250 transitions, 2611 flow [2024-05-12 11:23:22,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:22,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:22,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:22,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 11:23:22,447 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:23:22,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash 816967894, now seen corresponding path program 5 times [2024-05-12 11:23:22,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:22,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619117361] [2024-05-12 11:23:22,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:22,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:23:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:23:35,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:23:35,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619117361] [2024-05-12 11:23:35,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619117361] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:23:35,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:23:35,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:23:35,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711054735] [2024-05-12 11:23:35,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:23:35,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:23:35,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:23:35,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:23:35,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:23:36,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:23:36,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 250 transitions, 2611 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:36,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:23:36,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:23:36,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:39,431 INFO L124 PetriNetUnfolderBase]: 5246/8264 cut-off events. [2024-05-12 11:23:39,431 INFO L125 PetriNetUnfolderBase]: For 302830/302842 co-relation queries the response was YES. [2024-05-12 11:23:39,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52195 conditions, 8264 events. 5246/8264 cut-off events. For 302830/302842 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 52321 event pairs, 1557 based on Foata normal form. 4/8118 useless extension candidates. Maximal degree in co-relation 52109. Up to 7314 conditions per place. [2024-05-12 11:23:39,515 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 268 selfloop transitions, 21 changer transitions 0/303 dead transitions. [2024-05-12 11:23:39,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 303 transitions, 3424 flow [2024-05-12 11:23:39,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:23:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:23:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2024-05-12 11:23:39,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943310657596372 [2024-05-12 11:23:39,516 INFO L175 Difference]: Start difference. First operand has 195 places, 250 transitions, 2611 flow. Second operand 9 states and 218 transitions. [2024-05-12 11:23:39,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 303 transitions, 3424 flow [2024-05-12 11:23:39,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 303 transitions, 3302 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-05-12 11:23:39,859 INFO L231 Difference]: Finished difference. Result has 198 places, 255 transitions, 2637 flow [2024-05-12 11:23:39,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2489, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2637, PETRI_PLACES=198, PETRI_TRANSITIONS=255} [2024-05-12 11:23:39,859 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 143 predicate places. [2024-05-12 11:23:39,860 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 255 transitions, 2637 flow [2024-05-12 11:23:39,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:39,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:39,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:39,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 11:23:39,860 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:23:39,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -149408402, now seen corresponding path program 2 times [2024-05-12 11:23:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744207202] [2024-05-12 11:23:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:39,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:23:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:23:55,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:23:55,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744207202] [2024-05-12 11:23:55,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744207202] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:23:55,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:23:55,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:23:55,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142308829] [2024-05-12 11:23:55,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:23:55,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:23:55,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:23:55,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:23:55,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:23:55,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:23:55,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 255 transitions, 2637 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-05-12 11:23:55,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:23:55,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:23:55,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:59,034 INFO L124 PetriNetUnfolderBase]: 6029/9504 cut-off events. [2024-05-12 11:23:59,034 INFO L125 PetriNetUnfolderBase]: For 350848/350917 co-relation queries the response was YES. [2024-05-12 11:23:59,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56463 conditions, 9504 events. 6029/9504 cut-off events. For 350848/350917 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 60900 event pairs, 2184 based on Foata normal form. 44/9338 useless extension candidates. Maximal degree in co-relation 56375. Up to 8466 conditions per place. [2024-05-12 11:23:59,129 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 211 selfloop transitions, 13 changer transitions 0/272 dead transitions. [2024-05-12 11:23:59,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 272 transitions, 3133 flow [2024-05-12 11:23:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:23:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:23:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-05-12 11:23:59,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47278911564625853 [2024-05-12 11:23:59,130 INFO L175 Difference]: Start difference. First operand has 198 places, 255 transitions, 2637 flow. Second operand 6 states and 139 transitions. [2024-05-12 11:23:59,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 272 transitions, 3133 flow [2024-05-12 11:23:59,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 272 transitions, 3022 flow, removed 38 selfloop flow, removed 6 redundant places. [2024-05-12 11:23:59,500 INFO L231 Difference]: Finished difference. Result has 198 places, 255 transitions, 2558 flow [2024-05-12 11:23:59,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2558, PETRI_PLACES=198, PETRI_TRANSITIONS=255} [2024-05-12 11:23:59,501 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 143 predicate places. [2024-05-12 11:23:59,501 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 255 transitions, 2558 flow [2024-05-12 11:23:59,501 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-05-12 11:23:59,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:59,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:59,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 11:23:59,502 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:23:59,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:59,502 INFO L85 PathProgramCache]: Analyzing trace with hash -156067729, now seen corresponding path program 1 times [2024-05-12 11:23:59,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:59,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444157086] [2024-05-12 11:23:59,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:59,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:18,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:18,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444157086] [2024-05-12 11:24:18,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444157086] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:18,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:18,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:24:18,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048325877] [2024-05-12 11:24:18,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:18,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:24:18,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:24:18,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:24:18,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2024-05-12 11:24:18,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 255 transitions, 2558 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-05-12 11:24:18,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:18,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2024-05-12 11:24:18,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:24:22,414 INFO L124 PetriNetUnfolderBase]: 6823/10439 cut-off events. [2024-05-12 11:24:22,414 INFO L125 PetriNetUnfolderBase]: For 369054/369054 co-relation queries the response was YES. [2024-05-12 11:24:22,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62760 conditions, 10439 events. 6823/10439 cut-off events. For 369054/369054 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 64086 event pairs, 2284 based on Foata normal form. 1/10253 useless extension candidates. Maximal degree in co-relation 62671. Up to 9634 conditions per place. [2024-05-12 11:24:22,517 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 253 selfloop transitions, 24 changer transitions 0/285 dead transitions. [2024-05-12 11:24:22,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 285 transitions, 3354 flow [2024-05-12 11:24:22,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:24:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:24:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-05-12 11:24:22,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46598639455782315 [2024-05-12 11:24:22,518 INFO L175 Difference]: Start difference. First operand has 198 places, 255 transitions, 2558 flow. Second operand 6 states and 137 transitions. [2024-05-12 11:24:22,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 285 transitions, 3354 flow [2024-05-12 11:24:22,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 285 transitions, 3303 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-05-12 11:24:22,942 INFO L231 Difference]: Finished difference. Result has 199 places, 261 transitions, 2648 flow [2024-05-12 11:24:22,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2507, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2648, PETRI_PLACES=199, PETRI_TRANSITIONS=261} [2024-05-12 11:24:22,942 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 144 predicate places. [2024-05-12 11:24:22,942 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 261 transitions, 2648 flow [2024-05-12 11:24:22,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-05-12 11:24:22,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:24:22,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:24:22,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 11:24:22,943 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:24:22,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:24:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash 337681361, now seen corresponding path program 2 times [2024-05-12 11:24:22,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:24:22,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623149178] [2024-05-12 11:24:22,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:24:22,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:24:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:41,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:41,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623149178] [2024-05-12 11:24:41,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623149178] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:41,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:41,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:24:41,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488075457] [2024-05-12 11:24:41,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:41,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:24:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:41,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:24:41,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:24:42,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2024-05-12 11:24:42,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 261 transitions, 2648 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-05-12 11:24:42,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:42,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2024-05-12 11:24:42,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:24:45,954 INFO L124 PetriNetUnfolderBase]: 6820/10439 cut-off events. [2024-05-12 11:24:45,954 INFO L125 PetriNetUnfolderBase]: For 383506/383512 co-relation queries the response was YES. [2024-05-12 11:24:46,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63737 conditions, 10439 events. 6820/10439 cut-off events. For 383506/383512 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 64081 event pairs, 2284 based on Foata normal form. 5/10255 useless extension candidates. Maximal degree in co-relation 63648. Up to 9631 conditions per place. [2024-05-12 11:24:46,058 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 249 selfloop transitions, 24 changer transitions 0/281 dead transitions. [2024-05-12 11:24:46,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 281 transitions, 3258 flow [2024-05-12 11:24:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:24:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:24:46,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-05-12 11:24:46,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-05-12 11:24:46,060 INFO L175 Difference]: Start difference. First operand has 199 places, 261 transitions, 2648 flow. Second operand 6 states and 133 transitions. [2024-05-12 11:24:46,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 281 transitions, 3258 flow [2024-05-12 11:24:46,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 281 transitions, 3185 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-05-12 11:24:46,672 INFO L231 Difference]: Finished difference. Result has 203 places, 261 transitions, 2630 flow [2024-05-12 11:24:46,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2630, PETRI_PLACES=203, PETRI_TRANSITIONS=261} [2024-05-12 11:24:46,673 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 148 predicate places. [2024-05-12 11:24:46,673 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 261 transitions, 2630 flow [2024-05-12 11:24:46,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-05-12 11:24:46,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:24:46,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:24:46,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 11:24:46,674 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:24:46,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:24:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash 178262637, now seen corresponding path program 1 times [2024-05-12 11:24:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:24:46,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313356855] [2024-05-12 11:24:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:24:46,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:24:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:25:00,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313356855] [2024-05-12 11:25:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313356855] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:00,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:00,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:25:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294269610] [2024-05-12 11:25:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:00,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:25:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:00,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:25:00,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:25:00,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:25:00,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 261 transitions, 2630 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:00,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:00,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:25:00,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:04,889 INFO L124 PetriNetUnfolderBase]: 5777/9042 cut-off events. [2024-05-12 11:25:04,890 INFO L125 PetriNetUnfolderBase]: For 406020/406042 co-relation queries the response was YES. [2024-05-12 11:25:04,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60006 conditions, 9042 events. 5777/9042 cut-off events. For 406020/406042 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 57380 event pairs, 1197 based on Foata normal form. 16/8847 useless extension candidates. Maximal degree in co-relation 59915. Up to 7250 conditions per place. [2024-05-12 11:25:04,987 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 305 selfloop transitions, 40 changer transitions 0/361 dead transitions. [2024-05-12 11:25:04,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 361 transitions, 3985 flow [2024-05-12 11:25:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:25:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:25:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 290 transitions. [2024-05-12 11:25:04,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5380333951762524 [2024-05-12 11:25:04,988 INFO L175 Difference]: Start difference. First operand has 203 places, 261 transitions, 2630 flow. Second operand 11 states and 290 transitions. [2024-05-12 11:25:04,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 361 transitions, 3985 flow [2024-05-12 11:25:05,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 361 transitions, 3921 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 11:25:05,395 INFO L231 Difference]: Finished difference. Result has 212 places, 273 transitions, 2862 flow [2024-05-12 11:25:05,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2566, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2862, PETRI_PLACES=212, PETRI_TRANSITIONS=273} [2024-05-12 11:25:05,395 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 157 predicate places. [2024-05-12 11:25:05,396 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 273 transitions, 2862 flow [2024-05-12 11:25:05,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:05,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:05,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:05,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 11:25:05,396 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:25:05,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:05,396 INFO L85 PathProgramCache]: Analyzing trace with hash 180136587, now seen corresponding path program 2 times [2024-05-12 11:25:05,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:05,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759398466] [2024-05-12 11:25:05,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:05,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:25:19,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:19,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759398466] [2024-05-12 11:25:19,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759398466] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:19,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:19,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:25:19,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899890852] [2024-05-12 11:25:19,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:19,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:25:19,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:19,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:25:19,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:25:19,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:25:19,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 273 transitions, 2862 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:19,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:19,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:25:19,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:24,162 INFO L124 PetriNetUnfolderBase]: 6029/9466 cut-off events. [2024-05-12 11:25:24,163 INFO L125 PetriNetUnfolderBase]: For 471062/471084 co-relation queries the response was YES. [2024-05-12 11:25:24,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66426 conditions, 9466 events. 6029/9466 cut-off events. For 471062/471084 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 60963 event pairs, 1529 based on Foata normal form. 16/9281 useless extension candidates. Maximal degree in co-relation 66331. Up to 7853 conditions per place. [2024-05-12 11:25:24,268 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 310 selfloop transitions, 37 changer transitions 0/363 dead transitions. [2024-05-12 11:25:24,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 363 transitions, 4180 flow [2024-05-12 11:25:24,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:25:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:25:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 291 transitions. [2024-05-12 11:25:24,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5398886827458256 [2024-05-12 11:25:24,270 INFO L175 Difference]: Start difference. First operand has 212 places, 273 transitions, 2862 flow. Second operand 11 states and 291 transitions. [2024-05-12 11:25:24,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 363 transitions, 4180 flow [2024-05-12 11:25:24,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 363 transitions, 4113 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-05-12 11:25:24,713 INFO L231 Difference]: Finished difference. Result has 218 places, 275 transitions, 2983 flow [2024-05-12 11:25:24,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2807, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2983, PETRI_PLACES=218, PETRI_TRANSITIONS=275} [2024-05-12 11:25:24,714 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 163 predicate places. [2024-05-12 11:25:24,714 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 275 transitions, 2983 flow [2024-05-12 11:25:24,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:24,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:24,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:24,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 11:25:24,715 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:25:24,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:24,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1059424879, now seen corresponding path program 3 times [2024-05-12 11:25:24,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:24,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140796977] [2024-05-12 11:25:24,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:24,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15