./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix042.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix042.opt.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/mix042.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix042.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 11:51:52,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:51:52,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:51:52,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:51:52,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:51:52,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:51:52,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:51:52,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:51:52,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:51:52,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:51:52,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:51:52,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:51:52,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:51:52,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:51:52,948 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:51:52,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:51:52,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:51:52,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:51:52,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:51:52,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:51:52,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:51:52,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:51:52,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:51:52,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:51:52,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:51:52,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:51:52,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:51:52,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:51:52,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:51:52,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:51:52,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:51:52,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:51:52,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:51:52,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:51:52,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:51:52,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:51:52,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:51:52,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:51:52,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:51:52,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:51:52,959 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:51:52,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:51:52,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:51:52,960 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:51:53,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:51:53,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:51:53,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:51:53,155 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:51:53,156 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:51:53,157 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/mix042.opt.yml/witness.yml [2024-05-12 11:51:53,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:51:53,339 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:51:53,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2024-05-12 11:51:54,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:51:54,481 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:51:54,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2024-05-12 11:51:54,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8dc2c67/707ef2eccd674f4fb1fd35a8cc38c0fd/FLAGb70792030 [2024-05-12 11:51:54,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8dc2c67/707ef2eccd674f4fb1fd35a8cc38c0fd [2024-05-12 11:51:54,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:51:54,509 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:51:54,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:51:54,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:51:54,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:51:54,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:51:53" (1/2) ... [2024-05-12 11:51:54,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e6f0d0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:51:54, skipping insertion in model container [2024-05-12 11:51:54,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:51:53" (1/2) ... [2024-05-12 11:51:54,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@26a1850 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:51:54, skipping insertion in model container [2024-05-12 11:51:54,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:51:54" (2/2) ... [2024-05-12 11:51:54,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e6f0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:54, skipping insertion in model container [2024-05-12 11:51:54,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:51:54" (2/2) ... [2024-05-12 11:51:54,516 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:51:54,588 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:51:54,589 INFO L97 edCorrectnessWitness]: Location invariant before [L830-L830] ((((((((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) [2024-05-12 11:51:54,590 INFO L97 edCorrectnessWitness]: Location invariant before [L828-L828] ((((((((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) [2024-05-12 11:51:54,590 INFO L97 edCorrectnessWitness]: Location invariant before [L831-L831] ((((((((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) [2024-05-12 11:51:54,591 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:51:54,591 INFO L106 edCorrectnessWitness]: ghost_update [L826-L826] multithreaded = 1; [2024-05-12 11:51:54,633 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:51:54,804 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/mix042.opt.i[944,957] [2024-05-12 11:51:54,997 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:51:55,008 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:51:55,037 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/mix042.opt.i[944,957] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:51:55,287 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:51:55,333 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:51:55,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:55 WrapperNode [2024-05-12 11:51:55,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:51:55,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:51:55,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:51:55,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:51:55,339 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:51:55" (1/1) ... [2024-05-12 11:51:55,372 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:51:55" (1/1) ... [2024-05-12 11:51:55,583 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2024-05-12 11:51:55,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:51:55,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:51:55,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:51:55,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:51:55,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:55" (1/1) ... [2024-05-12 11:51:55,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:55" (1/1) ... [2024-05-12 11:51:55,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:55" (1/1) ... [2024-05-12 11:51:55,671 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:51:55,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:55" (1/1) ... [2024-05-12 11:51:55,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:55" (1/1) ... [2024-05-12 11:51:55,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:55" (1/1) ... [2024-05-12 11:51:55,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:55" (1/1) ... [2024-05-12 11:51:55,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:55" (1/1) ... [2024-05-12 11:51:55,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:55" (1/1) ... [2024-05-12 11:51:55,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:51:55,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:51:55,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:51:55,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:51:55,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:55" (1/1) ... [2024-05-12 11:51:55,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:51:55,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:51:55,764 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:51:55,786 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:51:55,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:51:55,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:51:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:51:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 11:51:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:51:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:51:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:51:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:51:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:51:55,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:51:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:51:55,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:51:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 11:51:55,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 11:51:55,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:51:55,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:51:55,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:51:55,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 11:51:55,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:51:55,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:51:55,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:51:55,802 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:51:55,948 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:51:55,950 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:51:57,230 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:51:57,230 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:51:57,513 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:51:57,513 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:51:57,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:51:57 BoogieIcfgContainer [2024-05-12 11:51:57,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:51:57,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:51:57,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:51:57,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:51:57,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:51:53" (1/4) ... [2024-05-12 11:51:57,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2d8fe1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:51:57, skipping insertion in model container [2024-05-12 11:51:57,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:51:54" (2/4) ... [2024-05-12 11:51:57,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2d8fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:51:57, skipping insertion in model container [2024-05-12 11:51:57,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:51:55" (3/4) ... [2024-05-12 11:51:57,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2d8fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:51:57, skipping insertion in model container [2024-05-12 11:51:57,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:51:57" (4/4) ... [2024-05-12 11:51:57,521 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.opt.i [2024-05-12 11:51:57,533 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:51:57,533 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 11:51:57,533 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:51:57,651 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:51:57,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 110 flow [2024-05-12 11:51:57,720 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-05-12 11:51:57,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:51:57,724 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 5. 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:51:57,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 49 transitions, 110 flow [2024-05-12 11:51:57,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 46 transitions, 101 flow [2024-05-12 11:51:57,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:51:57,737 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;@5bfdf30a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:51:57,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 11:51:57,745 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:51:57,745 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-05-12 11:51:57,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:51:57,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:51:57,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:51:57,746 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:51:57,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:51:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1903421879, now seen corresponding path program 1 times [2024-05-12 11:51:57,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:51:57,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144778510] [2024-05-12 11:51:57,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:51:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:51:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:52:04,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:52:04,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:52:04,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144778510] [2024-05-12 11:52:04,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144778510] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:52:04,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:52:04,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:52:04,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475678230] [2024-05-12 11:52:04,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:52:04,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:52:04,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:52:04,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:52:04,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:52:04,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-05-12 11:52:04,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:52:04,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:52:04,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-05-12 11:52:04,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:52:05,500 INFO L124 PetriNetUnfolderBase]: 3270/5351 cut-off events. [2024-05-12 11:52:05,500 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-05-12 11:52:05,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10140 conditions, 5351 events. 3270/5351 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 34314 event pairs, 2609 based on Foata normal form. 169/5081 useless extension candidates. Maximal degree in co-relation 10125. Up to 4711 conditions per place. [2024-05-12 11:52:05,534 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 44 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2024-05-12 11:52:05,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 235 flow [2024-05-12 11:52:05,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:52:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:52:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-05-12 11:52:05,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2024-05-12 11:52:05,544 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 101 flow. Second operand 3 states and 99 transitions. [2024-05-12 11:52:05,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 235 flow [2024-05-12 11:52:05,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 11:52:05,551 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 133 flow [2024-05-12 11:52:05,552 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:52:05,555 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2024-05-12 11:52:05,555 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 133 flow [2024-05-12 11:52:05,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:52:05,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:52:05,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:52:05,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:52:05,556 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:52:05,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:52:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash -467621482, now seen corresponding path program 1 times [2024-05-12 11:52:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:52:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548690157] [2024-05-12 11:52:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:52:05,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:52:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:52:10,349 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:52:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:52:10,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548690157] [2024-05-12 11:52:10,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548690157] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:52:10,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:52:10,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:52:10,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583398949] [2024-05-12 11:52:10,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:52:10,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:52:10,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:52:10,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:52:10,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:52:10,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:52:10,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:52:10,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:52:10,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:52:10,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:52:11,550 INFO L124 PetriNetUnfolderBase]: 3735/6029 cut-off events. [2024-05-12 11:52:11,551 INFO L125 PetriNetUnfolderBase]: For 886/886 co-relation queries the response was YES. [2024-05-12 11:52:11,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12780 conditions, 6029 events. 3735/6029 cut-off events. For 886/886 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 38514 event pairs, 2522 based on Foata normal form. 3/5618 useless extension candidates. Maximal degree in co-relation 12765. Up to 5340 conditions per place. [2024-05-12 11:52:11,587 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 57 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2024-05-12 11:52:11,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 335 flow [2024-05-12 11:52:11,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:52:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:52:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-05-12 11:52:11,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6377551020408163 [2024-05-12 11:52:11,593 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 133 flow. Second operand 4 states and 125 transitions. [2024-05-12 11:52:11,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 335 flow [2024-05-12 11:52:11,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:52:11,596 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 179 flow [2024-05-12 11:52:11,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-05-12 11:52:11,601 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2024-05-12 11:52:11,601 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 179 flow [2024-05-12 11:52:11,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:52:11,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:52:11,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:52:11,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:52:11,602 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:52:11,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:52:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1963047987, now seen corresponding path program 1 times [2024-05-12 11:52:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:52:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293892726] [2024-05-12 11:52:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:52:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:52:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:52:16,561 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:52:16,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:52:16,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293892726] [2024-05-12 11:52:16,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293892726] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:52:16,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:52:16,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:52:16,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280752423] [2024-05-12 11:52:16,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:52:16,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:52:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:52:16,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:52:16,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:52:16,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:52:16,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:52:16,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:52:16,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:52:16,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:52:18,231 INFO L124 PetriNetUnfolderBase]: 4757/7001 cut-off events. [2024-05-12 11:52:18,232 INFO L125 PetriNetUnfolderBase]: For 2458/2458 co-relation queries the response was YES. [2024-05-12 11:52:18,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16897 conditions, 7001 events. 4757/7001 cut-off events. For 2458/2458 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 39697 event pairs, 1360 based on Foata normal form. 6/6707 useless extension candidates. Maximal degree in co-relation 16880. Up to 6690 conditions per place. [2024-05-12 11:52:18,272 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 79 selfloop transitions, 16 changer transitions 0/105 dead transitions. [2024-05-12 11:52:18,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 105 transitions, 510 flow [2024-05-12 11:52:18,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:52:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:52:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2024-05-12 11:52:18,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5986394557823129 [2024-05-12 11:52:18,275 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 179 flow. Second operand 6 states and 176 transitions. [2024-05-12 11:52:18,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 105 transitions, 510 flow [2024-05-12 11:52:18,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 482 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-05-12 11:52:18,278 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 239 flow [2024-05-12 11:52:18,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2024-05-12 11:52:18,279 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2024-05-12 11:52:18,280 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 239 flow [2024-05-12 11:52:18,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:52:18,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:52:18,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:52:18,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:52:18,281 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:52:18,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:52:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1727165811, now seen corresponding path program 1 times [2024-05-12 11:52:18,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:52:18,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092737381] [2024-05-12 11:52:18,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:52:18,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:52:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:52:30,533 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:52:30,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:52:30,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092737381] [2024-05-12 11:52:30,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092737381] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:52:30,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:52:30,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:52:30,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851912981] [2024-05-12 11:52:30,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:52:30,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:52:30,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:52:30,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:52:30,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:52:30,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:52:30,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 239 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:52:30,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:52:30,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:52:30,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:52:32,574 INFO L124 PetriNetUnfolderBase]: 4672/7189 cut-off events. [2024-05-12 11:52:32,574 INFO L125 PetriNetUnfolderBase]: For 4487/4487 co-relation queries the response was YES. [2024-05-12 11:52:32,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18464 conditions, 7189 events. 4672/7189 cut-off events. For 4487/4487 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 42914 event pairs, 1621 based on Foata normal form. 2/6894 useless extension candidates. Maximal degree in co-relation 18445. Up to 6651 conditions per place. [2024-05-12 11:52:32,612 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 66 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2024-05-12 11:52:32,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 465 flow [2024-05-12 11:52:32,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:52:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:52:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-05-12 11:52:32,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5387755102040817 [2024-05-12 11:52:32,614 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 239 flow. Second operand 5 states and 132 transitions. [2024-05-12 11:52:32,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 86 transitions, 465 flow [2024-05-12 11:52:32,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 427 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 11:52:32,623 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 260 flow [2024-05-12 11:52:32,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2024-05-12 11:52:32,625 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2024-05-12 11:52:32,625 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 260 flow [2024-05-12 11:52:32,625 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:52:32,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:52:32,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:52:32,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:52:32,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:52:32,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:52:32,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2002533909, now seen corresponding path program 1 times [2024-05-12 11:52:32,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:52:32,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176581326] [2024-05-12 11:52:32,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:52:32,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:52:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:52:45,506 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:52:45,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:52:45,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176581326] [2024-05-12 11:52:45,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176581326] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:52:45,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:52:45,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:52:45,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469627177] [2024-05-12 11:52:45,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:52:45,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:52:45,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:52:45,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:52:45,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:52:45,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:52:45,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 260 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:52:45,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:52:45,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:52:45,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:52:47,560 INFO L124 PetriNetUnfolderBase]: 4660/7571 cut-off events. [2024-05-12 11:52:47,561 INFO L125 PetriNetUnfolderBase]: For 6879/6879 co-relation queries the response was YES. [2024-05-12 11:52:47,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20010 conditions, 7571 events. 4660/7571 cut-off events. For 6879/6879 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 49291 event pairs, 2093 based on Foata normal form. 4/7093 useless extension candidates. Maximal degree in co-relation 19989. Up to 6614 conditions per place. [2024-05-12 11:52:47,602 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 76 selfloop transitions, 17 changer transitions 0/103 dead transitions. [2024-05-12 11:52:47,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 600 flow [2024-05-12 11:52:47,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:52:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:52:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-05-12 11:52:47,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-05-12 11:52:47,604 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 260 flow. Second operand 6 states and 154 transitions. [2024-05-12 11:52:47,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 600 flow [2024-05-12 11:52:47,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 103 transitions, 546 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-05-12 11:52:47,609 INFO L231 Difference]: Finished difference. Result has 69 places, 78 transitions, 384 flow [2024-05-12 11:52:47,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=69, PETRI_TRANSITIONS=78} [2024-05-12 11:52:47,609 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2024-05-12 11:52:47,610 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 78 transitions, 384 flow [2024-05-12 11:52:47,610 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:52:47,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:52:47,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:52:47,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:52:47,610 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:52:47,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:52:47,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2001686468, now seen corresponding path program 1 times [2024-05-12 11:52:47,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:52:47,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521968495] [2024-05-12 11:52:47,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:52:47,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:52:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:52:47,901 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:52:47,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:52:47,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521968495] [2024-05-12 11:52:47,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521968495] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:52:47,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:52:47,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:52:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439315430] [2024-05-12 11:52:47,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:52:47,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:52:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:52:47,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:52:47,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:52:47,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 49 [2024-05-12 11:52:47,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 78 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:52:47,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:52:47,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 49 [2024-05-12 11:52:47,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:52:48,390 INFO L124 PetriNetUnfolderBase]: 1271/2761 cut-off events. [2024-05-12 11:52:48,390 INFO L125 PetriNetUnfolderBase]: For 3758/3920 co-relation queries the response was YES. [2024-05-12 11:52:48,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6553 conditions, 2761 events. 1271/2761 cut-off events. For 3758/3920 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 21895 event pairs, 432 based on Foata normal form. 11/2538 useless extension candidates. Maximal degree in co-relation 6529. Up to 1608 conditions per place. [2024-05-12 11:52:48,407 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 32 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2024-05-12 11:52:48,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 424 flow [2024-05-12 11:52:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:52:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:52:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-05-12 11:52:48,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7278911564625851 [2024-05-12 11:52:48,408 INFO L175 Difference]: Start difference. First operand has 69 places, 78 transitions, 384 flow. Second operand 3 states and 107 transitions. [2024-05-12 11:52:48,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 424 flow [2024-05-12 11:52:48,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 78 transitions, 410 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-05-12 11:52:48,411 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 326 flow [2024-05-12 11:52:48,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2024-05-12 11:52:48,412 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2024-05-12 11:52:48,412 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 326 flow [2024-05-12 11:52:48,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:52:48,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:52:48,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:52:48,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:52:48,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:52:48,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:52:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash -977480076, now seen corresponding path program 1 times [2024-05-12 11:52:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:52:48,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613879179] [2024-05-12 11:52:48,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:52:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:52:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:53:00,752 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:53:00,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:53:00,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613879179] [2024-05-12 11:53:00,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613879179] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:53:00,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:53:00,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:53:00,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837783159] [2024-05-12 11:53:00,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:53:00,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:53:00,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:53:00,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:53:00,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:53:00,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:53:00,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:00,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:53:00,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:53:00,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:53:02,757 INFO L124 PetriNetUnfolderBase]: 4697/7115 cut-off events. [2024-05-12 11:53:02,757 INFO L125 PetriNetUnfolderBase]: For 11442/11451 co-relation queries the response was YES. [2024-05-12 11:53:02,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20329 conditions, 7115 events. 4697/7115 cut-off events. For 11442/11451 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 41576 event pairs, 1619 based on Foata normal form. 8/7067 useless extension candidates. Maximal degree in co-relation 20304. Up to 6612 conditions per place. [2024-05-12 11:53:02,789 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 78 selfloop transitions, 21 changer transitions 4/112 dead transitions. [2024-05-12 11:53:02,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 112 transitions, 684 flow [2024-05-12 11:53:02,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:53:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:53:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-05-12 11:53:02,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5340136054421769 [2024-05-12 11:53:02,791 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 326 flow. Second operand 6 states and 157 transitions. [2024-05-12 11:53:02,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 112 transitions, 684 flow [2024-05-12 11:53:02,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 112 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:53:02,796 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 400 flow [2024-05-12 11:53:02,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2024-05-12 11:53:02,797 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2024-05-12 11:53:02,797 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 400 flow [2024-05-12 11:53:02,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:02,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:53:02,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:53:02,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:53:02,798 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:53:02,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:53:02,798 INFO L85 PathProgramCache]: Analyzing trace with hash -971090976, now seen corresponding path program 2 times [2024-05-12 11:53:02,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:53:02,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944097144] [2024-05-12 11:53:02,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:53:02,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:53:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:53:15,004 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:53:15,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:53:15,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944097144] [2024-05-12 11:53:15,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944097144] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:53:15,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:53:15,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:53:15,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238750376] [2024-05-12 11:53:15,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:53:15,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:53:15,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:53:15,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:53:15,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:53:15,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:53:15,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 400 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:15,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:53:15,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:53:15,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:53:17,003 INFO L124 PetriNetUnfolderBase]: 4166/6347 cut-off events. [2024-05-12 11:53:17,003 INFO L125 PetriNetUnfolderBase]: For 12421/12427 co-relation queries the response was YES. [2024-05-12 11:53:17,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19178 conditions, 6347 events. 4166/6347 cut-off events. For 12421/12427 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 36710 event pairs, 1445 based on Foata normal form. 6/6296 useless extension candidates. Maximal degree in co-relation 19151. Up to 5879 conditions per place. [2024-05-12 11:53:17,032 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 74 selfloop transitions, 21 changer transitions 0/104 dead transitions. [2024-05-12 11:53:17,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 104 transitions, 664 flow [2024-05-12 11:53:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:53:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:53:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-05-12 11:53:17,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2024-05-12 11:53:17,034 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 400 flow. Second operand 6 states and 148 transitions. [2024-05-12 11:53:17,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 104 transitions, 664 flow [2024-05-12 11:53:17,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 104 transitions, 625 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-05-12 11:53:17,043 INFO L231 Difference]: Finished difference. Result has 76 places, 74 transitions, 412 flow [2024-05-12 11:53:17,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=76, PETRI_TRANSITIONS=74} [2024-05-12 11:53:17,044 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 21 predicate places. [2024-05-12 11:53:17,044 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 74 transitions, 412 flow [2024-05-12 11:53:17,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:17,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:53:17,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:53:17,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:53:17,045 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:53:17,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:53:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash 386426802, now seen corresponding path program 1 times [2024-05-12 11:53:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:53:17,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594095642] [2024-05-12 11:53:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:53:17,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:53:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:53:29,468 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:53:29,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:53:29,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594095642] [2024-05-12 11:53:29,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594095642] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:53:29,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:53:29,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:53:29,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089272302] [2024-05-12 11:53:29,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:53:29,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:53:29,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:53:29,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:53:29,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:53:29,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:53:29,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 74 transitions, 412 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:29,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:53:29,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:53:29,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:53:31,370 INFO L124 PetriNetUnfolderBase]: 4272/6505 cut-off events. [2024-05-12 11:53:31,370 INFO L125 PetriNetUnfolderBase]: For 13478/13478 co-relation queries the response was YES. [2024-05-12 11:53:31,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19754 conditions, 6505 events. 4272/6505 cut-off events. For 13478/13478 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 37638 event pairs, 1437 based on Foata normal form. 2/6449 useless extension candidates. Maximal degree in co-relation 19725. Up to 5990 conditions per place. [2024-05-12 11:53:31,397 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 92 selfloop transitions, 27 changer transitions 0/128 dead transitions. [2024-05-12 11:53:31,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 128 transitions, 841 flow [2024-05-12 11:53:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:53:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:53:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-05-12 11:53:31,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160349854227405 [2024-05-12 11:53:31,399 INFO L175 Difference]: Start difference. First operand has 76 places, 74 transitions, 412 flow. Second operand 7 states and 177 transitions. [2024-05-12 11:53:31,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 128 transitions, 841 flow [2024-05-12 11:53:31,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 128 transitions, 767 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-05-12 11:53:31,407 INFO L231 Difference]: Finished difference. Result has 78 places, 88 transitions, 520 flow [2024-05-12 11:53:31,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=520, PETRI_PLACES=78, PETRI_TRANSITIONS=88} [2024-05-12 11:53:31,408 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 23 predicate places. [2024-05-12 11:53:31,408 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 88 transitions, 520 flow [2024-05-12 11:53:31,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:31,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:53:31,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:53:31,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:53:31,409 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:53:31,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:53:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1440594320, now seen corresponding path program 2 times [2024-05-12 11:53:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:53:31,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52008326] [2024-05-12 11:53:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:53:31,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:53:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:53:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:53:44,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:53:44,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52008326] [2024-05-12 11:53:44,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52008326] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:53:44,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:53:44,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:53:44,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873704187] [2024-05-12 11:53:44,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:53:44,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:53:44,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:53:44,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:53:44,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:53:45,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:53:45,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 88 transitions, 520 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:45,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:53:45,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:53:45,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:53:46,875 INFO L124 PetriNetUnfolderBase]: 4298/6550 cut-off events. [2024-05-12 11:53:46,875 INFO L125 PetriNetUnfolderBase]: For 17414/17416 co-relation queries the response was YES. [2024-05-12 11:53:46,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21252 conditions, 6550 events. 4298/6550 cut-off events. For 17414/17416 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 37936 event pairs, 1397 based on Foata normal form. 2/6493 useless extension candidates. Maximal degree in co-relation 21222. Up to 5988 conditions per place. [2024-05-12 11:53:46,904 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 83 selfloop transitions, 30 changer transitions 0/122 dead transitions. [2024-05-12 11:53:46,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 122 transitions, 866 flow [2024-05-12 11:53:46,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:53:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:53:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-05-12 11:53:46,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136054421768708 [2024-05-12 11:53:46,905 INFO L175 Difference]: Start difference. First operand has 78 places, 88 transitions, 520 flow. Second operand 6 states and 151 transitions. [2024-05-12 11:53:46,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 122 transitions, 866 flow [2024-05-12 11:53:46,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 122 transitions, 824 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-05-12 11:53:46,916 INFO L231 Difference]: Finished difference. Result has 81 places, 91 transitions, 594 flow [2024-05-12 11:53:46,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=594, PETRI_PLACES=81, PETRI_TRANSITIONS=91} [2024-05-12 11:53:46,917 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 26 predicate places. [2024-05-12 11:53:46,917 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 91 transitions, 594 flow [2024-05-12 11:53:46,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:46,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:53:46,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:53:46,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:53:46,918 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:53:46,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:53:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1062258974, now seen corresponding path program 1 times [2024-05-12 11:53:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:53:46,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815434472] [2024-05-12 11:53:46,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:53:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:53:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:54:00,132 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:54:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:54:00,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815434472] [2024-05-12 11:54:00,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815434472] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:54:00,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:54:00,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:54:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373889084] [2024-05-12 11:54:00,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:54:00,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:54:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:54:00,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:54:00,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:54:00,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:54:00,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 91 transitions, 594 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:00,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:54:00,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:54:00,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:54:02,310 INFO L124 PetriNetUnfolderBase]: 4382/7045 cut-off events. [2024-05-12 11:54:02,310 INFO L125 PetriNetUnfolderBase]: For 23775/23777 co-relation queries the response was YES. [2024-05-12 11:54:02,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23282 conditions, 7045 events. 4382/7045 cut-off events. For 23775/23777 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 43805 event pairs, 1437 based on Foata normal form. 8/6851 useless extension candidates. Maximal degree in co-relation 23251. Up to 5948 conditions per place. [2024-05-12 11:54:02,344 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 123 selfloop transitions, 48 changer transitions 0/180 dead transitions. [2024-05-12 11:54:02,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 180 transitions, 1431 flow [2024-05-12 11:54:02,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:54:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:54:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-05-12 11:54:02,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-05-12 11:54:02,347 INFO L175 Difference]: Start difference. First operand has 81 places, 91 transitions, 594 flow. Second operand 9 states and 225 transitions. [2024-05-12 11:54:02,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 180 transitions, 1431 flow [2024-05-12 11:54:02,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 180 transitions, 1287 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-05-12 11:54:02,365 INFO L231 Difference]: Finished difference. Result has 88 places, 126 transitions, 965 flow [2024-05-12 11:54:02,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=965, PETRI_PLACES=88, PETRI_TRANSITIONS=126} [2024-05-12 11:54:02,365 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 33 predicate places. [2024-05-12 11:54:02,365 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 126 transitions, 965 flow [2024-05-12 11:54:02,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:02,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:54:02,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:54:02,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:54:02,366 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:54:02,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:54:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1440589670, now seen corresponding path program 3 times [2024-05-12 11:54:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:54:02,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266007246] [2024-05-12 11:54:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:54:02,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:54:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:54:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:54:15,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:54:15,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266007246] [2024-05-12 11:54:15,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266007246] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:54:15,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:54:15,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:54:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002421220] [2024-05-12 11:54:15,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:54:15,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:54:15,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:54:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:54:15,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:54:15,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:54:15,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 126 transitions, 965 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:15,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:54:15,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:54:15,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:54:17,769 INFO L124 PetriNetUnfolderBase]: 4408/7182 cut-off events. [2024-05-12 11:54:17,769 INFO L125 PetriNetUnfolderBase]: For 22215/22217 co-relation queries the response was YES. [2024-05-12 11:54:17,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24243 conditions, 7182 events. 4408/7182 cut-off events. For 22215/22217 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 45221 event pairs, 1611 based on Foata normal form. 2/6951 useless extension candidates. Maximal degree in co-relation 24209. Up to 6052 conditions per place. [2024-05-12 11:54:17,797 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 114 selfloop transitions, 67 changer transitions 0/190 dead transitions. [2024-05-12 11:54:17,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 190 transitions, 1598 flow [2024-05-12 11:54:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:54:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:54:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2024-05-12 11:54:17,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124716553287982 [2024-05-12 11:54:17,799 INFO L175 Difference]: Start difference. First operand has 88 places, 126 transitions, 965 flow. Second operand 9 states and 226 transitions. [2024-05-12 11:54:17,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 190 transitions, 1598 flow [2024-05-12 11:54:17,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 190 transitions, 1534 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-05-12 11:54:17,816 INFO L231 Difference]: Finished difference. Result has 93 places, 132 transitions, 1126 flow [2024-05-12 11:54:17,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1126, PETRI_PLACES=93, PETRI_TRANSITIONS=132} [2024-05-12 11:54:17,816 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 38 predicate places. [2024-05-12 11:54:17,817 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 132 transitions, 1126 flow [2024-05-12 11:54:17,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:17,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:54:17,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:54:17,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:54:17,817 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:54:17,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:54:17,818 INFO L85 PathProgramCache]: Analyzing trace with hash 289772276, now seen corresponding path program 2 times [2024-05-12 11:54:17,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:54:17,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579965043] [2024-05-12 11:54:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:54:17,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:54:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:54:30,883 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:54:30,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:54:30,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579965043] [2024-05-12 11:54:30,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579965043] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:54:30,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:54:30,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:54:30,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170827594] [2024-05-12 11:54:30,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:54:30,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:54:30,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:54:30,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:54:30,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:54:31,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:54:31,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 132 transitions, 1126 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:31,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:54:31,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:54:31,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:54:32,976 INFO L124 PetriNetUnfolderBase]: 4450/7141 cut-off events. [2024-05-12 11:54:32,976 INFO L125 PetriNetUnfolderBase]: For 27802/27804 co-relation queries the response was YES. [2024-05-12 11:54:32,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25273 conditions, 7141 events. 4450/7141 cut-off events. For 27802/27804 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 44268 event pairs, 1453 based on Foata normal form. 4/6933 useless extension candidates. Maximal degree in co-relation 25238. Up to 6020 conditions per place. [2024-05-12 11:54:33,010 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 112 selfloop transitions, 53 changer transitions 0/174 dead transitions. [2024-05-12 11:54:33,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 174 transitions, 1645 flow [2024-05-12 11:54:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:54:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:54:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-05-12 11:54:33,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131195335276968 [2024-05-12 11:54:33,011 INFO L175 Difference]: Start difference. First operand has 93 places, 132 transitions, 1126 flow. Second operand 7 states and 176 transitions. [2024-05-12 11:54:33,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 174 transitions, 1645 flow [2024-05-12 11:54:33,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 174 transitions, 1548 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-05-12 11:54:33,027 INFO L231 Difference]: Finished difference. Result has 96 places, 138 transitions, 1221 flow [2024-05-12 11:54:33,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1221, PETRI_PLACES=96, PETRI_TRANSITIONS=138} [2024-05-12 11:54:33,028 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 41 predicate places. [2024-05-12 11:54:33,028 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 138 transitions, 1221 flow [2024-05-12 11:54:33,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:33,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:54:33,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:54:33,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:54:33,029 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:54:33,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:54:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1099156634, now seen corresponding path program 4 times [2024-05-12 11:54:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:54:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739847481] [2024-05-12 11:54:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:54:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:54:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:54:46,134 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:54:46,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:54:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739847481] [2024-05-12 11:54:46,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739847481] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:54:46,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:54:46,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:54:46,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734824910] [2024-05-12 11:54:46,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:54:46,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:54:46,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:54:46,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:54:46,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:54:46,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:54:46,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 138 transitions, 1221 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:46,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:54:46,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:54:46,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:54:48,316 INFO L124 PetriNetUnfolderBase]: 4445/7216 cut-off events. [2024-05-12 11:54:48,316 INFO L125 PetriNetUnfolderBase]: For 29958/29960 co-relation queries the response was YES. [2024-05-12 11:54:48,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25913 conditions, 7216 events. 4445/7216 cut-off events. For 29958/29960 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 45277 event pairs, 1617 based on Foata normal form. 2/6976 useless extension candidates. Maximal degree in co-relation 25875. Up to 6105 conditions per place. [2024-05-12 11:54:48,350 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 102 selfloop transitions, 64 changer transitions 0/175 dead transitions. [2024-05-12 11:54:48,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 175 transitions, 1659 flow [2024-05-12 11:54:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:54:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:54:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-05-12 11:54:48,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072886297376094 [2024-05-12 11:54:48,351 INFO L175 Difference]: Start difference. First operand has 96 places, 138 transitions, 1221 flow. Second operand 7 states and 174 transitions. [2024-05-12 11:54:48,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 175 transitions, 1659 flow [2024-05-12 11:54:48,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 175 transitions, 1558 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-05-12 11:54:48,379 INFO L231 Difference]: Finished difference. Result has 100 places, 138 transitions, 1257 flow [2024-05-12 11:54:48,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1257, PETRI_PLACES=100, PETRI_TRANSITIONS=138} [2024-05-12 11:54:48,379 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 45 predicate places. [2024-05-12 11:54:48,379 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 138 transitions, 1257 flow [2024-05-12 11:54:48,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:48,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:54:48,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:54:48,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:54:48,380 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:54:48,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:54:48,381 INFO L85 PathProgramCache]: Analyzing trace with hash 289535126, now seen corresponding path program 3 times [2024-05-12 11:54:48,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:54:48,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166770329] [2024-05-12 11:54:48,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:54:48,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:54:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:01,466 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:55:01,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:01,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166770329] [2024-05-12 11:55:01,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166770329] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:01,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:01,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:55:01,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187205516] [2024-05-12 11:55:01,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:01,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:55:01,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:01,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:55:01,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:55:01,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:55:01,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 138 transitions, 1257 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:01,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:01,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:55:01,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:03,602 INFO L124 PetriNetUnfolderBase]: 4435/7120 cut-off events. [2024-05-12 11:55:03,602 INFO L125 PetriNetUnfolderBase]: For 31723/31725 co-relation queries the response was YES. [2024-05-12 11:55:03,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25766 conditions, 7120 events. 4435/7120 cut-off events. For 31723/31725 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 44172 event pairs, 1451 based on Foata normal form. 4/6912 useless extension candidates. Maximal degree in co-relation 25727. Up to 6005 conditions per place. [2024-05-12 11:55:03,635 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 115 selfloop transitions, 49 changer transitions 0/173 dead transitions. [2024-05-12 11:55:03,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 173 transitions, 1686 flow [2024-05-12 11:55:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:55:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:55:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-05-12 11:55:03,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-05-12 11:55:03,637 INFO L175 Difference]: Start difference. First operand has 100 places, 138 transitions, 1257 flow. Second operand 7 states and 175 transitions. [2024-05-12 11:55:03,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 173 transitions, 1686 flow [2024-05-12 11:55:03,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 173 transitions, 1536 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-05-12 11:55:03,665 INFO L231 Difference]: Finished difference. Result has 101 places, 138 transitions, 1214 flow [2024-05-12 11:55:03,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1214, PETRI_PLACES=101, PETRI_TRANSITIONS=138} [2024-05-12 11:55:03,666 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 46 predicate places. [2024-05-12 11:55:03,666 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 138 transitions, 1214 flow [2024-05-12 11:55:03,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:03,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:03,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:03,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:55:03,666 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:03,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash 289781204, now seen corresponding path program 1 times [2024-05-12 11:55:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:03,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40433529] [2024-05-12 11:55:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:03,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:15,828 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:55:15,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:15,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40433529] [2024-05-12 11:55:15,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40433529] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:15,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:15,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:55:15,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200592522] [2024-05-12 11:55:15,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:15,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:55:15,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:15,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:55:15,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:55:15,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:55:15,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 138 transitions, 1214 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:55:15,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:15,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:55:15,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:17,787 INFO L124 PetriNetUnfolderBase]: 3825/6332 cut-off events. [2024-05-12 11:55:17,787 INFO L125 PetriNetUnfolderBase]: For 29935/29937 co-relation queries the response was YES. [2024-05-12 11:55:17,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23059 conditions, 6332 events. 3825/6332 cut-off events. For 29935/29937 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 40279 event pairs, 1261 based on Foata normal form. 4/6131 useless extension candidates. Maximal degree in co-relation 23019. Up to 5407 conditions per place. [2024-05-12 11:55:17,817 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 147 selfloop transitions, 17 changer transitions 0/174 dead transitions. [2024-05-12 11:55:17,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 174 transitions, 1668 flow [2024-05-12 11:55:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:55:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:55:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 11:55:17,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043731778425656 [2024-05-12 11:55:17,820 INFO L175 Difference]: Start difference. First operand has 101 places, 138 transitions, 1214 flow. Second operand 7 states and 173 transitions. [2024-05-12 11:55:17,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 174 transitions, 1668 flow [2024-05-12 11:55:17,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 174 transitions, 1553 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 11:55:17,843 INFO L231 Difference]: Finished difference. Result has 102 places, 141 transitions, 1179 flow [2024-05-12 11:55:17,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1179, PETRI_PLACES=102, PETRI_TRANSITIONS=141} [2024-05-12 11:55:17,843 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 47 predicate places. [2024-05-12 11:55:17,844 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 141 transitions, 1179 flow [2024-05-12 11:55:17,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:55:17,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:17,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:17,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:55:17,844 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:17,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:17,845 INFO L85 PathProgramCache]: Analyzing trace with hash -524693088, now seen corresponding path program 1 times [2024-05-12 11:55:17,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:17,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476457427] [2024-05-12 11:55:17,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:17,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:30,312 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:55:30,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:30,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476457427] [2024-05-12 11:55:30,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476457427] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:30,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:30,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:55:30,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895770880] [2024-05-12 11:55:30,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:30,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:55:30,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:30,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:55:30,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:55:30,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:55:30,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 141 transitions, 1179 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 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:55:30,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:30,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:55:30,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:31,949 INFO L124 PetriNetUnfolderBase]: 3560/5982 cut-off events. [2024-05-12 11:55:31,949 INFO L125 PetriNetUnfolderBase]: For 32613/32631 co-relation queries the response was YES. [2024-05-12 11:55:31,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22215 conditions, 5982 events. 3560/5982 cut-off events. For 32613/32631 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 38725 event pairs, 1519 based on Foata normal form. 11/5787 useless extension candidates. Maximal degree in co-relation 22174. Up to 5074 conditions per place. [2024-05-12 11:55:31,982 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 133 selfloop transitions, 9 changer transitions 0/163 dead transitions. [2024-05-12 11:55:31,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 163 transitions, 1570 flow [2024-05-12 11:55:31,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:55:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:55:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-05-12 11:55:31,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-05-12 11:55:31,984 INFO L175 Difference]: Start difference. First operand has 102 places, 141 transitions, 1179 flow. Second operand 5 states and 124 transitions. [2024-05-12 11:55:31,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 163 transitions, 1570 flow [2024-05-12 11:55:32,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 163 transitions, 1508 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-05-12 11:55:32,007 INFO L231 Difference]: Finished difference. Result has 103 places, 148 transitions, 1221 flow [2024-05-12 11:55:32,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1221, PETRI_PLACES=103, PETRI_TRANSITIONS=148} [2024-05-12 11:55:32,007 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2024-05-12 11:55:32,008 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 148 transitions, 1221 flow [2024-05-12 11:55:32,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 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:55:32,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:32,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:32,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:55:32,008 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:32,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash 186348078, now seen corresponding path program 1 times [2024-05-12 11:55:32,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:32,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602176490] [2024-05-12 11:55:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:46,028 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:55:46,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:46,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602176490] [2024-05-12 11:55:46,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602176490] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:46,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:46,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:55:46,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439686866] [2024-05-12 11:55:46,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:46,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:55:46,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:46,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:55:46,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:55:46,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:55:46,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 148 transitions, 1221 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:55:46,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:46,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:55:46,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:48,458 INFO L124 PetriNetUnfolderBase]: 4526/7269 cut-off events. [2024-05-12 11:55:48,458 INFO L125 PetriNetUnfolderBase]: For 43388/43390 co-relation queries the response was YES. [2024-05-12 11:55:48,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28284 conditions, 7269 events. 4526/7269 cut-off events. For 43388/43390 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 45242 event pairs, 1436 based on Foata normal form. 4/7083 useless extension candidates. Maximal degree in co-relation 28241. Up to 5950 conditions per place. [2024-05-12 11:55:48,492 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 154 selfloop transitions, 66 changer transitions 0/229 dead transitions. [2024-05-12 11:55:48,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 229 transitions, 2124 flow [2024-05-12 11:55:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:55:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:55:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2024-05-12 11:55:48,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-05-12 11:55:48,494 INFO L175 Difference]: Start difference. First operand has 103 places, 148 transitions, 1221 flow. Second operand 10 states and 254 transitions. [2024-05-12 11:55:48,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 229 transitions, 2124 flow [2024-05-12 11:55:48,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 229 transitions, 2103 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-05-12 11:55:48,522 INFO L231 Difference]: Finished difference. Result has 113 places, 165 transitions, 1546 flow [2024-05-12 11:55:48,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1200, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1546, PETRI_PLACES=113, PETRI_TRANSITIONS=165} [2024-05-12 11:55:48,524 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 58 predicate places. [2024-05-12 11:55:48,524 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 165 transitions, 1546 flow [2024-05-12 11:55:48,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:55:48,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:48,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:48,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:55:48,524 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:48,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:48,524 INFO L85 PathProgramCache]: Analyzing trace with hash -810454376, now seen corresponding path program 2 times [2024-05-12 11:55:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:48,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714283657] [2024-05-12 11:55:48,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:48,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:02,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:56:02,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:02,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714283657] [2024-05-12 11:56:02,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714283657] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:02,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:02,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:56:02,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756967187] [2024-05-12 11:56:02,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:02,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:56:02,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:02,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:56:02,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:56:02,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:56:02,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 165 transitions, 1546 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:56:02,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:02,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:56:02,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:04,958 INFO L124 PetriNetUnfolderBase]: 4516/7255 cut-off events. [2024-05-12 11:56:04,958 INFO L125 PetriNetUnfolderBase]: For 50425/50427 co-relation queries the response was YES. [2024-05-12 11:56:04,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29892 conditions, 7255 events. 4516/7255 cut-off events. For 50425/50427 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 45156 event pairs, 1436 based on Foata normal form. 4/7069 useless extension candidates. Maximal degree in co-relation 29845. Up to 5942 conditions per place. [2024-05-12 11:56:05,000 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 149 selfloop transitions, 69 changer transitions 0/227 dead transitions. [2024-05-12 11:56:05,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 227 transitions, 2237 flow [2024-05-12 11:56:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:56:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:56:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 250 transitions. [2024-05-12 11:56:05,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-05-12 11:56:05,002 INFO L175 Difference]: Start difference. First operand has 113 places, 165 transitions, 1546 flow. Second operand 10 states and 250 transitions. [2024-05-12 11:56:05,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 227 transitions, 2237 flow [2024-05-12 11:56:05,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 227 transitions, 2113 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-05-12 11:56:05,037 INFO L231 Difference]: Finished difference. Result has 118 places, 166 transitions, 1578 flow [2024-05-12 11:56:05,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1578, PETRI_PLACES=118, PETRI_TRANSITIONS=166} [2024-05-12 11:56:05,038 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 63 predicate places. [2024-05-12 11:56:05,038 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 166 transitions, 1578 flow [2024-05-12 11:56:05,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:56:05,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:05,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:05,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:56:05,039 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:05,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:05,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1501946470, now seen corresponding path program 3 times [2024-05-12 11:56:05,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:05,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078165190] [2024-05-12 11:56:05,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:05,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:18,933 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:56:18,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:18,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078165190] [2024-05-12 11:56:18,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078165190] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:18,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:18,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:56:18,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442803250] [2024-05-12 11:56:18,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:18,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:56:18,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:18,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:56:18,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:56:19,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:56:19,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 166 transitions, 1578 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:56:19,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:19,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:56:19,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:21,158 INFO L124 PetriNetUnfolderBase]: 4558/7328 cut-off events. [2024-05-12 11:56:21,158 INFO L125 PetriNetUnfolderBase]: For 54026/54028 co-relation queries the response was YES. [2024-05-12 11:56:21,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30667 conditions, 7328 events. 4558/7328 cut-off events. For 54026/54028 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 45634 event pairs, 1466 based on Foata normal form. 4/7133 useless extension candidates. Maximal degree in co-relation 30618. Up to 5978 conditions per place. [2024-05-12 11:56:21,204 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 133 selfloop transitions, 74 changer transitions 0/216 dead transitions. [2024-05-12 11:56:21,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 216 transitions, 2269 flow [2024-05-12 11:56:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:56:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:56:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-05-12 11:56:21,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-05-12 11:56:21,206 INFO L175 Difference]: Start difference. First operand has 118 places, 166 transitions, 1578 flow. Second operand 8 states and 200 transitions. [2024-05-12 11:56:21,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 216 transitions, 2269 flow [2024-05-12 11:56:21,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 216 transitions, 2139 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 11:56:21,246 INFO L231 Difference]: Finished difference. Result has 120 places, 172 transitions, 1718 flow [2024-05-12 11:56:21,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1718, PETRI_PLACES=120, PETRI_TRANSITIONS=172} [2024-05-12 11:56:21,246 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 65 predicate places. [2024-05-12 11:56:21,246 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 172 transitions, 1718 flow [2024-05-12 11:56:21,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:56:21,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:21,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:21,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:56:21,247 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:21,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:21,247 INFO L85 PathProgramCache]: Analyzing trace with hash 385655448, now seen corresponding path program 4 times [2024-05-12 11:56:21,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:21,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133077837] [2024-05-12 11:56:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:21,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:35,131 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:56:35,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:35,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133077837] [2024-05-12 11:56:35,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133077837] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:35,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:35,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:56:35,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728892810] [2024-05-12 11:56:35,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:35,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:56:35,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:35,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:56:35,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:56:35,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:56:35,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 172 transitions, 1718 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:56:35,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:35,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:56:35,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:37,514 INFO L124 PetriNetUnfolderBase]: 4600/7384 cut-off events. [2024-05-12 11:56:37,514 INFO L125 PetriNetUnfolderBase]: For 58623/58625 co-relation queries the response was YES. [2024-05-12 11:56:37,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31503 conditions, 7384 events. 4600/7384 cut-off events. For 58623/58625 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 45932 event pairs, 1459 based on Foata normal form. 4/7190 useless extension candidates. Maximal degree in co-relation 31452. Up to 6014 conditions per place. [2024-05-12 11:56:37,560 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 139 selfloop transitions, 73 changer transitions 0/221 dead transitions. [2024-05-12 11:56:37,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 221 transitions, 2409 flow [2024-05-12 11:56:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:56:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:56:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-05-12 11:56:37,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2024-05-12 11:56:37,562 INFO L175 Difference]: Start difference. First operand has 120 places, 172 transitions, 1718 flow. Second operand 8 states and 203 transitions. [2024-05-12 11:56:37,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 221 transitions, 2409 flow [2024-05-12 11:56:37,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 221 transitions, 2274 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-05-12 11:56:37,621 INFO L231 Difference]: Finished difference. Result has 124 places, 176 transitions, 1802 flow [2024-05-12 11:56:37,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1802, PETRI_PLACES=124, PETRI_TRANSITIONS=176} [2024-05-12 11:56:37,621 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 69 predicate places. [2024-05-12 11:56:37,621 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 176 transitions, 1802 flow [2024-05-12 11:56:37,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:56:37,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:37,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:37,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:56:37,622 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:37,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1509303700, now seen corresponding path program 5 times [2024-05-12 11:56:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:37,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710144193] [2024-05-12 11:56:37,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:37,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:51,556 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:56:51,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:51,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710144193] [2024-05-12 11:56:51,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710144193] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:51,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:51,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:56:51,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545723323] [2024-05-12 11:56:51,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:51,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:56:51,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:51,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:56:51,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:56:51,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:56:51,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 176 transitions, 1802 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:56:51,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:51,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:56:51,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:53,850 INFO L124 PetriNetUnfolderBase]: 4590/7370 cut-off events. [2024-05-12 11:56:53,850 INFO L125 PetriNetUnfolderBase]: For 61274/61276 co-relation queries the response was YES. [2024-05-12 11:56:53,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31412 conditions, 7370 events. 4590/7370 cut-off events. For 61274/61276 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 45792 event pairs, 1457 based on Foata normal form. 4/7176 useless extension candidates. Maximal degree in co-relation 31360. Up to 6006 conditions per place. [2024-05-12 11:56:53,895 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 136 selfloop transitions, 74 changer transitions 0/219 dead transitions. [2024-05-12 11:56:53,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 219 transitions, 2355 flow [2024-05-12 11:56:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:56:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:56:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-05-12 11:56:53,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-05-12 11:56:53,897 INFO L175 Difference]: Start difference. First operand has 124 places, 176 transitions, 1802 flow. Second operand 8 states and 200 transitions. [2024-05-12 11:56:53,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 219 transitions, 2355 flow [2024-05-12 11:56:53,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 219 transitions, 2126 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-05-12 11:56:53,954 INFO L231 Difference]: Finished difference. Result has 126 places, 176 transitions, 1730 flow [2024-05-12 11:56:53,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1730, PETRI_PLACES=126, PETRI_TRANSITIONS=176} [2024-05-12 11:56:53,955 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 71 predicate places. [2024-05-12 11:56:53,955 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 176 transitions, 1730 flow [2024-05-12 11:56:53,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:56:53,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:53,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:53,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:56:53,956 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:53,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash 867017543, now seen corresponding path program 1 times [2024-05-12 11:56:53,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:53,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979611367] [2024-05-12 11:56:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:53,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:06,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:06,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979611367] [2024-05-12 11:57:06,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979611367] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:06,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:06,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:57:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259857594] [2024-05-12 11:57:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:06,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:57:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:06,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:57:06,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:57:06,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:57:06,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 176 transitions, 1730 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:57:06,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:06,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:57:06,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:08,077 INFO L124 PetriNetUnfolderBase]: 4239/6953 cut-off events. [2024-05-12 11:57:08,077 INFO L125 PetriNetUnfolderBase]: For 62967/63002 co-relation queries the response was YES. [2024-05-12 11:57:08,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29696 conditions, 6953 events. 4239/6953 cut-off events. For 62967/63002 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 44540 event pairs, 1796 based on Foata normal form. 14/6752 useless extension candidates. Maximal degree in co-relation 29643. Up to 6014 conditions per place. [2024-05-12 11:57:08,124 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 168 selfloop transitions, 12 changer transitions 0/200 dead transitions. [2024-05-12 11:57:08,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 200 transitions, 2186 flow [2024-05-12 11:57:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:57:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:57:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-05-12 11:57:08,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48299319727891155 [2024-05-12 11:57:08,125 INFO L175 Difference]: Start difference. First operand has 126 places, 176 transitions, 1730 flow. Second operand 6 states and 142 transitions. [2024-05-12 11:57:08,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 200 transitions, 2186 flow [2024-05-12 11:57:08,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 200 transitions, 2038 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 11:57:08,163 INFO L231 Difference]: Finished difference. Result has 126 places, 179 transitions, 1642 flow [2024-05-12 11:57:08,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1642, PETRI_PLACES=126, PETRI_TRANSITIONS=179} [2024-05-12 11:57:08,164 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 71 predicate places. [2024-05-12 11:57:08,164 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 179 transitions, 1642 flow [2024-05-12 11:57:08,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:57:08,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:08,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:57:08,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:57:08,164 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:08,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:08,165 INFO L85 PathProgramCache]: Analyzing trace with hash 527393401, now seen corresponding path program 1 times [2024-05-12 11:57:08,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:08,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212245391] [2024-05-12 11:57:08,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:23,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:23,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212245391] [2024-05-12 11:57:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212245391] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:23,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:23,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:57:23,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823599028] [2024-05-12 11:57:23,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:23,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:57:23,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:23,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:57:23,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:57:23,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:57:23,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 179 transitions, 1642 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:57:23,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:23,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:57:23,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:25,669 INFO L124 PetriNetUnfolderBase]: 4948/8030 cut-off events. [2024-05-12 11:57:25,669 INFO L125 PetriNetUnfolderBase]: For 79719/79721 co-relation queries the response was YES. [2024-05-12 11:57:25,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34963 conditions, 8030 events. 4948/8030 cut-off events. For 79719/79721 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 51184 event pairs, 1271 based on Foata normal form. 4/7761 useless extension candidates. Maximal degree in co-relation 34909. Up to 6695 conditions per place. [2024-05-12 11:57:25,720 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 162 selfloop transitions, 61 changer transitions 0/233 dead transitions. [2024-05-12 11:57:25,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 233 transitions, 2388 flow [2024-05-12 11:57:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:57:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:57:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-05-12 11:57:25,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2024-05-12 11:57:25,722 INFO L175 Difference]: Start difference. First operand has 126 places, 179 transitions, 1642 flow. Second operand 8 states and 202 transitions. [2024-05-12 11:57:25,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 233 transitions, 2388 flow [2024-05-12 11:57:25,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 233 transitions, 2350 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-05-12 11:57:25,781 INFO L231 Difference]: Finished difference. Result has 130 places, 183 transitions, 1805 flow [2024-05-12 11:57:25,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1805, PETRI_PLACES=130, PETRI_TRANSITIONS=183} [2024-05-12 11:57:25,781 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 75 predicate places. [2024-05-12 11:57:25,781 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 183 transitions, 1805 flow [2024-05-12 11:57:25,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:57:25,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:25,782 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:57:25,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:57:25,782 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:25,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1486775039, now seen corresponding path program 2 times [2024-05-12 11:57:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:25,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021152133] [2024-05-12 11:57:25,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:25,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:38,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:38,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021152133] [2024-05-12 11:57:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021152133] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:38,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:38,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:57:38,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98657491] [2024-05-12 11:57:38,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:38,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:57:38,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:38,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:57:38,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:57:38,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:57:38,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 183 transitions, 1805 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:57:38,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:38,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:57:38,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:41,087 INFO L124 PetriNetUnfolderBase]: 4940/8028 cut-off events. [2024-05-12 11:57:41,087 INFO L125 PetriNetUnfolderBase]: For 86942/86944 co-relation queries the response was YES. [2024-05-12 11:57:41,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35727 conditions, 8028 events. 4940/8028 cut-off events. For 86942/86944 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 51253 event pairs, 1643 based on Foata normal form. 4/7751 useless extension candidates. Maximal degree in co-relation 35672. Up to 6798 conditions per place. [2024-05-12 11:57:41,146 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 154 selfloop transitions, 57 changer transitions 0/221 dead transitions. [2024-05-12 11:57:41,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 221 transitions, 2345 flow [2024-05-12 11:57:41,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:57:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:57:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-05-12 11:57:41,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-05-12 11:57:41,148 INFO L175 Difference]: Start difference. First operand has 130 places, 183 transitions, 1805 flow. Second operand 7 states and 175 transitions. [2024-05-12 11:57:41,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 221 transitions, 2345 flow [2024-05-12 11:57:41,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 221 transitions, 2232 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-05-12 11:57:41,211 INFO L231 Difference]: Finished difference. Result has 133 places, 183 transitions, 1816 flow [2024-05-12 11:57:41,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1692, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1816, PETRI_PLACES=133, PETRI_TRANSITIONS=183} [2024-05-12 11:57:41,212 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 78 predicate places. [2024-05-12 11:57:41,212 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 183 transitions, 1816 flow [2024-05-12 11:57:41,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:57:41,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:41,213 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:57:41,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:57:41,213 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:41,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash 645541531, now seen corresponding path program 3 times [2024-05-12 11:57:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:41,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135278463] [2024-05-12 11:57:41,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:51,986 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:57:51,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135278463] [2024-05-12 11:57:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135278463] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:51,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:51,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:57:51,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126212845] [2024-05-12 11:57:51,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:51,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:57:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:51,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:57:51,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:57:52,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:57:52,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 183 transitions, 1816 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:57:52,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:52,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:57:52,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:54,547 INFO L124 PetriNetUnfolderBase]: 4968/8084 cut-off events. [2024-05-12 11:57:54,547 INFO L125 PetriNetUnfolderBase]: For 92387/92395 co-relation queries the response was YES. [2024-05-12 11:57:54,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36177 conditions, 8084 events. 4968/8084 cut-off events. For 92387/92395 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 51807 event pairs, 1599 based on Foata normal form. 8/7819 useless extension candidates. Maximal degree in co-relation 36120. Up to 6765 conditions per place. [2024-05-12 11:57:54,595 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 146 selfloop transitions, 76 changer transitions 0/232 dead transitions. [2024-05-12 11:57:54,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 232 transitions, 2444 flow [2024-05-12 11:57:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:57:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:57:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-05-12 11:57:54,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127551020408163 [2024-05-12 11:57:54,597 INFO L175 Difference]: Start difference. First operand has 133 places, 183 transitions, 1816 flow. Second operand 8 states and 201 transitions. [2024-05-12 11:57:54,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 232 transitions, 2444 flow [2024-05-12 11:57:54,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 232 transitions, 2322 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-05-12 11:57:54,669 INFO L231 Difference]: Finished difference. Result has 135 places, 185 transitions, 1896 flow [2024-05-12 11:57:54,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1694, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1896, PETRI_PLACES=135, PETRI_TRANSITIONS=185} [2024-05-12 11:57:54,670 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 80 predicate places. [2024-05-12 11:57:54,670 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 185 transitions, 1896 flow [2024-05-12 11:57:54,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:57:54,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:54,670 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:57:54,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 11:57:54,670 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:54,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash 645726229, now seen corresponding path program 1 times [2024-05-12 11:57:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:54,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117116756] [2024-05-12 11:57:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:07,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:07,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117116756] [2024-05-12 11:58:07,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117116756] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:07,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:07,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:58:07,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290190603] [2024-05-12 11:58:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:07,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:58:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:58:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:58:08,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:58:08,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 185 transitions, 1896 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:58:08,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:08,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:58:08,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:10,518 INFO L124 PetriNetUnfolderBase]: 5156/8277 cut-off events. [2024-05-12 11:58:10,518 INFO L125 PetriNetUnfolderBase]: For 110779/110781 co-relation queries the response was YES. [2024-05-12 11:58:10,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38413 conditions, 8277 events. 5156/8277 cut-off events. For 110779/110781 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 52661 event pairs, 1402 based on Foata normal form. 24/8059 useless extension candidates. Maximal degree in co-relation 38355. Up to 6773 conditions per place. [2024-05-12 11:58:10,571 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 181 selfloop transitions, 59 changer transitions 0/250 dead transitions. [2024-05-12 11:58:10,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 250 transitions, 2621 flow [2024-05-12 11:58:10,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:58:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:58:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 250 transitions. [2024-05-12 11:58:10,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-05-12 11:58:10,572 INFO L175 Difference]: Start difference. First operand has 135 places, 185 transitions, 1896 flow. Second operand 10 states and 250 transitions. [2024-05-12 11:58:10,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 250 transitions, 2621 flow [2024-05-12 11:58:10,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 250 transitions, 2445 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-05-12 11:58:10,649 INFO L231 Difference]: Finished difference. Result has 139 places, 188 transitions, 1895 flow [2024-05-12 11:58:10,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1720, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1895, PETRI_PLACES=139, PETRI_TRANSITIONS=188} [2024-05-12 11:58:10,649 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 84 predicate places. [2024-05-12 11:58:10,649 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 188 transitions, 1895 flow [2024-05-12 11:58:10,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:58:10,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:10,650 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:58:10,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 11:58:10,650 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:10,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1200919321, now seen corresponding path program 1 times [2024-05-12 11:58:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:10,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981029113] [2024-05-12 11:58:10,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:10,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:23,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:23,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981029113] [2024-05-12 11:58:23,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981029113] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:23,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:23,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:58:23,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261590677] [2024-05-12 11:58:23,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:23,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:58:23,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:23,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:58:23,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:58:23,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:58:23,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 188 transitions, 1895 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:58:23,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:23,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:58:23,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:25,474 INFO L124 PetriNetUnfolderBase]: 4901/7969 cut-off events. [2024-05-12 11:58:25,474 INFO L125 PetriNetUnfolderBase]: For 112392/112434 co-relation queries the response was YES. [2024-05-12 11:58:25,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37890 conditions, 7969 events. 4901/7969 cut-off events. For 112392/112434 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 51572 event pairs, 1813 based on Foata normal form. 15/7689 useless extension candidates. Maximal degree in co-relation 37831. Up to 6840 conditions per place. [2024-05-12 11:58:25,532 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 183 selfloop transitions, 20 changer transitions 0/225 dead transitions. [2024-05-12 11:58:25,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 225 transitions, 2574 flow [2024-05-12 11:58:25,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:58:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:58:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-05-12 11:58:25,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965986394557823 [2024-05-12 11:58:25,534 INFO L175 Difference]: Start difference. First operand has 139 places, 188 transitions, 1895 flow. Second operand 6 states and 146 transitions. [2024-05-12 11:58:25,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 225 transitions, 2574 flow [2024-05-12 11:58:25,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 225 transitions, 2423 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-05-12 11:58:25,618 INFO L231 Difference]: Finished difference. Result has 138 places, 202 transitions, 2030 flow [2024-05-12 11:58:25,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2030, PETRI_PLACES=138, PETRI_TRANSITIONS=202} [2024-05-12 11:58:25,619 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 83 predicate places. [2024-05-12 11:58:25,619 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 202 transitions, 2030 flow [2024-05-12 11:58:25,619 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:58:25,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:25,619 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:58:25,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 11:58:25,620 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:25,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:25,620 INFO L85 PathProgramCache]: Analyzing trace with hash -929759589, now seen corresponding path program 4 times [2024-05-12 11:58:25,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:25,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027507240] [2024-05-12 11:58:25,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:25,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:39,769 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:58:39,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:39,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027507240] [2024-05-12 11:58:39,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027507240] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:39,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:39,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:58:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414625956] [2024-05-12 11:58:39,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:39,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:58:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:39,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:58:39,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:58:39,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:58:39,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 202 transitions, 2030 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:58:39,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:39,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:58:39,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:42,433 INFO L124 PetriNetUnfolderBase]: 5227/8451 cut-off events. [2024-05-12 11:58:42,433 INFO L125 PetriNetUnfolderBase]: For 117116/117118 co-relation queries the response was YES. [2024-05-12 11:58:42,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40381 conditions, 8451 events. 5227/8451 cut-off events. For 117116/117118 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 54021 event pairs, 1727 based on Foata normal form. 4/8170 useless extension candidates. Maximal degree in co-relation 40320. Up to 7134 conditions per place. [2024-05-12 11:58:42,488 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 154 selfloop transitions, 84 changer transitions 0/248 dead transitions. [2024-05-12 11:58:42,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 248 transitions, 2696 flow [2024-05-12 11:58:42,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:58:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:58:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-05-12 11:58:42,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2024-05-12 11:58:42,489 INFO L175 Difference]: Start difference. First operand has 138 places, 202 transitions, 2030 flow. Second operand 8 states and 198 transitions. [2024-05-12 11:58:42,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 248 transitions, 2696 flow [2024-05-12 11:58:42,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 248 transitions, 2653 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-05-12 11:58:42,575 INFO L231 Difference]: Finished difference. Result has 143 places, 204 transitions, 2211 flow [2024-05-12 11:58:42,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2211, PETRI_PLACES=143, PETRI_TRANSITIONS=204} [2024-05-12 11:58:42,576 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 88 predicate places. [2024-05-12 11:58:42,577 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 204 transitions, 2211 flow [2024-05-12 11:58:42,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:58:42,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:42,577 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:58:42,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 11:58:42,577 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:42,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash -929574891, now seen corresponding path program 2 times [2024-05-12 11:58:42,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:42,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128100459] [2024-05-12 11:58:42,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:42,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:56,015 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:58:56,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:56,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128100459] [2024-05-12 11:58:56,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128100459] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:56,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:56,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:58:56,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449090523] [2024-05-12 11:58:56,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:56,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:58:56,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:56,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:58:56,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:58:56,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:58:56,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 204 transitions, 2211 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:58:56,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:56,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:58:56,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:58,783 INFO L124 PetriNetUnfolderBase]: 5261/8412 cut-off events. [2024-05-12 11:58:58,784 INFO L125 PetriNetUnfolderBase]: For 128062/128064 co-relation queries the response was YES. [2024-05-12 11:58:58,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41370 conditions, 8412 events. 5261/8412 cut-off events. For 128062/128064 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 53177 event pairs, 1531 based on Foata normal form. 4/8161 useless extension candidates. Maximal degree in co-relation 41308. Up to 7106 conditions per place. [2024-05-12 11:58:58,843 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 175 selfloop transitions, 64 changer transitions 0/249 dead transitions. [2024-05-12 11:58:58,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 249 transitions, 2876 flow [2024-05-12 11:58:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:58:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:58:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-05-12 11:58:58,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2024-05-12 11:58:58,845 INFO L175 Difference]: Start difference. First operand has 143 places, 204 transitions, 2211 flow. Second operand 8 states and 198 transitions. [2024-05-12 11:58:58,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 249 transitions, 2876 flow [2024-05-12 11:58:58,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 249 transitions, 2680 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-05-12 11:58:58,948 INFO L231 Difference]: Finished difference. Result has 145 places, 207 transitions, 2207 flow [2024-05-12 11:58:58,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2015, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2207, PETRI_PLACES=145, PETRI_TRANSITIONS=207} [2024-05-12 11:58:58,949 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 90 predicate places. [2024-05-12 11:58:58,949 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 207 transitions, 2207 flow [2024-05-12 11:58:58,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:58:58,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:58,949 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:58:58,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 11:58:58,950 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:58,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:58,950 INFO L85 PathProgramCache]: Analyzing trace with hash -693399531, now seen corresponding path program 3 times [2024-05-12 11:58:58,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:58,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521737865] [2024-05-12 11:58:58,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:58,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:11,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:11,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521737865] [2024-05-12 11:59:11,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521737865] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:11,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:11,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:59:11,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436546459] [2024-05-12 11:59:11,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:11,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:59:11,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:11,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:59:11,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:59:12,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:59:12,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 207 transitions, 2207 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:59:12,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:12,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:59:12,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:14,620 INFO L124 PetriNetUnfolderBase]: 5295/8466 cut-off events. [2024-05-12 11:59:14,620 INFO L125 PetriNetUnfolderBase]: For 137388/137390 co-relation queries the response was YES. [2024-05-12 11:59:14,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42444 conditions, 8466 events. 5295/8466 cut-off events. For 137388/137390 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 53522 event pairs, 1534 based on Foata normal form. 4/8209 useless extension candidates. Maximal degree in co-relation 42381. Up to 7156 conditions per place. [2024-05-12 11:59:14,680 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 173 selfloop transitions, 68 changer transitions 0/251 dead transitions. [2024-05-12 11:59:14,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 251 transitions, 2880 flow [2024-05-12 11:59:14,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:59:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:59:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-05-12 11:59:14,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025510204081632 [2024-05-12 11:59:14,682 INFO L175 Difference]: Start difference. First operand has 145 places, 207 transitions, 2207 flow. Second operand 8 states and 197 transitions. [2024-05-12 11:59:14,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 251 transitions, 2880 flow [2024-05-12 11:59:14,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 251 transitions, 2712 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-05-12 11:59:14,796 INFO L231 Difference]: Finished difference. Result has 147 places, 210 transitions, 2245 flow [2024-05-12 11:59:14,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2039, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2245, PETRI_PLACES=147, PETRI_TRANSITIONS=210} [2024-05-12 11:59:14,796 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 92 predicate places. [2024-05-12 11:59:14,797 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 210 transitions, 2245 flow [2024-05-12 11:59:14,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:59:14,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:14,797 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:59:14,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 11:59:14,797 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:14,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:14,797 INFO L85 PathProgramCache]: Analyzing trace with hash 692878675, now seen corresponding path program 4 times [2024-05-12 11:59:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:14,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021830631] [2024-05-12 11:59:14,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:14,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:27,730 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:59:27,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:27,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021830631] [2024-05-12 11:59:27,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021830631] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:27,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:27,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:59:27,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617739055] [2024-05-12 11:59:27,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:27,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:59:27,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:27,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:59:27,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:59:27,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:59:27,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 210 transitions, 2245 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:59:27,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:27,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:59:27,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:30,425 INFO L124 PetriNetUnfolderBase]: 5259/8278 cut-off events. [2024-05-12 11:59:30,425 INFO L125 PetriNetUnfolderBase]: For 144810/144812 co-relation queries the response was YES. [2024-05-12 11:59:30,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42805 conditions, 8278 events. 5259/8278 cut-off events. For 144810/144812 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 51499 event pairs, 1363 based on Foata normal form. 4/8075 useless extension candidates. Maximal degree in co-relation 42741. Up to 6774 conditions per place. [2024-05-12 11:59:30,486 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 169 selfloop transitions, 79 changer transitions 0/258 dead transitions. [2024-05-12 11:59:30,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 258 transitions, 2964 flow [2024-05-12 11:59:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:59:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:59:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-05-12 11:59:30,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127551020408163 [2024-05-12 11:59:30,488 INFO L175 Difference]: Start difference. First operand has 147 places, 210 transitions, 2245 flow. Second operand 8 states and 201 transitions. [2024-05-12 11:59:30,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 258 transitions, 2964 flow [2024-05-12 11:59:30,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 258 transitions, 2782 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-05-12 11:59:30,610 INFO L231 Difference]: Finished difference. Result has 149 places, 213 transitions, 2297 flow [2024-05-12 11:59:30,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2063, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2297, PETRI_PLACES=149, PETRI_TRANSITIONS=213} [2024-05-12 11:59:30,611 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 94 predicate places. [2024-05-12 11:59:30,611 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 213 transitions, 2297 flow [2024-05-12 11:59:30,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:59:30,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:30,611 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:59:30,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 11:59:30,612 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:30,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1718841921, now seen corresponding path program 2 times [2024-05-12 11:59:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:30,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014380955] [2024-05-12 11:59:30,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:30,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:44,174 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:59:44,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014380955] [2024-05-12 11:59:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014380955] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:44,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:59:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492603076] [2024-05-12 11:59:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:44,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:59:44,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:44,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:59:44,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:59:44,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:59:44,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 213 transitions, 2297 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:59:44,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:44,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:59:44,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:46,486 INFO L124 PetriNetUnfolderBase]: 4910/7867 cut-off events. [2024-05-12 11:59:46,486 INFO L125 PetriNetUnfolderBase]: For 149207/149241 co-relation queries the response was YES. [2024-05-12 11:59:46,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41000 conditions, 7867 events. 4910/7867 cut-off events. For 149207/149241 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 50308 event pairs, 1807 based on Foata normal form. 17/7642 useless extension candidates. Maximal degree in co-relation 40935. Up to 6825 conditions per place. [2024-05-12 11:59:46,546 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 187 selfloop transitions, 25 changer transitions 0/237 dead transitions. [2024-05-12 11:59:46,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 237 transitions, 2847 flow [2024-05-12 11:59:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:59:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:59:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-05-12 11:59:46,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-05-12 11:59:46,547 INFO L175 Difference]: Start difference. First operand has 149 places, 213 transitions, 2297 flow. Second operand 6 states and 144 transitions. [2024-05-12 11:59:46,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 237 transitions, 2847 flow [2024-05-12 11:59:46,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 237 transitions, 2637 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-05-12 11:59:46,662 INFO L231 Difference]: Finished difference. Result has 149 places, 216 transitions, 2183 flow [2024-05-12 11:59:46,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2087, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2183, PETRI_PLACES=149, PETRI_TRANSITIONS=216} [2024-05-12 11:59:46,663 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 94 predicate places. [2024-05-12 11:59:46,663 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 216 transitions, 2183 flow [2024-05-12 11:59:46,663 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:59:46,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:46,663 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:59:46,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 11:59:46,663 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:46,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1677067809, now seen corresponding path program 1 times [2024-05-12 11:59:46,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:46,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941217999] [2024-05-12 11:59:46,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:46,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:59,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:59,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941217999] [2024-05-12 11:59:59,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941217999] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:59,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:59,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:59:59,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418924638] [2024-05-12 11:59:59,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:59,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:59:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:59,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:59:59,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:59:59,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:59:59,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 216 transitions, 2183 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:59:59,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:59,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:59:59,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:02,030 INFO L124 PetriNetUnfolderBase]: 4719/7603 cut-off events. [2024-05-12 12:00:02,030 INFO L125 PetriNetUnfolderBase]: For 141236/141238 co-relation queries the response was YES. [2024-05-12 12:00:02,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40139 conditions, 7603 events. 4719/7603 cut-off events. For 141236/141238 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 48137 event pairs, 1603 based on Foata normal form. 1/7399 useless extension candidates. Maximal degree in co-relation 40073. Up to 6681 conditions per place. [2024-05-12 12:00:02,093 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 220 selfloop transitions, 13 changer transitions 0/244 dead transitions. [2024-05-12 12:00:02,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 244 transitions, 2811 flow [2024-05-12 12:00:02,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:00:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:00:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-05-12 12:00:02,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48639455782312924 [2024-05-12 12:00:02,094 INFO L175 Difference]: Start difference. First operand has 149 places, 216 transitions, 2183 flow. Second operand 6 states and 143 transitions. [2024-05-12 12:00:02,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 244 transitions, 2811 flow [2024-05-12 12:00:02,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 244 transitions, 2739 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-05-12 12:00:02,226 INFO L231 Difference]: Finished difference. Result has 152 places, 223 transitions, 2246 flow [2024-05-12 12:00:02,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2111, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2246, PETRI_PLACES=152, PETRI_TRANSITIONS=223} [2024-05-12 12:00:02,227 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 97 predicate places. [2024-05-12 12:00:02,227 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 223 transitions, 2246 flow [2024-05-12 12:00:02,227 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 12:00:02,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:02,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:02,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:00:02,228 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:02,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 249535601, now seen corresponding path program 2 times [2024-05-12 12:00:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:02,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504378709] [2024-05-12 12:00:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:02,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:00:17,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:17,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504378709] [2024-05-12 12:00:17,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504378709] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:17,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:17,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:00:17,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168287071] [2024-05-12 12:00:17,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:17,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:00:17,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:17,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:00:17,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:00:17,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 12:00:17,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 223 transitions, 2246 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 12:00:17,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:17,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 12:00:17,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:20,234 INFO L124 PetriNetUnfolderBase]: 4707/7565 cut-off events. [2024-05-12 12:00:20,234 INFO L125 PetriNetUnfolderBase]: For 149347/149358 co-relation queries the response was YES. [2024-05-12 12:00:20,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40977 conditions, 7565 events. 4707/7565 cut-off events. For 149347/149358 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 47767 event pairs, 1582 based on Foata normal form. 7/7375 useless extension candidates. Maximal degree in co-relation 40909. Up to 6642 conditions per place. [2024-05-12 12:00:20,315 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 218 selfloop transitions, 18 changer transitions 0/247 dead transitions. [2024-05-12 12:00:20,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 247 transitions, 2858 flow [2024-05-12 12:00:20,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:00:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:00:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-05-12 12:00:20,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-05-12 12:00:20,316 INFO L175 Difference]: Start difference. First operand has 152 places, 223 transitions, 2246 flow. Second operand 6 states and 144 transitions. [2024-05-12 12:00:20,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 247 transitions, 2858 flow [2024-05-12 12:00:20,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 247 transitions, 2807 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-05-12 12:00:20,471 INFO L231 Difference]: Finished difference. Result has 155 places, 226 transitions, 2287 flow [2024-05-12 12:00:20,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2195, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2287, PETRI_PLACES=155, PETRI_TRANSITIONS=226} [2024-05-12 12:00:20,472 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 100 predicate places. [2024-05-12 12:00:20,472 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 226 transitions, 2287 flow [2024-05-12 12:00:20,472 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 12:00:20,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:20,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:20,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:00:20,472 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:20,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:20,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1718827041, now seen corresponding path program 1 times [2024-05-12 12:00:20,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:20,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744892522] [2024-05-12 12:00:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:35,320 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 12:00:35,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:35,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744892522] [2024-05-12 12:00:35,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744892522] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:35,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:35,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:00:35,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522692844] [2024-05-12 12:00:35,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:35,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:00:35,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:35,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:00:35,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:00:35,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 12:00:35,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 226 transitions, 2287 flow. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 12:00:35,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:35,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 12:00:35,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:37,904 INFO L124 PetriNetUnfolderBase]: 4663/7484 cut-off events. [2024-05-12 12:00:37,904 INFO L125 PetriNetUnfolderBase]: For 154060/154097 co-relation queries the response was YES. [2024-05-12 12:00:37,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40820 conditions, 7484 events. 4663/7484 cut-off events. For 154060/154097 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 47257 event pairs, 1729 based on Foata normal form. 14/7317 useless extension candidates. Maximal degree in co-relation 40751. Up to 6584 conditions per place. [2024-05-12 12:00:37,980 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 217 selfloop transitions, 15 changer transitions 0/256 dead transitions. [2024-05-12 12:00:37,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 256 transitions, 2917 flow [2024-05-12 12:00:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:00:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:00:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-05-12 12:00:37,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478134110787172 [2024-05-12 12:00:37,981 INFO L175 Difference]: Start difference. First operand has 155 places, 226 transitions, 2287 flow. Second operand 7 states and 164 transitions. [2024-05-12 12:00:37,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 256 transitions, 2917 flow [2024-05-12 12:00:38,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 256 transitions, 2849 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-05-12 12:00:38,106 INFO L231 Difference]: Finished difference. Result has 158 places, 229 transitions, 2297 flow [2024-05-12 12:00:38,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2219, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2297, PETRI_PLACES=158, PETRI_TRANSITIONS=229} [2024-05-12 12:00:38,107 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 103 predicate places. [2024-05-12 12:00:38,107 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 229 transitions, 2297 flow [2024-05-12 12:00:38,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 12:00:38,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:38,107 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 12:00:38,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:00:38,108 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:38,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash -830672433, now seen corresponding path program 1 times [2024-05-12 12:00:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:38,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615955410] [2024-05-12 12:00:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:38,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:52,340 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 12:00:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615955410] [2024-05-12 12:00:52,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615955410] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:52,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:52,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:00:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193029605] [2024-05-12 12:00:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:52,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:00:52,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:52,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:00:52,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:00:52,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:00:52,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 229 transitions, 2297 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 12:00:52,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:52,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:00:52,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:56,333 INFO L124 PetriNetUnfolderBase]: 5747/9070 cut-off events. [2024-05-12 12:00:56,334 INFO L125 PetriNetUnfolderBase]: For 224909/224917 co-relation queries the response was YES. [2024-05-12 12:00:56,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51794 conditions, 9070 events. 5747/9070 cut-off events. For 224909/224917 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 56958 event pairs, 1580 based on Foata normal form. 22/8830 useless extension candidates. Maximal degree in co-relation 51724. Up to 7282 conditions per place. [2024-05-12 12:00:56,439 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 232 selfloop transitions, 57 changer transitions 0/299 dead transitions. [2024-05-12 12:00:56,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 299 transitions, 3373 flow [2024-05-12 12:00:56,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:00:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:00:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2024-05-12 12:00:56,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192743764172335 [2024-05-12 12:00:56,441 INFO L175 Difference]: Start difference. First operand has 158 places, 229 transitions, 2297 flow. Second operand 9 states and 229 transitions. [2024-05-12 12:00:56,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 299 transitions, 3373 flow [2024-05-12 12:00:56,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 299 transitions, 3319 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-05-12 12:00:56,630 INFO L231 Difference]: Finished difference. Result has 164 places, 239 transitions, 2560 flow [2024-05-12 12:00:56,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2243, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2560, PETRI_PLACES=164, PETRI_TRANSITIONS=239} [2024-05-12 12:00:56,631 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 109 predicate places. [2024-05-12 12:00:56,631 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 239 transitions, 2560 flow [2024-05-12 12:00:56,631 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 12:00:56,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:56,632 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 12:00:56,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:00:56,632 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:56,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:56,632 INFO L85 PathProgramCache]: Analyzing trace with hash -742106673, now seen corresponding path program 2 times [2024-05-12 12:00:56,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:56,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247760339] [2024-05-12 12:00:56,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:13,589 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 12:01:13,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:13,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247760339] [2024-05-12 12:01:13,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247760339] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:13,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:13,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:01:13,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835080118] [2024-05-12 12:01:13,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:13,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:01:13,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:13,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:01:13,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:01:13,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:01:13,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 239 transitions, 2560 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 12:01:13,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:13,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:01:13,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:17,024 INFO L124 PetriNetUnfolderBase]: 5660/8970 cut-off events. [2024-05-12 12:01:17,024 INFO L125 PetriNetUnfolderBase]: For 225582/225590 co-relation queries the response was YES. [2024-05-12 12:01:17,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51738 conditions, 8970 events. 5660/8970 cut-off events. For 225582/225590 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 56533 event pairs, 1918 based on Foata normal form. 22/8733 useless extension candidates. Maximal degree in co-relation 51665. Up to 7430 conditions per place. [2024-05-12 12:01:17,096 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 229 selfloop transitions, 52 changer transitions 0/291 dead transitions. [2024-05-12 12:01:17,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 291 transitions, 3346 flow [2024-05-12 12:01:17,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:01:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:01:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-05-12 12:01:17,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2024-05-12 12:01:17,099 INFO L175 Difference]: Start difference. First operand has 164 places, 239 transitions, 2560 flow. Second operand 8 states and 203 transitions. [2024-05-12 12:01:17,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 291 transitions, 3346 flow [2024-05-12 12:01:17,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 291 transitions, 3187 flow, removed 52 selfloop flow, removed 4 redundant places. [2024-05-12 12:01:17,304 INFO L231 Difference]: Finished difference. Result has 169 places, 242 transitions, 2569 flow [2024-05-12 12:01:17,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2417, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2569, PETRI_PLACES=169, PETRI_TRANSITIONS=242} [2024-05-12 12:01:17,305 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 114 predicate places. [2024-05-12 12:01:17,305 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 242 transitions, 2569 flow [2024-05-12 12:01:17,305 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 12:01:17,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:17,305 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 12:01:17,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:01:17,305 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:17,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1457537449, now seen corresponding path program 3 times [2024-05-12 12:01:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:17,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623357975] [2024-05-12 12:01:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:17,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:34,679 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 12:01:34,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:34,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623357975] [2024-05-12 12:01:34,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623357975] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:34,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:34,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:01:34,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191586859] [2024-05-12 12:01:34,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:34,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:01:34,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:01:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:01:34,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:01:34,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 242 transitions, 2569 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 12:01:34,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:34,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:01:34,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:38,750 INFO L124 PetriNetUnfolderBase]: 5760/9167 cut-off events. [2024-05-12 12:01:38,751 INFO L125 PetriNetUnfolderBase]: For 233274/233282 co-relation queries the response was YES. [2024-05-12 12:01:38,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52705 conditions, 9167 events. 5760/9167 cut-off events. For 233274/233282 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 58172 event pairs, 1704 based on Foata normal form. 26/8938 useless extension candidates. Maximal degree in co-relation 52629. Up to 7470 conditions per place. [2024-05-12 12:01:38,845 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 211 selfloop transitions, 92 changer transitions 0/313 dead transitions. [2024-05-12 12:01:38,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 313 transitions, 3484 flow [2024-05-12 12:01:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:01:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:01:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 274 transitions. [2024-05-12 12:01:38,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083487940630798 [2024-05-12 12:01:38,847 INFO L175 Difference]: Start difference. First operand has 169 places, 242 transitions, 2569 flow. Second operand 11 states and 274 transitions. [2024-05-12 12:01:38,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 313 transitions, 3484 flow [2024-05-12 12:01:39,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 313 transitions, 3407 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-05-12 12:01:39,065 INFO L231 Difference]: Finished difference. Result has 176 places, 244 transitions, 2746 flow [2024-05-12 12:01:39,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2492, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2746, PETRI_PLACES=176, PETRI_TRANSITIONS=244} [2024-05-12 12:01:39,066 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 121 predicate places. [2024-05-12 12:01:39,066 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 244 transitions, 2746 flow [2024-05-12 12:01:39,066 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 12:01:39,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:39,066 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 12:01:39,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:01:39,067 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:39,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:39,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1308086163, now seen corresponding path program 4 times [2024-05-12 12:01:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:39,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645649281] [2024-05-12 12:01:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:39,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:56,826 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 12:01:56,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:56,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645649281] [2024-05-12 12:01:56,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645649281] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:56,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:56,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:01:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268473651] [2024-05-12 12:01:56,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:56,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:01:56,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:56,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:01:56,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:01:57,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:01:57,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 244 transitions, 2746 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 12:01:57,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:57,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:01:57,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:00,254 INFO L124 PetriNetUnfolderBase]: 5914/9409 cut-off events. [2024-05-12 12:02:00,255 INFO L125 PetriNetUnfolderBase]: For 256068/256076 co-relation queries the response was YES. [2024-05-12 12:02:00,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55412 conditions, 9409 events. 5914/9409 cut-off events. For 256068/256076 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 60014 event pairs, 1753 based on Foata normal form. 26/9173 useless extension candidates. Maximal degree in co-relation 55334. Up to 7704 conditions per place. [2024-05-12 12:02:00,353 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 216 selfloop transitions, 90 changer transitions 0/316 dead transitions. [2024-05-12 12:02:00,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 316 transitions, 3673 flow [2024-05-12 12:02:00,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:02:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:02:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 276 transitions. [2024-05-12 12:02:00,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120593692022264 [2024-05-12 12:02:00,355 INFO L175 Difference]: Start difference. First operand has 176 places, 244 transitions, 2746 flow. Second operand 11 states and 276 transitions. [2024-05-12 12:02:00,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 316 transitions, 3673 flow [2024-05-12 12:02:00,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 316 transitions, 3455 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-05-12 12:02:00,595 INFO L231 Difference]: Finished difference. Result has 178 places, 246 transitions, 2782 flow [2024-05-12 12:02:00,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2782, PETRI_PLACES=178, PETRI_TRANSITIONS=246} [2024-05-12 12:02:00,596 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 123 predicate places. [2024-05-12 12:02:00,596 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 246 transitions, 2782 flow [2024-05-12 12:02:00,596 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 12:02:00,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:00,596 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 12:02:00,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:02:00,597 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:00,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:00,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1292479377, now seen corresponding path program 5 times [2024-05-12 12:02:00,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:00,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764249872] [2024-05-12 12:02:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:18,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 12:02:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:18,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764249872] [2024-05-12 12:02:18,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764249872] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:18,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:18,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:02:18,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894809441] [2024-05-12 12:02:18,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:18,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:02:18,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:18,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:02:18,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:02:18,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:02:18,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 246 transitions, 2782 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 12:02:18,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:18,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:02:18,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:22,687 INFO L124 PetriNetUnfolderBase]: 6034/9586 cut-off events. [2024-05-12 12:02:22,687 INFO L125 PetriNetUnfolderBase]: For 266580/266588 co-relation queries the response was YES. [2024-05-12 12:02:22,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56699 conditions, 9586 events. 6034/9586 cut-off events. For 266580/266588 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 61135 event pairs, 1721 based on Foata normal form. 22/9353 useless extension candidates. Maximal degree in co-relation 56620. Up to 7508 conditions per place. [2024-05-12 12:02:22,801 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 218 selfloop transitions, 96 changer transitions 0/324 dead transitions. [2024-05-12 12:02:22,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 324 transitions, 3777 flow [2024-05-12 12:02:22,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:02:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:02:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 278 transitions. [2024-05-12 12:02:22,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157699443413729 [2024-05-12 12:02:22,803 INFO L175 Difference]: Start difference. First operand has 178 places, 246 transitions, 2782 flow. Second operand 11 states and 278 transitions. [2024-05-12 12:02:22,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 324 transitions, 3777 flow [2024-05-12 12:02:23,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 324 transitions, 3559 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-05-12 12:02:23,119 INFO L231 Difference]: Finished difference. Result has 181 places, 251 transitions, 2885 flow [2024-05-12 12:02:23,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2564, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2885, PETRI_PLACES=181, PETRI_TRANSITIONS=251} [2024-05-12 12:02:23,120 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 126 predicate places. [2024-05-12 12:02:23,120 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 251 transitions, 2885 flow [2024-05-12 12:02:23,120 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 12:02:23,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:23,120 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 12:02:23,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:02:23,121 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:23,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:23,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1457322247, now seen corresponding path program 1 times [2024-05-12 12:02:23,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:23,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002374914] [2024-05-12 12:02:23,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:23,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:38,753 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 12:02:38,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:38,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002374914] [2024-05-12 12:02:38,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002374914] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:38,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:38,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:02:38,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51592636] [2024-05-12 12:02:38,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:38,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:02:38,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:38,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:02:38,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:02:39,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:02:39,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 251 transitions, 2885 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:39,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:39,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:02:39,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:42,327 INFO L124 PetriNetUnfolderBase]: 6130/9728 cut-off events. [2024-05-12 12:02:42,327 INFO L125 PetriNetUnfolderBase]: For 277247/277255 co-relation queries the response was YES. [2024-05-12 12:02:42,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58062 conditions, 9728 events. 6130/9728 cut-off events. For 277247/277255 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 62245 event pairs, 1742 based on Foata normal form. 18/9492 useless extension candidates. Maximal degree in co-relation 57981. Up to 7496 conditions per place. [2024-05-12 12:02:42,421 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 216 selfloop transitions, 98 changer transitions 0/324 dead transitions. [2024-05-12 12:02:42,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 324 transitions, 3852 flow [2024-05-12 12:02:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:02:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:02:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 275 transitions. [2024-05-12 12:02:42,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-05-12 12:02:42,428 INFO L175 Difference]: Start difference. First operand has 181 places, 251 transitions, 2885 flow. Second operand 11 states and 275 transitions. [2024-05-12 12:02:42,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 324 transitions, 3852 flow [2024-05-12 12:02:42,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 324 transitions, 3680 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-05-12 12:02:42,783 INFO L231 Difference]: Finished difference. Result has 185 places, 253 transitions, 2990 flow [2024-05-12 12:02:42,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2713, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2990, PETRI_PLACES=185, PETRI_TRANSITIONS=253} [2024-05-12 12:02:42,783 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 130 predicate places. [2024-05-12 12:02:42,784 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 253 transitions, 2990 flow [2024-05-12 12:02:42,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:42,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:42,784 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 12:02:42,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:02:42,784 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:42,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 468256236, now seen corresponding path program 1 times [2024-05-12 12:02:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:42,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205987307] [2024-05-12 12:02:42,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:55,930 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 12:02:55,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:55,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205987307] [2024-05-12 12:02:55,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205987307] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:55,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:55,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:02:55,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035814284] [2024-05-12 12:02:55,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:55,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:02:55,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:55,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:02:55,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:02:56,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:02:56,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 253 transitions, 2990 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:56,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:56,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:02:56,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:59,155 INFO L124 PetriNetUnfolderBase]: 5996/9534 cut-off events. [2024-05-12 12:02:59,155 INFO L125 PetriNetUnfolderBase]: For 274356/274432 co-relation queries the response was YES. [2024-05-12 12:02:59,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57045 conditions, 9534 events. 5996/9534 cut-off events. For 274356/274432 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 61357 event pairs, 2177 based on Foata normal form. 25/9287 useless extension candidates. Maximal degree in co-relation 56962. Up to 8506 conditions per place. [2024-05-12 12:02:59,244 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 239 selfloop transitions, 23 changer transitions 0/285 dead transitions. [2024-05-12 12:02:59,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 285 transitions, 3692 flow [2024-05-12 12:02:59,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:02:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:02:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-05-12 12:02:59,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47230320699708456 [2024-05-12 12:02:59,246 INFO L175 Difference]: Start difference. First operand has 185 places, 253 transitions, 2990 flow. Second operand 7 states and 162 transitions. [2024-05-12 12:02:59,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 285 transitions, 3692 flow [2024-05-12 12:02:59,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 285 transitions, 3441 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-05-12 12:02:59,561 INFO L231 Difference]: Finished difference. Result has 183 places, 256 transitions, 2835 flow [2024-05-12 12:02:59,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2739, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2835, PETRI_PLACES=183, PETRI_TRANSITIONS=256} [2024-05-12 12:02:59,562 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 128 predicate places. [2024-05-12 12:02:59,562 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 256 transitions, 2835 flow [2024-05-12 12:02:59,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:59,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:59,562 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 12:02:59,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 12:02:59,562 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:59,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash -277263559, now seen corresponding path program 6 times [2024-05-12 12:02:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:59,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859218437] [2024-05-12 12:02:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:59,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:15,709 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 12:03:15,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:15,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859218437] [2024-05-12 12:03:15,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859218437] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:15,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:15,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:03:15,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86169818] [2024-05-12 12:03:15,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:15,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:03:15,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:15,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:03:15,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:03:15,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:03:15,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 256 transitions, 2835 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 12:03:15,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:15,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:03:15,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:19,235 INFO L124 PetriNetUnfolderBase]: 6349/10030 cut-off events. [2024-05-12 12:03:19,236 INFO L125 PetriNetUnfolderBase]: For 307745/307777 co-relation queries the response was YES. [2024-05-12 12:03:19,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60950 conditions, 10030 events. 6349/10030 cut-off events. For 307745/307777 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 64135 event pairs, 1836 based on Foata normal form. 26/9788 useless extension candidates. Maximal degree in co-relation 60866. Up to 8331 conditions per place. [2024-05-12 12:03:19,330 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 208 selfloop transitions, 92 changer transitions 0/311 dead transitions. [2024-05-12 12:03:19,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 311 transitions, 3710 flow [2024-05-12 12:03:19,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:03:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:03:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-05-12 12:03:19,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-05-12 12:03:19,332 INFO L175 Difference]: Start difference. First operand has 183 places, 256 transitions, 2835 flow. Second operand 9 states and 224 transitions. [2024-05-12 12:03:19,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 311 transitions, 3710 flow [2024-05-12 12:03:19,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 311 transitions, 3638 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-05-12 12:03:19,607 INFO L231 Difference]: Finished difference. Result has 187 places, 258 transitions, 3033 flow [2024-05-12 12:03:19,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2763, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3033, PETRI_PLACES=187, PETRI_TRANSITIONS=258} [2024-05-12 12:03:19,608 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 132 predicate places. [2024-05-12 12:03:19,608 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 258 transitions, 3033 flow [2024-05-12 12:03:19,608 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 12:03:19,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:19,608 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 12:03:19,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 12:03:19,608 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:19,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1523932115, now seen corresponding path program 7 times [2024-05-12 12:03:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220838302] [2024-05-12 12:03:19,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:28,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:28,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220838302] [2024-05-12 12:03:28,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220838302] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:28,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:28,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:03:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771490501] [2024-05-12 12:03:28,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:28,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:03:28,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:28,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:03:28,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:03:28,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:03:28,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 258 transitions, 3033 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 12:03:28,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:28,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:03:28,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:31,886 INFO L124 PetriNetUnfolderBase]: 6503/10283 cut-off events. [2024-05-12 12:03:31,887 INFO L125 PetriNetUnfolderBase]: For 338362/338382 co-relation queries the response was YES. [2024-05-12 12:03:31,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63935 conditions, 10283 events. 6503/10283 cut-off events. For 338362/338382 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 66140 event pairs, 1858 based on Foata normal form. 26/10040 useless extension candidates. Maximal degree in co-relation 63850. Up to 8565 conditions per place. [2024-05-12 12:03:31,992 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 216 selfloop transitions, 87 changer transitions 0/314 dead transitions. [2024-05-12 12:03:31,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 314 transitions, 3920 flow [2024-05-12 12:03:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:03:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:03:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2024-05-12 12:03:31,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147392290249433 [2024-05-12 12:03:31,994 INFO L175 Difference]: Start difference. First operand has 187 places, 258 transitions, 3033 flow. Second operand 9 states and 227 transitions. [2024-05-12 12:03:31,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 314 transitions, 3920 flow [2024-05-12 12:03:32,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 314 transitions, 3686 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-05-12 12:03:32,348 INFO L231 Difference]: Finished difference. Result has 189 places, 260 transitions, 3063 flow [2024-05-12 12:03:32,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2799, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3063, PETRI_PLACES=189, PETRI_TRANSITIONS=260} [2024-05-12 12:03:32,348 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 134 predicate places. [2024-05-12 12:03:32,348 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 260 transitions, 3063 flow [2024-05-12 12:03:32,349 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 12:03:32,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:32,349 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 12:03:32,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 12:03:32,349 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:32,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1242228853, now seen corresponding path program 8 times [2024-05-12 12:03:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:32,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999592647] [2024-05-12 12:03:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:32,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:48,731 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 12:03:48,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:48,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999592647] [2024-05-12 12:03:48,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999592647] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:48,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:48,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:03:48,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359706518] [2024-05-12 12:03:48,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:48,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:03:48,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:48,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:03:48,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:03:48,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:03:48,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 260 transitions, 3063 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 12:03:48,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:48,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:03:48,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:52,540 INFO L124 PetriNetUnfolderBase]: 6657/10522 cut-off events. [2024-05-12 12:03:52,540 INFO L125 PetriNetUnfolderBase]: For 357775/357799 co-relation queries the response was YES. [2024-05-12 12:03:52,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65674 conditions, 10522 events. 6657/10522 cut-off events. For 357775/357799 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 67859 event pairs, 1906 based on Foata normal form. 26/10273 useless extension candidates. Maximal degree in co-relation 65588. Up to 8799 conditions per place. [2024-05-12 12:03:52,647 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 217 selfloop transitions, 88 changer transitions 0/316 dead transitions. [2024-05-12 12:03:52,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 316 transitions, 3958 flow [2024-05-12 12:03:52,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:03:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:03:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2024-05-12 12:03:52,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124716553287982 [2024-05-12 12:03:52,649 INFO L175 Difference]: Start difference. First operand has 189 places, 260 transitions, 3063 flow. Second operand 9 states and 226 transitions. [2024-05-12 12:03:52,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 316 transitions, 3958 flow [2024-05-12 12:03:53,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 316 transitions, 3730 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-05-12 12:03:53,103 INFO L231 Difference]: Finished difference. Result has 191 places, 262 transitions, 3105 flow [2024-05-12 12:03:53,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2835, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3105, PETRI_PLACES=191, PETRI_TRANSITIONS=262} [2024-05-12 12:03:53,103 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 136 predicate places. [2024-05-12 12:03:53,104 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 262 transitions, 3105 flow [2024-05-12 12:03:53,104 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 12:03:53,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:53,104 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 12:03:53,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 12:03:53,104 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:53,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:53,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1242225133, now seen corresponding path program 9 times [2024-05-12 12:03:53,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:53,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601069098] [2024-05-12 12:03:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:53,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:09,322 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 12:04:09,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:09,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601069098] [2024-05-12 12:04:09,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601069098] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:09,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:09,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:09,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892284257] [2024-05-12 12:04:09,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:09,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:09,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:09,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:09,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:09,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:04:09,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 262 transitions, 3105 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 12:04:09,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:09,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:04:09,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:13,085 INFO L124 PetriNetUnfolderBase]: 6698/10589 cut-off events. [2024-05-12 12:04:13,086 INFO L125 PetriNetUnfolderBase]: For 356536/356560 co-relation queries the response was YES. [2024-05-12 12:04:13,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65648 conditions, 10589 events. 6698/10589 cut-off events. For 356536/356560 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 68411 event pairs, 1862 based on Foata normal form. 22/10338 useless extension candidates. Maximal degree in co-relation 65561. Up to 8288 conditions per place. [2024-05-12 12:04:13,194 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 217 selfloop transitions, 96 changer transitions 0/324 dead transitions. [2024-05-12 12:04:13,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 324 transitions, 4080 flow [2024-05-12 12:04:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-05-12 12:04:13,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2024-05-12 12:04:13,196 INFO L175 Difference]: Start difference. First operand has 191 places, 262 transitions, 3105 flow. Second operand 9 states and 228 transitions. [2024-05-12 12:04:13,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 324 transitions, 4080 flow [2024-05-12 12:04:13,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 324 transitions, 3846 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-05-12 12:04:13,812 INFO L231 Difference]: Finished difference. Result has 194 places, 267 transitions, 3228 flow [2024-05-12 12:04:13,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2871, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3228, PETRI_PLACES=194, PETRI_TRANSITIONS=267} [2024-05-12 12:04:13,813 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 139 predicate places. [2024-05-12 12:04:13,813 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 267 transitions, 3228 flow [2024-05-12 12:04:13,813 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 12:04:13,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:13,813 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 12:04:13,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 12:04:13,813 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:13,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1247950585, now seen corresponding path program 2 times [2024-05-12 12:04:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042408642] [2024-05-12 12:04:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:28,195 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 12:04:28,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:28,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042408642] [2024-05-12 12:04:28,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042408642] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:28,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:28,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:28,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915480663] [2024-05-12 12:04:28,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:28,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:28,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:28,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:28,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:28,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:04:28,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 267 transitions, 3228 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:28,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:28,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:04:28,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:32,002 INFO L124 PetriNetUnfolderBase]: 6779/10734 cut-off events. [2024-05-12 12:04:32,002 INFO L125 PetriNetUnfolderBase]: For 365452/365476 co-relation queries the response was YES. [2024-05-12 12:04:32,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66875 conditions, 10734 events. 6779/10734 cut-off events. For 365452/365476 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 69673 event pairs, 1916 based on Foata normal form. 18/10476 useless extension candidates. Maximal degree in co-relation 66786. Up to 8651 conditions per place. [2024-05-12 12:04:32,103 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 221 selfloop transitions, 93 changer transitions 0/325 dead transitions. [2024-05-12 12:04:32,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 325 transitions, 4169 flow [2024-05-12 12:04:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-05-12 12:04:32,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2024-05-12 12:04:32,105 INFO L175 Difference]: Start difference. First operand has 194 places, 267 transitions, 3228 flow. Second operand 9 states and 228 transitions. [2024-05-12 12:04:32,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 325 transitions, 4169 flow [2024-05-12 12:04:32,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 325 transitions, 3971 flow, removed 48 selfloop flow, removed 5 redundant places. [2024-05-12 12:04:32,591 INFO L231 Difference]: Finished difference. Result has 198 places, 269 transitions, 3317 flow [2024-05-12 12:04:32,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3030, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3317, PETRI_PLACES=198, PETRI_TRANSITIONS=269} [2024-05-12 12:04:32,591 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 143 predicate places. [2024-05-12 12:04:32,592 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 269 transitions, 3317 flow [2024-05-12 12:04:32,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:32,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:32,592 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 12:04:32,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 12:04:32,592 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:32,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:32,593 INFO L85 PathProgramCache]: Analyzing trace with hash -20547847, now seen corresponding path program 3 times [2024-05-12 12:04:32,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:32,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309764200] [2024-05-12 12:04:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:32,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:46,728 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 12:04:46,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:46,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309764200] [2024-05-12 12:04:46,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309764200] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:46,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:46,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961867981] [2024-05-12 12:04:46,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:46,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:46,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:46,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:46,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:46,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:04:46,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 269 transitions, 3317 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:46,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:46,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:04:46,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:50,401 INFO L124 PetriNetUnfolderBase]: 6865/10877 cut-off events. [2024-05-12 12:04:50,401 INFO L125 PetriNetUnfolderBase]: For 379756/379780 co-relation queries the response was YES. [2024-05-12 12:04:50,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68325 conditions, 10877 events. 6865/10877 cut-off events. For 379756/379780 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 70854 event pairs, 1955 based on Foata normal form. 18/10620 useless extension candidates. Maximal degree in co-relation 68234. Up to 8983 conditions per place. [2024-05-12 12:04:50,508 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 219 selfloop transitions, 96 changer transitions 0/326 dead transitions. [2024-05-12 12:04:50,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 326 transitions, 4262 flow [2024-05-12 12:04:50,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2024-05-12 12:04:50,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124716553287982 [2024-05-12 12:04:50,509 INFO L175 Difference]: Start difference. First operand has 198 places, 269 transitions, 3317 flow. Second operand 9 states and 226 transitions. [2024-05-12 12:04:50,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 326 transitions, 4262 flow [2024-05-12 12:04:50,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 326 transitions, 3999 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-05-12 12:04:50,883 INFO L231 Difference]: Finished difference. Result has 200 places, 271 transitions, 3351 flow [2024-05-12 12:04:50,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3054, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3351, PETRI_PLACES=200, PETRI_TRANSITIONS=271} [2024-05-12 12:04:50,884 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 145 predicate places. [2024-05-12 12:04:50,884 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 271 transitions, 3351 flow [2024-05-12 12:04:50,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:50,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:50,884 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 12:04:50,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 12:04:50,884 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:50,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash -11351077, now seen corresponding path program 4 times [2024-05-12 12:04:50,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:50,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941521505] [2024-05-12 12:04:50,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:50,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:04,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 12:05:04,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:04,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941521505] [2024-05-12 12:05:04,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941521505] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:04,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:04,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:05:04,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330805792] [2024-05-12 12:05:04,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:04,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:05:04,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:04,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:05:04,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:05:04,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:05:04,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 271 transitions, 3351 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:04,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:04,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:05:04,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:07,985 INFO L124 PetriNetUnfolderBase]: 6860/10863 cut-off events. [2024-05-12 12:05:07,985 INFO L125 PetriNetUnfolderBase]: For 374215/374239 co-relation queries the response was YES. [2024-05-12 12:05:08,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67458 conditions, 10863 events. 6860/10863 cut-off events. For 374215/374239 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 70688 event pairs, 1739 based on Foata normal form. 18/10607 useless extension candidates. Maximal degree in co-relation 67366. Up to 7512 conditions per place. [2024-05-12 12:05:08,104 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 198 selfloop transitions, 118 changer transitions 0/327 dead transitions. [2024-05-12 12:05:08,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 327 transitions, 4224 flow [2024-05-12 12:05:08,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:05:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:05:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-05-12 12:05:08,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-05-12 12:05:08,105 INFO L175 Difference]: Start difference. First operand has 200 places, 271 transitions, 3351 flow. Second operand 9 states and 224 transitions. [2024-05-12 12:05:08,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 327 transitions, 4224 flow [2024-05-12 12:05:08,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 327 transitions, 3955 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-05-12 12:05:08,609 INFO L231 Difference]: Finished difference. Result has 201 places, 272 transitions, 3347 flow [2024-05-12 12:05:08,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3004, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3347, PETRI_PLACES=201, PETRI_TRANSITIONS=272} [2024-05-12 12:05:08,609 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 146 predicate places. [2024-05-12 12:05:08,609 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 272 transitions, 3347 flow [2024-05-12 12:05:08,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:08,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:08,610 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 12:05:08,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 12:05:08,610 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:05:08,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:08,610 INFO L85 PathProgramCache]: Analyzing trace with hash -20200056, now seen corresponding path program 2 times [2024-05-12 12:05:08,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:08,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429216261] [2024-05-12 12:05:08,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:22,206 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 12:05:22,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:22,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429216261] [2024-05-12 12:05:22,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429216261] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:22,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:22,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:05:22,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968809192] [2024-05-12 12:05:22,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:22,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:05:22,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:22,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:05:22,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:05:22,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:05:22,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 272 transitions, 3347 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:22,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:22,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:05:22,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:25,579 INFO L124 PetriNetUnfolderBase]: 6639/10543 cut-off events. [2024-05-12 12:05:25,579 INFO L125 PetriNetUnfolderBase]: For 372507/372593 co-relation queries the response was YES. [2024-05-12 12:05:25,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65771 conditions, 10543 events. 6639/10543 cut-off events. For 372507/372593 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 68945 event pairs, 2319 based on Foata normal form. 50/10276 useless extension candidates. Maximal degree in co-relation 65678. Up to 9419 conditions per place. [2024-05-12 12:05:25,681 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 248 selfloop transitions, 35 changer transitions 0/306 dead transitions. [2024-05-12 12:05:25,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 306 transitions, 4299 flow [2024-05-12 12:05:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:05:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:05:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-05-12 12:05:25,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47230320699708456 [2024-05-12 12:05:25,682 INFO L175 Difference]: Start difference. First operand has 201 places, 272 transitions, 3347 flow. Second operand 7 states and 162 transitions. [2024-05-12 12:05:25,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 306 transitions, 4299 flow [2024-05-12 12:05:26,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 306 transitions, 3982 flow, removed 42 selfloop flow, removed 7 redundant places. [2024-05-12 12:05:26,091 INFO L231 Difference]: Finished difference. Result has 201 places, 278 transitions, 3200 flow [2024-05-12 12:05:26,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3030, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3200, PETRI_PLACES=201, PETRI_TRANSITIONS=278} [2024-05-12 12:05:26,091 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 146 predicate places. [2024-05-12 12:05:26,092 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 278 transitions, 3200 flow [2024-05-12 12:05:26,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:26,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:26,092 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 12:05:26,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 12:05:26,092 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:05:26,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:26,093 INFO L85 PathProgramCache]: Analyzing trace with hash -19754586, now seen corresponding path program 3 times [2024-05-12 12:05:26,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:26,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696123497] [2024-05-12 12:05:26,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:26,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:39,160 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 12:05:39,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:39,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696123497] [2024-05-12 12:05:39,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696123497] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:39,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:39,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:05:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422572019] [2024-05-12 12:05:39,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:39,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:05:39,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:39,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:05:39,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:05:39,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:05:39,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 278 transitions, 3200 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:39,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:39,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:05:39,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:42,422 INFO L124 PetriNetUnfolderBase]: 6632/10497 cut-off events. [2024-05-12 12:05:42,422 INFO L125 PetriNetUnfolderBase]: For 367953/368051 co-relation queries the response was YES. [2024-05-12 12:05:42,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65034 conditions, 10497 events. 6632/10497 cut-off events. For 367953/368051 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 68244 event pairs, 2312 based on Foata normal form. 57/10245 useless extension candidates. Maximal degree in co-relation 64940. Up to 9414 conditions per place. [2024-05-12 12:05:42,525 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 246 selfloop transitions, 36 changer transitions 0/305 dead transitions. [2024-05-12 12:05:42,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 305 transitions, 3966 flow [2024-05-12 12:05:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:05:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:05:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-05-12 12:05:42,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46647230320699706 [2024-05-12 12:05:42,527 INFO L175 Difference]: Start difference. First operand has 201 places, 278 transitions, 3200 flow. Second operand 7 states and 160 transitions. [2024-05-12 12:05:42,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 305 transitions, 3966 flow [2024-05-12 12:05:42,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 305 transitions, 3866 flow, removed 34 selfloop flow, removed 3 redundant places. [2024-05-12 12:05:42,897 INFO L231 Difference]: Finished difference. Result has 205 places, 278 transitions, 3178 flow [2024-05-12 12:05:42,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3100, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3178, PETRI_PLACES=205, PETRI_TRANSITIONS=278} [2024-05-12 12:05:42,897 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 150 predicate places. [2024-05-12 12:05:42,897 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 278 transitions, 3178 flow [2024-05-12 12:05:42,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:42,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:42,898 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 12:05:42,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 12:05:42,898 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:05:42,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:42,898 INFO L85 PathProgramCache]: Analyzing trace with hash -449498547, now seen corresponding path program 1 times [2024-05-12 12:05:42,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:42,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215191704] [2024-05-12 12:05:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:42,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15